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
Honey, I shrunk the XQuery!: an XML algebra optimization approach
Proceedings of the 4th international workshop on Web information and data management
Tamino - A DBMS designed for XML
Proceedings of the 17th International Conference on Data Engineering
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The VLDB Journal — The International Journal on Very Large Data Bases
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 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
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pattern tree algebras: sets or sequences?
VLDB '05 Proceedings of the 31st international conference on Very large data bases
ULoad: choosing the right storage for your XML application
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Reformulating XPath queries and XSLT queries on XSLT views
Data & Knowledge Engineering
Using reflection for querying XML documents
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Querying complex structured databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
DUMAX: a dual mode algebra for XML queries
Proceedings of the 2nd international conference on Scalable information systems
Rules for query rewrite in native XML databases
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
Expressing OLAP operators with the TAX XML algebra
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
SQL/XML Performance Analysis of Parent/Ancestor Queries
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Reducing Temporary Trees in XQuery
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
XTCcmp: XQuery compilation on XTC
Proceedings of the VLDB Endowment
Data mining-based fragmentation of XML data warehouses
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Efficient keyword search over virtual XML views
The VLDB Journal — The International Journal on Very Large Data Bases
Enhancing XML data warehouse query performance by fragmentation
Proceedings of the 2009 ACM symposium on Applied Computing
Shifting Predicates to Inner Sub-expressions for XQuery Optimization
Advanced Internet Based Systems and Applications
Fragmenting very large XML data warehouses via K-means clustering algorithm
International Journal of Business Intelligence and Data Mining
Performance analysis of child/descendant queries in an XML-enabled database
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Semantic aware RSS query algebra
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
MemBeR: a micro-benchmark repository for XQuery
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
The importance of algebra for XML query processing
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Efficiently processing XML queries over fragmented repositories with partix
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
Algebra-Based identification of tree patterns in XQuery
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Quantum logic based MPEG query format algebra
AMR'10 Proceedings of the 8th international conference on Adaptive Multimedia Retrieval: context, exploration, and fusion
Benchmarking summarizability processing in XML warehouses with complex hierarchies
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
RSS query algebra: Towards a better news management
Information Sciences: an International Journal
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically manipulates sets of objects with identical structure. A set of XML elements, say of type book, may have members that vary greatly in structure, e.g. in the number of author sub-elements. This kind of heterogeneity may permeate the entire document in a recursive fashion: e.g., different authors of the same or different book may in turn greatly vary in structure. Even when the document conforms to a schema, the flexible nature of schemas for XML still allows such significant variations in structure among elements in a collection. Bulk processing of such heterogeneous sets is problematic.In this paper, we introduce the notion of logical classes (LC) of pattern tree nodes, and generalize the notion of pattern tree matching to handle node logical classes. This abstraction pays off significantly in allowing us to reason with an inherently heterogeneous collection of elements in a uniform, homogeneous way. Based on this, we define a Tree Logical Class (TLC) algebra that is capable of handling the heterogeneity arising in XML query processing, while avoiding redundant work. We present an algorithm to obtain a TLC algebra expression from an XQuery statement (for a large fragment of XQuery). We show how to implement the TLC algebra efficiently, introducing the nest-join as an important physical operator for XML query processing. We show that evaluation plans generated using the TLC algebra not only are simpler but also perform better than those generated by competing approaches. TLC is the algebra used in the Timber [8] system developed at the University of Michigan.