Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Database and information retrieval techniques for XML
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
On-demand index for efficient structural joins
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Hash-based structural join algorithms
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
XML query languages provide facilities to query XML data both on their value as well as their structure. A basic operation in processing and optimizing such queries is the containment join, which takes two sets of elements and returns pairs of elements where one is the ancestor (or descendant) of the other. Most of the techniques proposed so far assume that the two sets are already sorted or utilize preexisting indexing schemes. In contrast, a partition-based technique does not require indexing or sorting. Instead, the containment join is processed by dividing the input sets into smaller partitions. In this paper, we present a new partition-based scheme that gracefully adapts to different document sizes. The advantages of our approach are validated through an experimental comparison with previous work. Moreover, the experiments demonstrate that our solution provides a viable alternative to non-partition join algorithms when the input data is neither sorted nor indexed.