Advertisement

A Signature-Based Approach for Efficient Relationship Search on XML Data Collections

  • Giuseppe Amato
  • Franca Debole
  • Fausto Rabitti
  • Pasquale Savino
  • Pavel Zezula
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3186)

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.

Keywords

Conjunctive Normal Form Query Evaluation Query Execution Query Pattern XPath Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ADR+03]
    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)CrossRefGoogle Scholar
  2. [BKS02]
    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)Google Scholar
  3. [CVZ+02]
    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)Google Scholar
  4. [CMK+03]
    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)CrossRefGoogle Scholar
  5. [CJL+03]
    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)Google Scholar
  6. [Die82]
    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)Google Scholar
  7. [DBLP]
    Ley, M.: DBLP Bibliography, http://dblp.uni-trier.de/xml/
  8. [GS98]
    Goldman, R., Shivakumar, N.: Proximity Search in Databases. In: Proceedings VLDB Conference, NewYork, USA, pp. 26–37 (1998)Google Scholar
  9. [Gr02]
    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)Google Scholar
  10. [LM01]
    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)Google Scholar
  11. [SKW01]
    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)Google Scholar
  12. [SAJ+02]
    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)Google Scholar
  13. [ZAD03]
    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)CrossRefGoogle Scholar
  14. [ZAR03]
    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)CrossRefGoogle Scholar
  15. [ZMM04]
    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)CrossRefGoogle Scholar
  16. [ZND+01]
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Giuseppe Amato
    • 1
  • Franca Debole
    • 1
  • Fausto Rabitti
    • 1
  • Pasquale Savino
    • 1
  • Pavel Zezula
    • 2
  1. 1.ISTI-CNRPisaItaly
  2. 2.Masaryk UniversityBrnoCzech Republic

Personalised recommendations