On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases

DOI10.1006/jcss.1999.1625zbMath0939.68027OpenAlexW2034207933MaRDI QIDQ1307697

Freddy Dumortier, Dirk Van Gucht, Marc Gyssens, Luc Vandeurzen

Publication date: 9 November 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1625

zbMATH Keywords

regular stratificationsemialgebraic sets

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals ⋮ A representation independent language for planar spatial databases with Euclidean distance ⋮ An expressive language for linear spatial database queries ⋮ On the expressiveness of linear-constraint query languages for spatial databases

Uses Software

• LyriC

Cites Work

• Elementary structure of real algebraic varieties
• Efficient structures for geometric data management
• Queries with arithmetical constraints
• A new decision method for elementary algebra
• Relational expressive power of constraint query languages
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Fourier algorithm revisited
• On the expressiveness of linear-constraint query languages for spatial databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases