Sciweavers

1567 search results - page 31 / 314
» Compressing Relations and Indexes
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 10 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
CIKM
2009
Springer
14 years 1 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
DAS
1998
Springer
14 years 1 months ago
Group 4 Compressed Document Matching
Numerous approaches, including textual, structural and featural, to detecting duplicate documents have been investigated. Considering document images are usually stored and transm...
Dar-Shyang Lee, Jonathan J. Hull
JUCS
2011
113views more  JUCS 2011»
13 years 4 months ago
Nabuco - Two Decades of Document Processing in Latin America
: This paper reports on the Joaquim Nabuco Project, a pioneering work in Latin America on document digitalization, enhancement, compression, indexing, retrieval and network transmi...
Rafael Dueire Lins
SIGIR
2011
ACM
12 years 11 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...