Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Moshe Mor

dblp:m/MosheMor · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 1983
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Indexing and storage engines · 54% Information retrieval · 46%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines › data compression
dictionary compression		 0.011983
Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments · SIGIR 1983
Information retrieval
text compression		 0.011982
Is Text Compression by Prefizes and Suffixes Practical? · SIGIR 1982
Memory systems
memory hierarchy		 0.011983
Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments · SIGIR 1983
YearPublicationVenuePosition
1983 Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments
abstract
A method for compressing large dictionaries is proposed, based on transforming words into lexicographically ordered strings of distinct letters, together with permutation indexes. Algorithms to generate such strings are described. Results of applying the method to the dictionaries of two databases, in Hebrew and English, are presented in detail. The main message is a method of partitioning the dictionary such that the "information bearing fraction" is stored in fast memory, and the bulk in auxiliary memory.
Aviezri S. Fraenkel, Moshe Mor
 SIGIR2
1983 Is Text Compression by Prefixes and Suffixes Practical?
Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl
 Acta Informatica2
1983 Combinatorial Compression and Partitioning of Large Dictionaries
abstract
A method for compressing large dictionaries is proposed, based on transforming words into lexicographically ordered strings of distinct letters, together with permutation indexes. Algorithms to generate such strings are described. Results of applying the method to the dictionaries of two large databases, in Hebrew and English, are presented. The main message is a method of partitioning the dictionary such that the ‘information bearing fraction’ is stored in fast memory, and the bulk in auxiliary memory.
Aviezri S. Fraenkel, Moshe Mor
 Comput. J.2
1982 Is Text Compression by Prefizes and Suffixes Practical?
Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl
 SIGIR2
1982 Permutation Generation on Vector Processors
abstract
An efficient algorithm for generating a sequence of all the permutations P(i) on N symbols using parallel processors, all of which perform identical operations, is presented (0 /(/) is given explicitly.
Moshe Mor, Aviezri S. Fraenkel
 Comput. J.1