Database Paper Browser

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
3742
Venue
SIGMOD
Year
2006
Pagerank
4.8051876e-05
Overall Rank
7,190 | 49.99%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,208 Clustera: An Integrated Computation And Data Management System 2008 VLDB 9.2873257e-05
4,517 Generating Databases for Query Workloads 2010 VLDB 6.1178732e-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