99 search results - page 4 / 20 » Compression, Indexing, and Retrieval for Massive String Data |
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Real datasets are often large enough to necessitate data compression. Traditional `syntactic' data compression methods treat the table as a large byte string and operate at t...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
BIBE
2005
IEEE
14 years 29 days ago
2005
IEEE
In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the ge...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...