Similarity Query Processing Using Disk Arrays
Summary: Disk-array-aware similarity querying using a distributed R*-tree variant across disk components to balance parallelism and latency. Event-driven simulation shows gains over branch-and-bound and greedy parallelism, nearing an optimal disk-access bound (about 2× slower). (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 |
|---|---|---|---|---|
| 4,539 | Integration of Spatial Join Algorithms for Processing Multiple Inputs | 1999 | SIGMOD | 6.0982886e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,808 | A Cost Model for Similarity Queries in Metric Spaces | 1998 | PODS | 0.00010476269 |
| 3,806 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD | 6.7461245e-05 |
| 3,831 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 6.7146681e-05 |
| 5,889 | Improving Adaptable Similarity Query Processing by Using Approximations | 1998 | VLDB | 5.2842168e-05 |
| 10,714 | Extensible and Robust Evaluation of Similarity Queries | 2025 | VLDB | 4.1905499e-05 |
| 5,747 | Hercules Against Data Series Similarity Search | 2022 | VLDB | 5.3427166e-05 |
| 7,046 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 4.8471584e-05 |
| 6,512 | (Almost) Optimal Parallel Block Access for Range Queries | 2000 | PODS | 5.0273291e-05 |
| 3,549 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD | 6.9792126e-05 |
| 2,245 | Parallel R-trees | 1992 | SIGMOD | 9.2048202e-05 |