Abstract
Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. If we considered a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries.
This is a preview of subscription content, log in via an institution to check access.
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
Ciaccia P, Pattela M., Zezula P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proc. 23rd Athens Intern. Conf. on VLDB (1997), 426–435.
Bayer R.: The Universal B-Tree for multidimensional indexing: General Concepts. In: Proc. Of World-Wide Computing and its Applications 97 (WWCA 97). Tsukuba, Japan, 1997.
Böhm C., Berchtold S., Keim D.A.: Searching in High-dimensional Spaces-Index Structures for Improving the Performance of Multimedia Databases. ACM, 2002
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Sigmod’90, Atlantic City, NY, 1990, pp. 322–331.
Brechtold, S., Keim, A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: Proc. of 22nd Intern. Conference on VLDB’96, Bombay, India, 1996, pp. 28–39.
Bourret, R.: XML and Databases. http://www.rpbourret.com/xml/XMLAndDatabases.htm. 2001.
Bozkaya, T., Özsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: Sigmod’ 97, Tuscon, AZ, 1997, pp. 357–368.
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison Wesley, New York, 1999.
Krátký M., Pokorný, J., Snášel V.: Indexing XML data with UB-trees. ADBIS 2002, Bratislava, Slovakia, accepted.
Lee, D.L., Kim, Y.M., Patel, G.: Efficient Signature File Methods for Text Retrieval., Knowledge and Data Engineering, Vol. 7, No. 3, 1995, pp. 423–435.
Markl, V.: Mistral: Processing Relational Queries using a Multidimensional Access Technique, http://mistral.in.tum.de/results/publications/Mar99.pdf, 1999
The DocBook open standard, Organization for the Advancement of Structured Information Standards (OASIS), 2002, http://www.oasis-open.org/committees/docbook
M. Patella: Similarity Search in Multimedia Databases. Dipartmento di Elettronica Informatica e Sistemistica, Bologna 1999 http://www-db.deis.unibo.it/~patella/MMindex.html
Pokorný, J.: XML: a challenge for databases?, Chap. 13 In: Contemporary Trends in Systems Development (Eds.: Maung K. Sein), Kluwer Academic Publishers, Boston, 2001, pp. 147–164.
XQuery 1.0: An XML Query Language. W3C Working Draft 20 December 2001, http://www.w3.org/TR/2001/WD-xquery-20011220/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krátký, M., Pokorný, J., Skopal, T., Snášel, V. (2002). The Geometric Framework for Exact and Similarity Querying XML Data. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive