99 search results - page 11 / 20 » Compression, Indexing, and Retrieval for Massive String Data |
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
PODS
2011
ACM
12 years 11 months ago
2011
ACM
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
SIGMOD
2008
ACM
13 years 8 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...