Sciweavers

99 search results - page 1 / 20
» Compression, Indexing, and Retrieval for Massive String Data
Sort
View
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
13 years 10 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 5 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGIR
2011
ACM
12 years 8 months ago
Inverted indexes for phrases and strings
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...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
MIR
2004
ACM
242views Multimedia» more  MIR 2004»
13 years 11 months ago
Content based access for a massive database of human observation video
We present in this paper a CBIR system for use in a psychological study of the relationship between human movement and Dyslexia. The system allows access to up to 500 hours of vid...
Laurent Joyeux, Erika Doyle, Hugh Denman, Andrew C...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
13 years 11 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...