Database Paper Browser

Back to papers

Merging the Results of Approximate Match Operations

Summary: Adapts footrule distance to merge multiple ranked approximate-match lists across query attributes into a single top-K result. Presents two novel, declarative algorithms for single-attribute approximate matching with SQL specs and validates practicality via real data and a commercial DB. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9171
Venue
VLDB
Year
2004
Pagerank
7.0059524e-05
Overall Rank
3,529 | 75.46%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
702 Reasoning about Record Matching Rules 2009 VLDB 0.00017918203
1,262 RankSQL: Query Algebra and Optimization for Relational Top-k Queries 2005 SIGMOD 0.00012986539
1,533 Example-driven Design of Efficient Record Matching Queries 2007 VLDB 0.00011471971
7,190 Database Support for Matching: Limitations and Opportunities 2006 SIGMOD 4.8051876e-05
7,256 Effective and Efficient Retrieval of Structured Entities 2020 VLDB 4.7869419e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers