99 search results - page 9 / 20 » Compression, Indexing, and Retrieval for Massive String Data |
DATESO
2009
13 years 5 months ago
2009
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
BIBE
2010
IEEE
13 years 2 months ago
2010
IEEE
The study of compressed storage schemes for highly repetitive sequence collections has been recently boosted by the availability of cheaper sequencing technologies and the flood of...
ACL
2001
13 years 8 months ago
2001
In this paper, we compare the relative effects of segment order, segmentation and segment contiguity on the retrieval performance of a translation memory system. We take a selecti...
SPIRE
2009
Springer
14 years 1 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...