Abstract
One of the problems associated with XML databases is the poor performance of XPath queries. Although this has attracted much attention by the research community, solutions are either partial (not providing full XPath functionality) or unable to manage database updates. In this work, we exploit features of Oracle 10g in order to rapidly build indexes that improve the processing times of XML databases. Significantly, we can also support XML database updates as the rebuild time for entire indexes is reasonably fast and thus, provides for flexible update strategies. This paper discusses the process for building the index repository and describes a series of experiments that demonstrate our improved query response times.
Funded By Enterprise Ireland Grant PC/2005/0049.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barta, A., Consens, M., Mendelzon, A.: Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods. In: Proceedings of the 31st VLDB Conference, pp. 133–144. Morgan Kaufmann, San Francisco (2005)
Berglund, A., et al.: XML Path Language (XPath 2.0), Technical Report W3C Working Draft, WWW Consortium (2005), http://www.w3.org/TR/xpath20/
Beyer, K., et al.: System RX: One Part Relational, One Part XML. In: Proceedings of ACM SIGMOD Conference on Management of data, pp. 347–358. ACM Press, New York (2005)
Grust, T.: Accelerating XPath Location Steps. In: Proceedings of the 2002 ACM SIGMOND International Conference on the Management of Data. SIGMOND Record, vol. 31, pp. 109–120. ACM Press, New York (2002)
Grust, T., Sakr, S., Teuber, J.: XQuery on SQL Hosts. In: Proceedings of the 30th International Conference on Very Large Databases (VLDB), pp. 252–263. Morgan Kaufmann, San Francisco (2004)
Meier, W.: eXist: An Open Source Native XML Database. In: Chaudhri, A.B., Jeckle, M., Rahm, E., Unland, R. (eds.) NODe-WS 2002. LNCS, vol. 2593, pp. 169–183. Springer, Heidelberg (2003)
Manolescu, I., Florescu, D., Kossmann, D.: Answering XML Queries on Heterogeneous Data Sources. In: Proceedings of the 27th International Conference on Very Large Databases (VLDB), pp. 241–250. Morgan Kaufmann, San Francisco (2001)
Noonan, C.: XPath Query Routing in the FAST Project. Technical Report ISG-06-01 (2006), http://www.computing.dcu.ie/~isg
O’Connor, M.F., Bellahsène, Z., Roantree, M.: An Extended Preorder Index for Optimising XPath Expressions. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 114–128. Springer, Heidelberg (2005)
Roantree, M.: The FAST Prototype: a Flexible indexing Algorithm using Semantic Tags. Technical Report ISG-06-02 (2006), http://www.computing.dcu.ie/~isg
Vyas, A., Fernández, M., Simèon, J.: The Simplest XML Storage Manager Ever. In: Proceedings of the First International Workshop on XQuery Implementation, Experience and Perspectives <XIME-P/>, in cooperation with ACM SIGMOD, pp. 27–42 (2004)
The XML Data Repository (2002), http://www.cs.washington.edu/research/xmldatasets/
Zhang, C., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: Proceedings of the 2001 ACM SIGMOD International Conference on the Management of Data, pp. 425–436. ACM Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noonan, C., Durrigan, C., Roantree, M. (2006). Using an Oracle Repository to Accelerate XPath Queries. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_8
Download citation
DOI: https://doi.org/10.1007/11827405_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)