9 search results - page 1 / 2 » On searching compressed string collections cache-obliviously |
PODS
2008
ACM
14 years 11 months ago
2008
ACM
SIGIR
2011
ACM
13 years 1 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
ICDE
2009
IEEE
15 years 17 days ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
CORR
2011
Springer
13 years 5 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 ...
IMCSIT
2010
13 years 8 months ago
2010
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...