Abstract
Inspired by the best querying performance of ViST among the rest of the approaches in the literature, and meanwhile to overcome its shortcomings, in this paper, we present another efficient and novel geometric sequence mechanism, which transforms XML documents and XPath queries into the corresponding geometric data/query sequences. XML querying is thus converted to finding non-contiguous geometric subsequence matches. Our approach ensures correct (i.e., without semantic false) and fast (i.e., without the costly post-processing phase) evaluation of XPath queries, while at the same time guaranteeing the linear space complexity. We demonstrate the significant performance improvement of our approach through a set of experiments on both synthetic and real-life data.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Busse, R., Carey, M., Florescu, D., Kersten, M., Manolescu, I., Schmidt, A., Florian Waas, F.: Xmark an xml benchmark project (2001), http://monetdb.cwi.nl/xml/index.html
Chien, S.Y., Tsotras, V.J., Zaniolo, C., Zhang, D.: Efficient complex query support for multiversion XML documents. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 161–178. Springer, Heidelberg (2002)
Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A fast index for semistructured data. In: The VLDB Conference, pp. 341–350 (2001)
Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB, pp. 436–445. Springer, Heidelberg (1997)
Gottlob, G., Koch, C., Pichler, R.: The complexity of xpath query evaluation. In: PODS, pp. 179–190. ACM, New York (2003)
Grust, T.: Accelerating xpath location steps. In: SIGMOD, pp. 109–120. ACM Press, New York (2002)
Jiang, H., Lu, H., Wang, W.: Xr-tree: Indexing xml data for efficient structural joins. In: 19th International Conference on Data Engineering, pp. 253–264 (2003)
Ley, M.: Dblp bibliography (2004), http://www.informatik.uni-trier.de/~ley/db
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. The VLDB Journal, 361–370 (2001)
Milo, T., Suciu, D.: Index structures for path expressions. In: Proceedings of the 8th International Conference on Database Theory, pp. 277–295 (1999)
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal xml pattern matching. In: ACM SIGMOD (2002)
Shen, Y., Feng, L., Shen, T., Wang, B.: A self-adaptive scope allocation scheme for labeling dynamic xml documents. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 811–821. Springer, Heidelberg (2004)
Wang, H.: On the sequencing of tree structures for xml indexing (technical report) (2004), http://magna.cs.ucla.edu/~hxwang/publications/xmlrpt.pdf
Wang, H., Park, S., Fan, W., Yu, P.S.: Vist: a dynamic index method for querying xml data by tree structures. In: SIGMOD, pp. 110–121. ACM Press, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Feng, L., Shen, Y. (2005). Efficient XPath Evaluation. In: Eder, J., Haav, HM., Kalja, A., Penjam, J. (eds) Advances in Databases and Information Systems. ADBIS 2005. Lecture Notes in Computer Science, vol 3631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547686_17
Download citation
DOI: https://doi.org/10.1007/11547686_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28585-4
Online ISBN: 978-3-540-31895-8
eBook Packages: Computer ScienceComputer Science (R0)