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
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XML Data Management: Native XML and XML Enabled DataBase Systems
XML Data Management: Native XML and XML Enabled DataBase Systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
The Geometric Framework for Exact and Similarity Querying XML Data
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Relevance measures for XML information retrieval
International Journal of Web and Grid Services
A cost-based join selection for XML twig content-based queries
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
On the efficient search of an XML twig query in large DataGuide trees
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Efficient searching in large inheritance hierarchies
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Multidimensional implementation of stream ADT
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
XML query processing: efficiency and optimality
Proceedings of the 16th International Database Engineering & Applications Sysmposium
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
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
XML (Extensible Mark-up Language) has been recently understood as a new approach to data modelling An implementation of a system enabling us to store and query XML documents efficiently requires the development of new techniques which make it possible to index an XML document in a way that provides an efficient evaluation of a user query Most XML query languages are based on the language XPath and use a form of path expressions for composing more general queries XPath defines a family of 13 axes, i.e relationship types in which an actual element can be associated to other elements in the XML tree Previously published multi-dimensional approaches to indexing XML data use paged and balanced multi-dimensional data structures like UB-trees and R*-trees In this paper we revise the approaches and introduce a novel approach to the implementation of an XPath subset.