Database Paper Browser

Back to papers

Reachability and Connectivity Queries in Constraint Databases

Summary: Augments standard constraint-query languages (FO+Lin, FO+Poly) with topological predicates to obtain closed languages that can express connectivity and reachability. Introduces Path Logic: closed, PTIME data complexity for linear/polynomial constraints, expresses rich path properties via discrete abstractions of continuous paths. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1200
Venue
PODS
Year
2000
Pagerank
4.1945683e-05
Overall Rank
12,681 | 11.79%
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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,741 Relational Expressive Power of Constraint Query Languages 1996 PODS 0.00010714223
2,357 Topological Queries in Spatial Databases 1996 PODS 8.9617862e-05
3,890 Querying Spatial Databases via Topological Invariants 1998 PODS 6.6604161e-05
Previous Page 1 / 1 Next

Semantically Similar Papers