Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Opportunistic data structures with applications
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On compressing and indexing data
On compressing and indexing data
Algorithmic foundations of the internet
ACM SIGACT News
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Counting suffix arrays and strings
Theoretical Computer Science
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Succinct representations of permutations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Modeling parametric web arc weight measurement
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Optimal trade-offs for succinct string indexes
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
String matching on the internet
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Search engines and web information retrieval
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Counting suffix arrays and strings
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Hi-index | 0.00 |
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response time and the size of the index. When indexing a large corpus, such as the web, the size of the index is an important consideration. In this case it would be ideal to produce an index that is substantially smaller than the text. In this work we prove a linear worst-case lower bound on the size of any index that reports the location (if any) of a substring in the text in time proportional to the length of the pattern. In other words, an index supporting linear-time substring searches requires about as much space as the original text. Here "time" is measured in the number of bit probes to the text; an arbitrary amount of computation may be done on an arbitrary amount of the index. Our lower bound applies to inverted word indices as well.