Sciweavers

50 search results - page 4 / 10
» Compressing Bitmap Indexes for Faster Search Operations
Sort
View
111
Voted
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
14 years 10 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
VLDB
1993
ACM
138views Database» more  VLDB 1993»
15 years 1 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
BIBE
2005
IEEE
107views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
DSIM: A Distance-Based Indexing Method for Genomic Sequences
In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the ge...
Xia Cao, Beng Chin Ooi, HweeHwa Pang, Kian-Lee Tan...
IR
2000
14 years 9 months ago
Adding Compression to Block Addressing Inverted Indexes
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
Gonzalo Navarro, Edleno Silva de Moura, Marden S. ...
180
Voted
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
15 years 11 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...