1567 search results - page 1 / 314 » Compressing Relations and Indexes |
ICDE
1998
IEEE
13 years 9 months ago
1998
IEEE
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
WWW
2008
ACM
13 years 4 months ago
2008
ACM
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...
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...