Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
Simulation of compressible flow on a massively parallel architecture
Scientific Programming - On applications analysis
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Data Compression
Index Structures for Matching XML Twigs Using Relational Query Processors
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Database Systems: The Complete Book
Database Systems: The Complete Book
TJDewey --- On the Efficient Path Labeling Scheme Holistic Approach
Database Systems for Advanced Applications
Fast decoding algorithms for variable-lengths codes
Information Sciences: an International Journal
XML query processing: efficiency and optimality
Proceedings of the 16th International Database Engineering & Applications Sysmposium
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
In recent years, many approaches to XML twig pattern query processing have been developed. Holistic approaches are particularly significant in that they provide a theoretical model for optimal processing of some query classes and have very low main memory complexity. Holistic algorithms are supported by a stream abstract data type. This data type is usually implemented using inverted lists or special purpose data structures. In this article, we focus on an efficient implementation of a stream ADT. We utilize previously proposed fast decoding algorithms for some prefix variable-length codes, like Elias-delta, Fibonacci of order 2 and 3 as well as Elias-Fibonacci codes. We compare the efficiency of the access to a stream using various decompression algorithms. These results are compared with the result of data structures where no compression is used. We show that the compression improves the efficiency of XML query processing.