Information Theory and Reliable Communication
Information Theory and Reliable Communication
The Complexity of Some Simple Retrieval Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Succinct representations of lcp information and improvements in the compressed suffix arrays
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the space requirements of navigational relationship representations
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Kraft storage and access for list implementations(Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
ACM SIGIR Forum
Compressed collections for simulated crawling
ACM SIGIR Forum
Faster and Space-Optimal Edit Distance "1" Dictionary
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Minimum times and memories needed to compute the values of a function
Journal of Computer and System Sciences
Broadword implementation of rank/select queries
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Succinct dictionary matching with no slowdown
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Fast prefix search in little space, with applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Theory and practice of monotone minimal perfect hashing
Journal of Experimental Algorithmics (JEA)
Semi-indexing semi-structured data in tiny space
Proceedings of the 20th ACM international conference on Information and knowledge management
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Efficient approximate dictionary look-up for long words over small alphabets
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Compressed string dictionary look-up with edit distance one
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Hi-index | 0.00 |
We consider a set of static files or inventories, each consisting of the same number of entries, each entry a binary word of the same fixed length selected (with replacement) from the set of all binary sequences of that length, and the entries in each file sorted into lexical order. We also consider several retrieval questions of interest for each such file. One is to find the value of the jth entry, another to find the number of entries of value less than k.When a binary representation of such a file is stored in computer memory and an algorithm or machine which knows only the file parameters (i.e. number of entries, number of possible values per entry) accesses some of the stored bits to answer a retrieval question, the number of bits stored and the number of bits accessed per retrieval question are two cost measures for the storage and retrieval task which have been used by Minsky and Papert. Bits stored depends on the representation chosen: bits accessed also depends on the retrieval question asked and on the algorithm used.We give firm lower bounds to minimax measures of bits stored and bits accessed for each of four retrieval questions, and construct representations and algorithms for a bit-addressable machine which come within factors of two or three of attaining all four bounds at once for files of any size. All four factors approach one for large enough files.