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,529 | Integration of Spatial Join Algorithms for Processing Multiple Inputs | 1999 | SIGMOD | 6.1078661e-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,811 | A Cost Model for Similarity Queries in Metric Spaces | 1998 | PODS | 0.00010467197 |
| 3,804 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD | 6.7525564e-05 |
| 5,882 | Improving Adaptable Similarity Query Processing by Using Approximations | 1998 | VLDB | 5.2892937e-05 |
| 3,833 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 6.7173578e-05 |
| 10,706 | Extensible and Robust Evaluation of Similarity Queries | 2025 | VLDB | 4.1945683e-05 |
| 5,738 | Hercules Against Data Series Similarity Search | 2022 | VLDB | 5.3478528e-05 |
| 7,054 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 4.8496866e-05 |
| 6,516 | (Almost) Optimal Parallel Block Access for Range Queries | 2000 | PODS | 5.0321577e-05 |
| 3,555 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD | 6.9772546e-05 |
| 2,246 | Parallel R-trees | 1992 | SIGMOD | 9.2075292e-05 |