Merging the Results of Approximate Match Operations

Summary: Introduces a score-aware adaptation of footrule distance for merging per-attribute approximate-match rankings into a unified top-K tuple ranking. Provides two efficient declarative SQL algorithms, validated on real data and a commercial DBMS. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h98d06033d83e68ea
Venue: VLDB
Year: 2004
Pagerank: 7.183446e-05
Overall Rank: 3,593 | 75.85%
DOI: 10.1016/B978-012088469-8.50057-7

Incoming Non-self Citations Over Time

Authors

1. Sudipto Guha (University of Pennsylvania)
2. Nick Koudas (AT&T)
3. Amit Marathe (AT&T)
4. Divesh Srivastava (AT&T)

BibTeX Citation

@article{guha_vldb04,
        title = {{Merging the Results of Approximate Match Operations}},
        author = {Guha, Sudipto and Koudas, Nick and Marathe, Amit and Srivastava, Divesh},
        journal = {PVLDB},
        series = {{VLDB} '04},
        pages = {636},
        doi = {10.1016/B978-012088469-8.50057-7},
        url = {https://doi.org/10.1016/B978-012088469-8.50057-7},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
618	Reasoning about Record Matching Rules	2009	VLDB	0.00015536912
961	RankSQL: Query Algebra and Optimization for Relational Top-k Queries	2005	SIGMOD	0.0001282305
1,581	Example-driven Design of Efficient Record Matching Queries	2007	VLDB	0.00010180038
7,147	Effective and Efficient Retrieval of Structured Entities	2020	VLDB	5.599306e-05
7,727	Database Support for Matching: Limitations and Opportunities	2006	SIGMOD	5.4659695e-05
10,813	X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs	2026	VLDB	4.9793485e-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
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010679641
60	The Merge/Purge Problem for Large Databases	1995	SIGMOD	0.000394583
108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB	0.0003305531
161	Robust and Efficient Fuzzy Match for Online Data Cleaning	2003	SIGMOD	0.00027718195
162	Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity	1998	SIGMOD	0.00027536748
674	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD	0.00014886692
735	Automatic segmentation of text into structured records	2001	SIGMOD	0.00014373044

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,087	Flexible String Matching Against Large Databases in Practice	2004	VLDB
2	11,492	Improved Approximation Algorithms for Relational Clustering	2024	PODS
3	643	Evaluating Top-k Selection Queries	1999	VLDB
4	12,599	Optimal Top-k Generation of Attribute Combinations based on Ranked Lists	2012	SIGMOD
5	8,245	Indexing Mixed Types for Approximate Retrieval	2005	VLDB
6	9,761	Approximate Joins: Concepts and Techniques	2005	VLDB
7	262	Record Linkage: Similarity Measures and Algorithms	2006	SIGMOD
8	108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB
9	161	Robust and Efficient Fuzzy Match for Online Data Cleaning	2003	SIGMOD
10	1,581	Example-driven Design of Efficient Record Matching Queries	2007	VLDB