DBScholar

Back to papers

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)

Paper ID
3804
Venue
SIGMOD
Year
2006
Pagerank
5.5913983e-05
Overall Rank
7,584 | 47.97%
DOI
10.1145/1142473.1142484

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers