99 search results - page 7 / 20 » Compression, Indexing, and Retrieval for Massive String Data |
177
Voted
PODS
2009
ACM
16 years 4 days 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...
107
click to vote
WWW
2008
ACM
16 years 8 days 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
15 years 5 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...
111
Voted
JSS
2006
14 years 11 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...
82
Voted
EDBT
2010
ACM
15 years 2 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...