273 search results - page 2 / 55 » Compressed String Dictionaries |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
DATESO
2006
13 years 9 months ago
2006
Some text compression methods take advantage from using more complex compression units than characters. The synchronization between coder and decoder then can be done by transferri...
CPM
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...