XANDY: Detecting changes on large unordered XML documents using relational databases

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Previous works in change detection on XML documents are not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML documents in the memory. In this paper, we take a more conservative yet novel approach of using traditional relational database engines for detecting the changes to large unordered XML documents. We elaborate how we detect the changes on unordered XML documents by using relational database. To this end, we have implemented a prototype system called XANDY that converts XML documents into relational tuples and detects the changes from these tuples by using SQL queries. Our experimental results show that the relational approach has better scalability compared to published algorithms like X-Diff. The result quality of our approach is comparable to the one of X-Diff. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Leonardi, E., Bhowmick, S. S., & Madria, S. (2005). XANDY: Detecting changes on large unordered XML documents using relational databases. In Lecture Notes in Computer Science (Vol. 3453, pp. 711–723). Springer Verlag. https://doi.org/10.1007/11408079_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free