Approximate Subtree Identification in Heterogeneous XML Documents Collections

  • Ismael Sanz
  • Marco Mesiti
  • Giovanna Guerrini
  • Rafael Berlanga Llavori
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3671)


Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents in a collection that are similar to a given pattern. In this paper we discuss different similarity measures between a pattern and subtrees of documents in the collection. An efficient algorithm for the identification of document subtrees, approximately conforming to the pattern, by indexing structures is then introduced.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Grust, T.: Accelerating XPath Location Steps. In: ACM SIGMOD International Conference on Management of Data, pp. 109–120 (2002)Google Scholar
  2. 2.
    Wagner, R.A., Fischer, M.J.: The String-to-string Correction Problem. Journal of the ACM 21, 168–173 (1974)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Nierman, A., Jagadish, H.V.: Evaluating Structural Similarity in XML Documents. In: 5th International Workshop on the Web and Databases, pp. 61–66 (2002)Google Scholar
  4. 4.
    Buneman, P., Davidson, S.B., Fernandez, M.F., Suciu, D.: Adding Structure to Unstructured Data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 336–350. Springer, Heidelberg (1996)Google Scholar
  5. 5.
    Kilpeläinen, P.: Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, Dept. of Computer Science, University of Helsinki (1992)Google Scholar
  6. 6.
    Kanza, Y., Sagiv, Y.: Flexible Queries Over Semistructured Data. In: 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2001)Google Scholar
  7. 7.
    Schlieder, T., Naumann, F.: Approximate Tree Embedding for Querying XML Data. In: ACM SIGIR Workshop On XML and Information Retrieval (2000)Google Scholar
  8. 8.
    Amer-Yahia, S., Cho, S., Srivastava, D.: Tree Pattern Relaxation. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 496–513. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Shasha, D., Wang, J.T.L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees. In: 14th International Conference on Scientific and Statistical Database Management, pp. 89–98 (2002)Google Scholar
  10. 10.
    Luk, R.W., Leong, H., Dillon, T.S., Chan, A.T., Croft, W.B., Allen, J.: A Survey in Indexing and Searching XML Documents. Journal of the American Society for Information Science and Technology 53, 415–438 (2002)CrossRefGoogle Scholar
  11. 11.
    Rahm, E., Bernstein, P.A.: A Survey of Approaches to Automatic Schema Matching. The VLDB Journal 10, 334–350 (2001)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ismael Sanz
    • 1
  • Marco Mesiti
    • 2
  • Giovanna Guerrini
    • 3
  • Rafael Berlanga Llavori
    • 1
  1. 1.Universitat Jaume ICastellónSpain
  2. 2.Università di MilanoItaly
  3. 3.Università di PisaItaly

Personalised recommendations