Linear-constraint databases

From MaRDI portal





The text is the ninth chapter of the book of \textit{G. Kuper}, \textit{L. Libkin} and \textit{J. Paredaens} (eds.) [Constraint databases (2000; Zbl 0935.00022)]. It resumes the ideas of the precedent chapter that have shown linear constraints as an appropriate model for many sorts of real geographic data mainly because of the existence of numerous efficient algorithms for geometrical operations. Two approaches to modeling and querying linear-constraint databases are followed -- allowing only integer (or rational) coefficients in the formulae or general real algebraic ones. Most of the results in this chapter hold for both approaches, the opposite cases are explicitly indicated. After summarizing the properties of semi-linear sets, the positive (\S 9.3) and negative (\S 9.4) results are presented concerning the expressiveness of fundamental queries of topological and geometrical nature in the linear-constraint query language FO+LIN introduced in the section 2.4.2 of the same book -- see also \textit{J. Van den Bussche} [Constraint databases, queries and query languages (2000; Zbl 0962.68046)]. The ninth chapter continues with in-depth discussion of various ways how to extend FO+LIN to a richer language for linear queries and concludes with suitable bibliographic notes. For the entire collection see [Zbl 0935.00022].











This page was built for publication: Linear-constraint databases

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