Abstract
We study the problem of finding relevant relationships among user defined nodes of XML documents. We define a language that determines the nodes as results of XPath expressions. The expressions are structured in a conjunctive normal form and the relationships among nodes qualifying in different conjuncts are determined as tree twigs of the searched XML documents. The query execution is supported by an auxiliary index structure called the tree signature. We have implemented a prototype system that supports this kind of searching and we have conducted numerous experiments on XML data collections. We have found the query execution very efficient, thus suitable for on-line processing. We also demonstrate the superiority of our system with respect to a previous, rather restricted, approach of finding the lowest common ancestor of pairs of XML nodes.
This work was partially supported by the ECD project (Extended Content Delivery), funded by the Italian government, by the VICE project (Virtual Communities for Education), also funded by the Italian government, and by DELOS NoE, funded by the European Commission under FP6 (Sixth Framework Programme).
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
Amato, G., Debole, F., Rabitti, F., Zezula, P.: YAPI: Yet another path index for XML searching. In: Koch, T., Sølvberg, I.T. (eds.) ECDL 2003. LNCS, vol. 2769, pp. 176–187. Springer, Heidelberg (2003)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison,Wisconsin, USA, pp. 310–321 (June 2002)
Chien, S., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: Proceedings of the 28th VLDB Conference, pp. 263–274. Morgan Kaufmann, San Francisco (September 2002)
Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: XSEarch:A Semantic Search Engine for XML. In: Proceedings of the 29th VLDB Conference, Berlin, Germany, pp. 45–56. Morgan Kaufmann, San Francisco (September 2003)
Chen, Z., Jagadish, H.V., Lakshmanan, V.S., Paparizos, S.: From Tree patterns to Generalized Tree Patterns: On Efficient Evaluation of XWQuery. In: Proceedings of the 29th VLDB Conference, Berlin, Germany, pp. 237–248 (September 2003)
Dietz, P.F.: Maintaining Order in a Linked List. In: Proceedings of STOC, 14th Annual ACM Symposium on Theory of Computing, pp. 122–127, San Francisco, CA (May 1982)
Ley, M.: DBLP Bibliography, http://dblp.uni-trier.de/xml/
Goldman, R., Shivakumar, N.: Proximity Search in Databases. In: Proceedings VLDB Conference, NewYork, USA, pp. 26–37 (1998)
Grust, T.: Accelerating XPath location steps. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison,Wisconsin, pp. 109–120 (2002)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proceedings of 27th International Conference on Very Large Data Bases, VLDB 2001, Roma, Italy, September 11-14, pp. 361–370. Morgan Kaufmann, San Francisco (2001)
Schmidt, A., Kersten, M., Windhouwer, M.: Querying XML Documents Made Easy: Nearest Concept Queries. In: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, April 02 - 06, pp. 21–329. IEEE, Los Alamitos (2001)
Srivastava, D., Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the 18th International Conference on Data Engeneering, ICDE 2002, San Jose, California, pp. 161–171 (March 2002)
Zezula, P., Amato, G., Debole, F., Rabitti, F.: Tree signatures for XML querying and navigation. In: Bellahsène, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol. 2824, pp. 149–163. Springer, Heidelberg (2003)
Zezula, P., Amato, G., Rabitti, F.: Processing XML queries with tree signatures. In: Blanken, H.M., Grabs, T., Schek, H.-J., Schenkel, R., Weikum, G. (eds.) Intelligent Search on XML Data. LNCS, vol. 2818, pp. 247–258. Springer, Heidelberg (2003)
Zezula, P., Mandreoli, F., Martoglia, R.: Tree signatures and unordered XML pattern matching. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 122–139. Springer, Heidelberg (2003)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: ACM SIGMOD Conference 2001, Santa Barbara, CA, USA, ACM-Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amato, G., Debole, F., Rabitti, F., Savino, P., Zezula, P. (2004). A Signature-Based Approach for Efficient Relationship Search on XML Data Collections. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds) Database and XML Technologies. XSym 2004. Lecture Notes in Computer Science, vol 3186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30081-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30081-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22969-8
Online ISBN: 978-3-540-30081-6
eBook Packages: Springer Book Archive