ACM Home Page
Please provide us with feedback. Feedback
Relational-style XML query
Full text PdfPdf (340 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data table of contents
Vancouver, Canada
SESSION: Research Session 8: XML Query Processing table of contents
Pages 303-314  
Year of Publication: 2008
ISBN:978-1-60558-102-6
Authors
Taro L. Saito  University of Tokyo, Tokyo, Japan
Shinichi Morishita  University of Tokyo, Tokyo, Japan
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 512,   Citation Count: 0
Additional Information:

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

ABSTRACT

We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as XPath and XQuery, demand explicit path expressions, and thus it is quite difficult for users to produce correct XML queries in the presence of structural variations.

To solve this problem, we introduce a novel query method that automatically discovers various XML structures derived from relational data. A challenge in implementing our method is to reduce the cost of enumerating all possible tree structures that match the query. We show that the notion of functional dependencies has an important role in generating efficient query schedules that avoid irrelevant tree structures.

Our proposed method, the relational-style XML query, has several advantages over traditional XML data management. These include removing the burden of designing strict tree-pattern schemas, enhancing the descriptions of relational data with XML's rich semantics, and taking advantage of schema evolution capability of XML. In addition, the independence of query statements from the underlying XML structure is advantageous for integrating XML data from several sources. We present extensive experimental results that confirm the scalability and tolerance of our query method for various sizes of XML data containing structural variations.


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. V. Jagadish, N. Koudas, and J. M. Patel. Structural joins: A primitive for efficient XML query pattern matching. In ICDE, 2002.
2
 
3
M. Arenas and L. Libkin. A normal form for XML documents. In ACM TODS, 2004.
4
 
5
S. Boag, D. Chamberlin, M. F. Fernandez, D. Floresch, J. Robie, and J. Simeon. XQuery 1.0: An XML query language - W3C working draft, November 2003. http://www.w3.org/TR/xquery.
 
6
T. Bray, J. Paoli, C. M. Sperberg-McQueen, and E. Maler. Extensible markup language (XML) 1.0 (second edition), October 2000. http://www.w3.org/TR/REC-xml.
7
 
8
J. Clark and S. DeRose. XML path language (XPath) version 1.0, November 1999. http://www.w3.org/TR/xpath.
 
9
Extensible HyperText markup language (XHTML) 1.0 (second edition), January 2000. http://www.w3.org/TR/xhtml.
10
 
11
12
 
13
 
14
 
15
 
16
 
17
 
18
RelaxNG. http://relaxng.org.
 
19
T. L. Saito and S. Morishita. Amoeba join: Overcoming structural fluctuations of XML data. In WebDB, 2006.
 
20
SAX: The simple API for XML. http://www.megginson.com/sax/.
 
21
 
22
Sleepycat Software. BerkeleyDB. http://www.sleepycat.com/.
 
23
Z. Vagena, L. S. Colby, F. O¨ zcan, A. Balmin, and Q. Li. On the effectiveness of flexible querying heuristics for XML data. In XSym, 2007.
24
 
25
XML schema. http://www.w3.org/XML/Schema.
26
27
 
28

Collaborative Colleagues:
Taro L. Saito: colleagues
Shinichi Morishita: colleagues