A Reliable Parallel Backend Using Multi-Attribute Clustering and Select-Join Operator
Summary: Multi-attribute clustering defines multiply partitioned relations; SABRE-based access uses digital hashing and a linearly growing directory. Parallel joins scale 3-5x on hardware, with memory comparable to hashing, non-saturating disk I/O, and fault-tolerant, scalable replication. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,250 | Fractals for Secondary Key Retrieval | 1989 | PODS | 0.00013037936 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9 | Implementation Techniques For Main Memory Database Systems | 1984 | SIGMOD | 0.001426258 |
| 10 | Benchmarking Database Systems: A Systematic Approach | 1983 | VLDB | 0.0012093675 |
| 77 | Multiprocessor Hash-Based Join Algorithms | 1985 | VLDB | 0.00056488357 |
| 3,908 | Dynamic And Order Preserving Data Partitioning For Database Machines | 1985 | VLDB | 6.6380291e-05 |
| 4,957 | A Multikey Hashing Scheme Using Predicate Trees | 1984 | SIGMOD | 5.8036922e-05 |
Previous
Page 1 / 1
Next