Algorithms for Querying by Spatial Structure
Summary: Treats structural queries as n-ary spatial joins, retrieving object configurations satisfying partial or total spatial constraints. A multiresolution framework derives similarity measures and combines constraint satisfaction with R-tree indexing in three optimized algorithms. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dimitris Papadias (Hong Kong University of Science and Technology)
- 2. Nikos Mamoulis (Hong Kong University of Science and Technology)
- 3. Vasilis Delis (Computer Technology Institute; University of Patras)
BibTeX Citation
@article{papadias_vldb98,
title = {{Algorithms for Querying by Spatial Structure}},
author = {Papadias, Dimitris and Mamoulis, Nikos and Delis, Vasilis},
journal = {PVLDB},
series = {{VLDB} '98},
pages = {546--557},
year = {1998}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,744 | Processing and Optimization of Multiway Spatial Joins Using R-trees | 1999 | PODS | 5.5541724e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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 |
| 96 | Spatial Query Processing in an Object-Oriented Database System | 1986 | SIGMOD | 0.00034590762 |
| 145 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00029548428 |
| 522 | Multi-Step Processing of Spatial Joins | 1994 | SIGMOD | 0.00017133516 |
| 2,548 | Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations | 1997 | VLDB | 8.432498e-05 |
| 3,290 | Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees | 1995 | SIGMOD | 7.5531472e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,685 | Closest Pair Queries in Spatial Databases | 2000 | SIGMOD |
| 2 | 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD |
| 3 | 8,391 | Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation | 2001 | VLDB |
| 4 | 7,744 | Processing and Optimization of Multiway Spatial Joins Using R-trees | 1999 | PODS |
| 5 | 8,442 | Efficient Geometry-based Similarity Search of 3D Spatial Databases | 1999 | SIGMOD |
| 6 | 145 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD |
| 7 | 5,838 | Improving Adaptable Similarity Query Processing by Using Approximations | 1998 | VLDB |
| 8 | 1,384 | Content-Based Image Indexing | 1994 | VLDB |
| 9 | 277 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD |
| 10 | 116 | Direct Spatial Search on Pictorial Databases Using Packed R-trees | 1985 | SIGMOD |