DBScholar

Back to papers

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)

Paper ID
8709
Venue
VLDB
Year
1998
Pagerank
5.093636e-05
Overall Rank
12,944 | 11.20%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers