DBScholar

Back to papers

Linear approximation of planar spatial databases using transitive-closure logic

Summary: Linear approximations of planar polynomial-constraint spatial databases are inexpressible in standard FO constraint queries but definable in FO+transitive closure. An extended transitive-closure logic is complete for computable queries on linear spatial DBs, thus capturing all computable planar topological queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1201
Venue
PODS
Year
2000
Pagerank
5.093636e-05
Overall Rank
12,876 | 11.66%
DOI
10.1145/335168.335215

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{geerts_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{Linear approximation of planar spatial databases using transitive-closure logic}},
        url = {https://dl.acm.org/doi/10.1145/335168.335215},
        doi = {10.1145/335168.335215},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Geerts, Floris and Kuijpers, Bart},
        year = {2000}
}

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 6 of 6 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