Efficient Processing of Joins on Set-valued Attributes
Summary: Investigates joins on set-valued attributes in object-relational DBMS, focusing on set containment, set equality, and set overlap predicates. Proposes inverted-file based join algorithms and benchmarks them against signature-based methods across these predicates. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 1,048 | Set Containment Joins: The Good, The Bad and The Ugly | 2000 | VLDB | 0.00014457009 |
| 1,128 | An Efficient Indexing Technique for Full-Text Database Systems | 1992 | VLDB | 0.00013794088 |
| 1,562 | Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates | 1997 | VLDB | 0.00011356744 |
| 1,768 | Closest Pair Queries in Spatial Databases | 2000 | SIGMOD | 0.00010622873 |
| 2,890 | Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files | 1993 | VLDB | 7.9575788e-05 |
| 3,016 | Evaluation of Signature Files as Set Access Facilities in OODBs | 1993 | SIGMOD | 7.7052964e-05 |
Previous
Page 1 / 1
Next