ACM Home Page
Please provide us with feedback. Feedback
Virtual cursors for XML joins
Full text PdfPdf (371 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the thirteenth ACM international conference on Information and knowledge management table of contents
Washington, D.C., USA
SESSION: DB-6 (databases): XML query processing table of contents
Pages: 523 - 532  
Year of Publication: 2004
ISBN:1-58113-874-1
Authors
Beverly Yang  Stanford University
Marcus Fontoura  IBM Almaden
Eugene Shekita  IBM Almaden
Sridhar Rajagopalan  IBM Almaden
Kevin Beyer  IBM Almaden
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 41,   Citation Count: 7
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/1031171.1031271
What is a DOI?

ABSTRACT

Structural joins are a fundamental operation in XML query processing and a large body of work has focused on index-based algorithms for executing them. In this paper, we describe how two well-known index features -- path indices and ancestor information -- can be combined in a novel way to replace one or more of the physical index cursors in a structural join with <i>virtual cursors</i>. The position of a virtual cursor is derived from the path and ancestor information of a physical cursor. Implementation results are provided to show that, by eliminating index I/O, virtual cursors can improve the performance of structural joins by an order of magnitude or more.


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
J. Bremer and M. Gertz. On distributing xml repositories. In WebDB, 2003.
3
 
4
S. Chien, Z. Vagena, D. Zhang, V. Tsotras, and C. Zaniolo. Efficient structural joins on indexed xml documents. In VLDB, 2002.
 
5
World Wide Web Consortium. Xquery 1.0: An xml query language, August 2001. http://www.w3.org/TR/xquery/.
 
6
Extended technical report. Available upon request.
 
7
Marcus Fontoura, Jason Zien, Eugene Shekita, Sridhar Rajagopalan, and Andreas Neumann. High performance index build algorithms for intranet search engines. In VLDB, 2004.
 
8
 
9
 
10
11
 
12
H. Jiang, H. Lu, W. Wang, and B. C. Ooi. Xr-tree: Indexing xml data for efficient structural join. In ICDE, 2003.
13
 
14
H. Jiang, W. Wang, H. Lu, and J. Yu. Holistic twig joins on indexed xml documents. In VLDB, 2003.
15
 
16
R. Kaushik, P. Bohannon, J. Naughton, and P. Shanoy. Updates for structure indexes. In VLDB, 2002.
 
17
R. Kaushik, R. Krishnamurthy, J. Naughton, and R. Ramakrishnan. On the integration of structure indexes and inverted lists. Submitted for publication.
 
18
 
19
M. Olson, K. Bostic, and M. Seltzer. Berkeley DB. In Summer Usenix Technical Conf., 1999.
20
21
 
22
Xmark: The xml benchmark project. http://monetdb.cwi.nl/xml/index.html.
23

CITED BY  7

Collaborative Colleagues:
Beverly Yang: colleagues
Marcus Fontoura: colleagues
Eugene Shekita: colleagues
Sridhar Rajagopalan: colleagues
Kevin Beyer: colleagues