Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
The Join Algorithms on a Shared-Memory Multiprocessor Database Machine
IEEE Transactions on Software Engineering
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Efficient Algorithms for the Instantiated Transitive Closure Queries
IEEE Transactions on Software Engineering
Data & Knowledge Engineering
Object-oriented database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Designing Xml Databases
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Electronic voting systems: Requirements, design, and implementation
Computer Standards & Interfaces
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.00 |
The Extensible Markup Language (XML) model has recently gained huge popularity because of its ability to represent a wide variety of structured and semi-structured data. Several Query languages have been proposed for the XML data model, the most-widely known is XQuery. Traditional XML query processing research has concentrated on data retrieval from independent XML documents and on the associate structures. In this paper, we review these algorithms and structures and show their superiority when processing independent XML documents. However, the direct application of these algorithms to process queries against interlinked XML documents is shown to generate incorrect results. A new algorithm and the associate structures suitable to process queries against both independent and inter-linked XML data are developed and shown to generate correct results.