295 search results - page 9 / 59 » Compressed full-text indexes |
SPIRE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
DL
1995
Springer
13 years 11 months ago
1995
Springer
: A large amount of computing literature has become available over the Internet, as university departments and research institutions have made their technical reports, preprints, a...
CPM
2010
Springer
14 years 22 days ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...