Sciweavers

272 search results - page 4 / 55
» The compressed permuterm index
Sort
View
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 3 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
EDBT
2010
ACM
392views Database» more  EDBT 2010»
14 years 5 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
DCC
2008
IEEE
14 years 10 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
BIBE
2005
IEEE
107views Bioinformatics» more  BIBE 2005»
14 years 4 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...
EDBT
2008
ACM
118views Database» more  EDBT 2008»
14 years 11 months ago
The SBC-tree: an index for run-length compressed sequences
Mohamed Y. Eltabakh, Wing-Kai Hon, Rahul Shah, Wal...