Sciweavers

99 search results - page 8 / 20
» Compression, Indexing, and Retrieval for Massive String Data
Sort
View
WWW
2007
ACM
14 years 8 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
CIKM
2009
Springer
14 years 1 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...
WWW
2008
ACM
14 years 8 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
VLDB
1993
ACM
138views Database» more  VLDB 1993»
13 years 11 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
ICIP
2001
IEEE
14 years 9 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman