99 search results - page 7 / 20 » Compression, Indexing, and Retrieval for Massive String Data |
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
JSS
2006
13 years 7 months ago
2006
Recent progress of computer and network technologies makes it possible to store and retrieve a large volume of multimedia data in many applications. In such applications, efficien...
EDBT
2010
ACM
13 years 10 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...