Approximate XML Joins

Summary: Proposes approximate XML joins to integrate heterogeneous sources via structural and content distance. Introduces cheap tree edit bounds, a join framework using multiple distance metrics, and reference sets with sampling-based discovery. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h0ef8d234240b6e97
Venue: SIGMOD
Year: 2002
Pagerank: 8.0313227e-05
Overall Rank: 2,757 | 81.53%
DOI: 10.1145/564691.564725

Incoming Non-self Citations Over Time

Authors

1. Sudipto Guha (University of Pennsylvania)
2. H. V. Jagadish (University of Michigan)
3. Nick Koudas (AT&T)
4. Divesh Srivastava (AT&T)
5. Ting Yu (University of Illinois Urbana-Champaign)

BibTeX Citation

@inproceedings{guha_sigmod02,
        title = {{Approximate XML Joins}},
        author = {Guha, Sudipto and Jagadish, H. V. and Koudas, Nick and Srivastava, Divesh and Yu, Ting},
        series = {{SIGMOD} '02},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/564691.564725},
        url = {https://dl.acm.org/doi/10.1145/564691.564725},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,558	DogmatiX Tracks down Duplicates in XML	2005	SIGMOD	8.2766441e-05
3,118	Similarity Evaluation on Tree-structured Data	2005	SIGMOD	7.6114853e-05
3,250	RTED: A Robust Algorithm for the Tree Edit Distance	2012	VLDB	7.4754914e-05
3,730	Keyword Search over Relational Databases: A Metadata Approach	2011	SIGMOD	7.0448398e-05
4,679	Approximate Matching of Hierarchical Data Using pq-Grams	2005	VLDB	6.4567077e-05
5,488	On Repairing Structural Problems In Semi-structured Data	2013	VLDB	6.0973234e-05
7,640	SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins	2023	VLDB	5.4624931e-05
7,717	An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data	2006	VLDB	5.4545945e-05
11,400	Extensible and Robust Evaluation of Similarity Queries	2025	VLDB	4.9605343e-05
11,615	X-TED: Massive Parallelization of Tree Edit Distance	2024	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
32	BIRCH: An Efficient Data Clustering Method for Very Large Databases	1996	SIGMOD	0.00049559562
56	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.0004024707
108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB	0.00032945275
364	CURE: An Efficient Clustering Algorithm for Large Databases	1998	SIGMOD	0.00019916561
910	Meaningful Change Detection in Structured Data	1997	SIGMOD	0.00013108662
1,535	Change Detection in Hierarchically Structured Information	1996	SIGMOD	0.00010299485
2,037	Change-Centric Management of Versions in an XML Warehouse	2001	VLDB	9.135023e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,758	Information Preserving XML Schema Embedding	2005	VLDB
2	9,798	Approximate Joins: Concepts and Techniques	2005	VLDB
3	2,756	Holistic Twig Joins on Indexed XML Documents	2003	VLDB
4	9,943	Fast Optimal Twig Joins	2010	VLDB
5	3,118	Similarity Evaluation on Tree-structured Data	2005	SIGMOD
6	12,256	Worst Case Optimal Joins on Relational and XML data	2018	SIGMOD
7	3,263	Approximate XML Query Answers	2004	SIGMOD
8	1,555	Efficient Structural Joins on Indexed XML Documents	2002	VLDB
9	6,160	Scaling Similarity Joins over Tree-Structured Data	2015	VLDB
10	5,481	Correlating XML Data Streams Using Tree-Edit Distance Embeddings	2003	PODS