The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Accelerating XPath location steps
Proceedings of the 2002 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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tree-pattern queries on a lightweight XML processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Efficient Processing of Narrow Range Queries in Multi-dimensional Data Structures
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Optimization of disk accesses for multidimensional range queries
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
On support of ordering in multidimensional data structures
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Proceedings of the VLDB Endowment
Extended XML Tree Pattern Matching: Theories and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Implementation of XPath axes in the multi-dimensional approach to indexing XML data
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
On the efficient processing regular path expressions of an enormous volume of XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Holistic approaches are considered as the most robust solution for processing of twig pattern queries requiring no complicated query optimization. Holistic approaches use an abstract data type called a stream which is an ordered set of XML nodes with the same schema node. A straightforward implementation of a stream is a paged array. In this article, we introduce a multidimensional implementation of the stream for path labeling schemes. We also show that this implementation can be extended in such a way that it supports fast searching of nodes with a content. Although many multidimensional data structures have been introduced in recent years, we show that it is necessary to combine two variants of the R-tree (Ordered R-tree and Signature R-tree) for an efficient implementation the stream ADT.