Sciweavers

1567 search results - page 8 / 314
» Compressing Relations and Indexes
Sort
View
MDM
2005
Springer
118views Communications» more  MDM 2005»
14 years 1 months ago
kNR-tree: a novel R-tree-based index for facilitating spatial window queries on any k relations among N spatial relations in mob
The ever-increasing popularity of mobile applications coupled with the prevalence of spatial data has created the need for efficient processing of spatial queries in mobile enviro...
Anirban Mondal, Anthony K. H. Tung, Masaru Kitsure...
ACL
2009
13 years 5 months ago
Leveraging Structural Relations for Fluent Compressions at Multiple Compression Rates
Prior approaches to sentence compression have taken low level syntactic constraints into account in order to maintain grammaticality. We propose and successfully evaluate a more c...
Sourish Chaudhuri, Naman K. Gupta, Noah A. Smith, ...
SPIRE
2007
Springer
14 years 1 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 15 days 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 2 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...