Index-based approximate XML joins

Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or mistakes present in the data sets. In this paper we study the problem of integrating XML data sources through index assisted join operations, using notions of approximate match in the structure and content of XML documents as the join predicate. We show how a well known and widely deployed index structure, namely the R-tree, can be adopted to improve the performance of such operations. We propose novel search and join algorithms for R-trees adopted to index XML document collections. We also propose novel optimization objectives for R-tree construction, making R-trees better suited for this application.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
EditorsU. Dayal, K. Ramamritham, T.M. Vijayaraman
Pages708-710
Number of pages3
DOIs
Publication statusPublished - 1 Dec 2003
Externally publishedYes
EventNineteenth International Conference on Data Ingineering - Bangalore, India
Duration: 5 Mar 20038 Mar 2003

Other

OtherNineteenth International Conference on Data Ingineering
CountryIndia
CityBangalore
Period5/3/038/3/03

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Guha, S., Koudas, N., Srivastava, D., & Yu, T. (2003). Index-based approximate XML joins. In U. Dayal, K. Ramamritham, & T. M. Vijayaraman (Eds.), Proceedings - International Conference on Data Engineering (pp. 708-710) https://doi.org/10.1109/ICDE.2003.1260843