ACM Home Page
Please provide us with feedback. Feedback
APEX: an adaptive path index for XML data
Full text PdfPdf (1.16 MB)
Source International Conference on Management of Data archive
Proceedings of the 2002 ACM SIGMOD international conference on Management of data table of contents
Madison, Wisconsin
SESSION: Research sessions: path indexing table of contents
Pages: 121 - 132  
Year of Publication: 2002
ISBN:1-58113-497-5
Authors
Chin-Wan Chung  KAIST, Taejon, KOREA
Jun-Ki Min  KAIST, Taejon, KOREA
Kyuseok Shim  Seoul National University, Seoul, KOREA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 73,   Citation Count: 54
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/564691.564706
What is a DOI?

ABSTRACT

The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a structural summary and efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. To overcome the inefficiency, several path indexes have been proposed in the research community. Traditional indexes generally record all label paths from the root element in XML data. Such path indexes may result in performance degradation due to large sizes and exhaustive navigations for partial matching path queries start with the self-or-descendent axis("//").In this paper, we propose APEX, an adaptive path index for XML data. APEX does not keep all paths starting from the root and utilizes frequently used paths to improve the query performance. APEX also has a nice property that it can be updated incrementally according to the changes of query workloads. Experimental results with synthetic and real-life data sets clearly confirm that APEX improves query processing cost typically 2 to 54 times better than the existing indexes, with the performance gap increasing with the irregularity of XML data.


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
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The lorel query languages for semistructured data. International Journal on Digital Libraries, 1(1):68-88, 1997.
 
3
 
4
S. Boag, D. Chamberlin, M. Fernandez, D. Florescu, J. Robie, J. Simeon, and M. Stefanescu. XQuery 1.0: An XML query language. Working Draft, http://www.w3.org/TR/2001/WD-xquery-20011220, 20 December 2001.
 
5
6
 
7
J. Clark and S. DeRose. XML path language(XPath) version 1.0. W3C Recommendation, http://www.w3.org/TR/xpath, November 1999.
 
8
 
9
R. Cover. The XML cover pages. http://www.oasis-open.org/cover/xml.html, 2001.
10
 
11
 
12
 
13
 
14
 
15
 
16
 
17
J. McHugh and J. Widom. Compile-time path expansion in lore. In Proceedings of the Workshop on Query Processing for Semistructured Data and Non-Standard Data Formats, 1999.
 
18
 
19
20
 
21
22

CITED BY  54

Collaborative Colleagues:
Chin-Wan Chung: colleagues
Jun-Ki Min: colleagues
Kyuseok Shim: colleagues