ACM Home Page
Please provide us with feedback. Feedback
Optimizing cursor movement in holistic twig joins
Full text PdfPdf (198 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 14th ACM international conference on Information and knowledge management table of contents
Bremen, Germany
SESSION: Paper session DB-10 (databases): query processing 2 table of contents
Pages: 784 - 791  
Year of Publication: 2005
ISBN:1-59593-140-6
Authors
Marcus Fontoura  IBM Almaden Research Center, San Jose, CA
Vanja Josifovski  IBM Almaden Research Center, San Jose, CA
Eugene Shekita  IBM Almaden Research Center, San Jose, CA
Beverly Yang  IBM Almaden Research Center, San Jose, CA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 59,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1099554.1099741
What is a DOI?

ABSTRACT

Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set of index cursors in a coordinated way to quickly find structural matches. Because each cursor move can trigger I/O, the performance of a holistic twig join is largely determined by how many cursor moves it makes, yet, surprisingly, existing join algorithms have not been optimized along these lines. In this paper, we describe TwigOptimal, a new holistic twig join algorithm with optimal cursor movement. We sketch the proof of TwigOptimal's optimality, and describe how TwigOptimal can use information in the return clause of XQuery to boost its performance. Finally, experimental results are presented, showing TwigOptimal's superiority over existing holistic twig join algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Al-Khalifa, H. Jagadish, N. Koudas, J. Patel, D. Srivastava, and Y. Wu. Structural joins: A primitive for efficient xml query pattern matching. In ICDE, 2002.
2
3
4
 
5
S. Chien, Z. Vagena, D. Zhang, V. Tsotras, and C. Zaniolo. Efficient structural joins on indexed xml documents. In VLDB, 2002.
 
6
World Wide~Web Consortium. Xquery 1.0: An xml query language, August 2001. http://www.w3.org/TR/xquery/.
 
7
 
8
9
 
10
H. Jiang, H. Lu, W. Wang, and B. C. Ooi. Xr-tree: Indexing xml data for efficient structural join. In ICDE, 2003.
11
 
12
H. Jiang, W. Wang, H. Lu, and J. Yu. Holistic twig joins on indexed xml documents. In VLDB, 2003.
 
13
 
14
R. Kaushik, R. Krishnamurthy, J. Naughton, and R. Ramakrishnan. On the integration of structure indexes and inverted lists. Submitted for publication.
 
15
 
16
M. Olson, K. Bostic, and M. Seltzer. Berkeley DB. In Summer Usenix Technical Conf., 1999.
17
 
18
Xmark: The xml benchmark project. http://monetdb.cwi.nl/xml/index.html.
19
20

CITED BY  8

Collaborative Colleagues:
Marcus Fontoura: colleagues
Vanja Josifovski: colleagues
Eugene Shekita: colleagues
Beverly Yang: colleagues