Sciweavers

139 search results - page 11 / 28
» Compression of inverted indexes for fast query evaluation
Sort
View
WWW
2008
ACM
14 years 11 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
15 years 6 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
16 years 1 months ago
Hierarchical Indexing Approach to Support XPath Queries
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer Özsu, N...
EDBT
2004
ACM
313views Database» more  EDBT 2004»
15 years 12 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
ADC
2008
Springer
135views Database» more  ADC 2008»
15 years 6 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo