DBScholar

Back to papers

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)

Paper ID
3078
Venue
SIGMOD
Year
1998
Pagerank
5.2740525e-05
Overall Rank
9,417 | 35.40%
DOI
10.1145/276304.276325

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{papadopoulos_sigmod98,
        title = {{Similarity Query Processing Using Disk Arrays}},
        author = {Papadopoulos, Apostolos N. and Manolopoulos, Yannis},
        series = {{SIGMOD} '98},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/276304.276325},
        url = {https://dl.acm.org/doi/10.1145/276304.276325},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,815 Integration of Spatial Join Algorithms for Processing Multiple Inputs 1999 SIGMOD 6.4949956e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 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.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
28 Nearest Neighbor Queries 1995 SIGMOD 0.00052102434
41 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00046675394
85 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00035405879
133 A Case for Redundant Arrays of Inexpensive Disks (RAID) 1988 SIGMOD 0.00030370315
277 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022537944
329 Hilbert R-tree: An Improved R-tree Using Fractals 1994 VLDB 0.00021068647
650 The Sequoia 2000 Storage Benchmark 1993 SIGMOD 0.00015319951
1,129 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00012061727
1,137 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS 0.00012027131
1,370 Towards an Analysis of Range Query Performance in Spatial Data Structures 1993 PODS 0.00010997795
1,373 A Model for the Prediction of R-tree Performance 1996 PODS 0.0001098638
2,341 Parallel R-trees 1992 SIGMOD 8.7233426e-05
2,774 Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension 1995 VLDB 8.1372328e-05
3,866 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 7.061829e-05
5,120 Multi-Disk B-trees 1991 SIGMOD 6.3577476e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,101 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS
2 4,075 Distributing a Search Tree Among a Growing Number of Processors 1994 SIGMOD
3 5,838 Improving Adaptable Similarity Query Processing by Using Approximations 1998 VLDB
4 2,462 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS
5 10,951 Extensible and Robust Evaluation of Similarity Queries 2025 VLDB
6 5,231 Hercules Against Data Series Similarity Search 2022 VLDB
7 7,151 Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability 2018 VLDB
8 6,619 (Almost) Optimal Parallel Block Access for Range Queries 2000 PODS
9 3,866 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD
10 2,341 Parallel R-trees 1992 SIGMOD