Sciweavers

50 search results - page 3 / 10
» Compressing Bitmap Indexes for Faster Search Operations
Sort
View
SIGIR
2011
ACM
12 years 9 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
13 years 10 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 6 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...
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 7 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 7 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian