Abstract.
In the constraint database community FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that these languages are a clean and natural generalization of Codd's relational model to a spatial setting. As a result rigorous mathematical study of their expressiveness and complexity can be carried out.
Along this line important geometric queries involving connectivity have been shown to be inexpressible in FO+poly and FO+linear. To address this problem we extend both languages with a parameterized path-connectivity predicate Pconn. We show that FO+linear+Pconn and FO+poly+Pconn[3D] are closed and have PTIME data complexity. We also examine the expressiveness of FO+poly+Pconn and FO+linear+Pconn and show that parity and transitive closure are expressible in each.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 8 January 2001 / 22 February 2002
Rights and permissions
About this article
Cite this article
Giannella, C., Van Gucht, D. Adding a path connectedness operator to FO+poly (linear). Acta Informatica 38, 621–648 (2002). https://doi.org/10.1007/s00236-002-0088-1
Issue Date:
DOI: https://doi.org/10.1007/s00236-002-0088-1