There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponential increase of electronic data nowadays available which is even surpassing the significant increase in memory and disk storage capacities of current computers. Space reduction is an attractive issue because it is also intimately related to performance improvements as noted by several authors (e.g. Knuth [15], Bentley [5]). In designing these implicit data structures the goal is to reduce as much as possible the auxiliary information kept together with the input data without introducing a significant slowdown in the final query performance. Yet input data are represented in their entirety thus taking no advantage of possible repetitiveness into them. The importance of those issues is well known to programmers who typically use various tricks to squeeze data as much as possible and still achieve good query performance. Their approaches, though, boil down to heuristics whose e#ectiveness is witnessed only by experimentation.
|
596
|
Managing Gigabytes: Compressing and Indexing Documents and Images
– Witten, Moffat, et al.
- 1994
|
|
451
|
Suffix arrays: A new method for on-line string searches
– Manber, Myers
- 1993
|
|
430
|
A space-economical suffix tree construction algorithm
– McCreight
- 1976
|
|
342
|
A Block-Sorting Lossless Data Compression Algorithm
– Burrows, Wheeler
- 1994
|
|
288
|
Text Algorithms
– Crochemore, Rytter
- 1994
|
|
217
|
Sorting and Searching, volume 3 of The Art of Computer Programming
– Knuth
- 1973
|
|
175
|
Overview of the third text retrieval conference
– Harman
- 1995
|
|
171
|
glimpse: A tool to search through entire file systems
– Manber, Wu
- 1993
|
|
135
|
Programming Pearls
– Bentley
- 1986
|
|
127
|
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
– Grossi, Vitter
|
|
101
|
Agrep -- a fast approximate pattern-matching tool
– Wu, Manber
- 1992
|
|
82
|
The string B-tree: a new data structure for string search in external memory and its applications
– Ferragina, Grossi
- 1999
|
|
78
|
Data Compression: The Complete Reference
– SALOMON
- 2000
|
|
71
|
An analysis of the Burrows-Wheeler transform
– Mäkinen, Manzini, et al.
- 2001
|
|
70
|
String matching in Lempel-Ziv compressed strings
– Farach, Thorup
- 1998
|
|
69
|
Let sleeping files lie: pattern matching in z-compressed files
– Amir, Benson, et al.
- 1994
|
|
59
|
Optimal two-dimensional compressed matching
– Amir, Benson, et al.
- 1994
|
|
55
|
A space economical sux tree construction algorithm
– McCreight
- 1976
|
|
39
|
Adding compression to block addressing inverted indexes. Information Retrieval
– Navarro, Moura, et al.
- 2000
|
|
35
|
Block-addressing indices for approximate text retrieval
– Baeza-Yates, Navarro
- 1997
|
|
34
|
Lempel-Ziv parsing and sublinear-size index structures for string matching
– Karkkainen, Ukkonen
- 1996
|
|
28
|
An implicit data structure supporting insertion, deletion, and search in O(log 2 n) time
– Munro
- 1986
|
|
26
|
Optimal prediction for prefetching in the worst case
– Krishnan, Vitter
- 1994
|
|
20
|
Worst-case optimal insertion and deletion methods for decomposable searching problems
– Overmars, Leeuwen
- 1981
|
|
18
|
Text compression using antidictionaries
– Crochemore, Mignosi, et al.
- 1999
|
|
18
|
Indexing compressed text
– Moura, Navarro, et al.
- 1997
|
|
15
|
Using difficulty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs
– Chen, Reif
- 1993
|
|
15
|
Lempel-Ziv index for q-grams
– Karkkainen, Sutinen
- 1996
|
|
15
|
Compressed sux arrays and sux trees with applications to text indexing and string matching
– Grossi, Vitter
- 2000
|
|
13
|
Let sleeping lie: Pattern matching in Z-compressed
– Amir, Benson, et al.
- 1994
|
|
12
|
Multi-method dispatching: A geometric approach with applications to string matching problems
– Ferragina, Muthukrishnan, et al.
- 1999
|
|
12
|
Optimal Dynamization of Decomposable Searching Problems
– Mehlhorn, Overmars
- 1981
|
|
12
|
Reducing the space requirement of su#x trees
– Kurtz
- 1998
|
|
12
|
Human Behaviour and the Principle of Least Eort
– Zipf
- 1949
|
|
10
|
Searching Large Text Collections
– Baeza-Yates, Moffat, et al.
- 2002
|
|
9
|
A locally adaptive compression scheme
– Bentley, Sleator, et al.
- 1986
|
|
9
|
The bzip2 home page
– Seward
- 1997
|
|
8
|
glimpse: A tool to search through entire systems
– Manber, Wu
- 1994
|
|
7
|
Sorting and searching revisited
– Andersson
- 1996
|
|
7
|
Succinct data structures
– Munro
- 1999
|
|
6
|
Space ecient sux trees
– Munro, Raman, et al.
- 2001
|
|
5
|
A modified Burrows-Wheeler transformation for case-insensitive search with application to suffix array compression
– Sadakane
- 1999
|
|
5
|
The Burrows-Wheeler transform: Theory and practice
– Manzini
- 1999
|
|
4
|
Markov paging (extended abstract
– Karlin, Phillips, et al.
- 1992
|
|
3
|
Information retrieval: theoretical and computational aspects
– Heaps
- 1978
|
|
2
|
Using diculty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs
– Chen, Reif
- 1993
|
