ACM Home Page
Please provide us with feedback. Feedback
BLAS: an efficient XPath processing system
Full text PdfPdf (179 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: XML query efficiency table of contents
Pages: 47 - 58  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Yi Chen  University of Pennsylvania
Susan B. Davidson  University of Pennsylvania and INRIA-FUTURS (France)
Yifeng Zheng  University of Pennsylvania
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 56,   Citation Count: 15
Additional Information:

abstract   references   cited by   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/1007568.1007577
What is a DOI?

ABSTRACT

We present BLAS, a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses P-labeling to process queries involving consecutive child axes, and D-labeling to process queries involving descendant axes traversal. The XML data is stored in labeled form, and indexed to optimize descendent axis traversals. Three algorithms are presented for translating complex XPath queries to SQL expressions, and two alternate query engines are provided. Experimental results demonstrate that the BLAS system has a substantial performance improvement compared to traditional XPath processing using D-labeling.


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
 
2
 
3
 
4
 
5
J. Bosak. Shakespeare. http://www.ibiblio.org/xml/examples/shakespeare/.
6
 
7
Y. Chen, S. Davidson, C. Hara, and Y. Zheng. RRXS: Redundancy reducing XML storage in relations. In Proceedings of VLDB, 2003.
 
8
Y. Chen, S. B. Davidson, and Y. Zheng. Constraint Preserving XML Storage in Relations. In WebDB, 2002.
 
9
 
10
S.-Y. Chien, Z. Vagena, D. Zhang, V. J. Tsotras, and C. Zaniolo. Efficient Structural Joins on Indexed XML Documents. In Proceedings of VLDB, 2002.
 
11
J. Clark and S. DeRose. XML Path language (XPath), November 1999. http://www.w3.org/TR/xpath.
 
12
13
 
14
A. Deutsch. An Experimental Evaluation of the MARS System. In Excerpt from PhD Thesis Alin Deutsch, 2002.
15
16
 
17
D. Florescu and D. Kossmann. Storing and querying XML data using an RDBMS. In Bulletin of the Technical Committee on Data Engineering, pages 27--34, September 1999.
 
18
Georgetown Protein Information Resource. Protein Sequence Database, 2001. http://www.cs.washington.edu/research/xmldatasets/.
19
 
20
H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-Tree: Indexing XML Data for Efficient Structural Joins. In Proceedings of ICDE, 2003.
21
 
22
R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proceedings of ICDE, 2002.
 
23
 
24
J. McHugh, J. Widom, S. Abiteboul, Q. Luo, and A. Rajaraman. Indexing semistructured data. Technical report, Stanford University, 1998.
 
25
26
 
27
 
28
J. Simon and M. Fernndez. Galax. http://db.bell-labs.com/galax.
 
29
W. Wang, H. Jiang, H. Lu, and J. X. Yu. PBiTree Coding and Efficient Processing of Containment Joins. In Proceedings of ICDE, 2003.
 
30
XMARK the XML-benchmark project, April 2001. http://monetdb.cwi.nl/xml/index.html.
31

CITED BY  15
Collaborative Colleagues:
Yi Chen: colleagues
Susan B. Davidson: colleagues
Yifeng Zheng: colleagues