Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases

DOI10.1137/S0097539702410065MaRDI QIDQ5470739zbMATH OpenOpenAlexFDO

Authors Floris Geerts, Bart Kuijpers, Jan Van den Bussche

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539702410065

zbMATH Keywords

real algebraic geometryquery languagesconstraint databasestransitive closure logics

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Semialgebraic sets and related spaces (14P10) Triangulating (57R05)

Recommendations

• scientific article; zbMATH DE number 2241916
• On the expressiveness of linear-constraint query languages for spatial databases
• An expressive language for linear spatial database queries
• On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• Topological queries in spatial databases
• First-order complete and computationally complete query languages for spatio-temporal databases
• scientific article; zbMATH DE number 1696849
• Spatial query optimization: From Boolean constraints to range queries
• Transitive-closure spanners: a survey

Cited in

(5)

• scientific article; zbMATH DE number 2241916 (Why is no real title available?)
• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
• Trajectory databases: data models, uncertainty and complete query languages
• An expressive language for linear spatial database queries
• Topological elementary equivalence of regular semi-algebraic sets in three-dimensional space

This page was built for publication: Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470739)