Database Support for Matching: Limitations and Opportunities
Summary: Match join: a subset of theta-join with each tuple used at most once. Shows naive compute-then-match is impractical; DBMS primitives (grouping, sorting, join) enable efficient match joins, enabling RDBMSs to support broader matching. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ameet Kini (University of Wisconsin)
- 2. Srinath Shankar (University of Wisconsin)
- 3. Jeffrey F. Naughton (University of Wisconsin)
- 4. David J. Dewitt (University of Wisconsin)
BibTeX Citation
@inproceedings{kini_sigmod06,
title = {{Database Support for Matching: Limitations and Opportunities}},
author = {Kini, Ameet and Shankar, Srinath and Naughton, Jeffrey F. and Dewitt, David J.},
series = {{SIGMOD} '06},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1142473.1142484},
url = {https://dl.acm.org/doi/10.1145/1142473.1142484},
year = {2006}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,921 | Clustera: An Integrated Computation And Data Management System | 2008 | VLDB | 7.9626308e-05 |
| 3,994 | Generating Databases for Query Workloads | 2010 | VLDB | 6.9686731e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 333 | The Onion Technique: Indexing for Linear Optimization Queries | 2000 | SIGMOD | 0.0002089582 |
| 509 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00017220967 |
| 635 | Evaluating Top-k Selection Queries | 1999 | VLDB | 0.00015527042 |
| 1,134 | A Framework for Expressing and Combining Preferences | 2000 | SIGMOD | 0.00012035449 |
| 3,610 | Merging the Results of Approximate Match Operations | 2004 | VLDB | 7.2593873e-05 |
| 5,164 | Efficient Approximation of Optimization Queries Under Parametric Aggregation Constraints | 2003 | VLDB | 6.3372067e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,592 | Efficient Processing of Joins on Set-valued Attributes | 2003 | SIGMOD |
| 2 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 3 | 776 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 4 | 9,693 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB |
| 5 | 1,740 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 6 | 5,364 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD |
| 7 | 2,035 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 8 | 859 | An Efficient SQL-based RDF Querying Scheme | 2005 | VLDB |
| 9 | 1,479 | Computing Joins Of Relations | 1975 | SIGMOD |
| 10 | 1,560 | Example-driven Design of Efficient Record Matching Queries | 2007 | VLDB |