Database Paper Browser

Back to papers

Algorithms for Querying by Spatial Structure

Summary: Proposes a multi-resolution framework for structural queries—configurations of spatial constraints over n variables—and three CSP-enhanced algorithms that integrate constraint satisfaction with R-tree indexing, plus automatic similarity measures. Relates structural queries to relative-location image retrieval, notes worst-case search exponentiality (N!/(N−n)!), O(N^n) for inexact matching, and provides optimization techniques with real-data experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8518
Venue
VLDB
Year
1998
Pagerank
4.1945683e-05
Overall Rank
12,751 | 11.30%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,729 Processing and Optimization of Multiway Spatial Joins Using R-trees 1999 PODS 4.6660821e-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