eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-12-17
1
7
10.4230/DagSemProc.07212.2
article
07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems
Bank, Bernd
Egenhofer, Max J.
Heintz, Joos
Kuijpers, Bart
Revesz, Peter
During the last two decades the topic of constraint databases has evolved into a mature area of computer science with sound mathematical foundations and with a profound theoretical understanding of the expressive power of a variety of query languages. Constraint databases are especially suited for applications in which possibly infinite sets of continuous data, that have a geometric interpretation, need to be stored in a computer. Today, the most important application domains of constraint databases are geographic information systems (GIS), spatial databases and spatio-temporal databases. In these applications infinite geometrical sets of continuous data are finitely represented by means of finite combinations of polynomial equality and inequality constraints that describe these data sets (in mathematical terms these geometrical data sets are known as semi-algebraic sets and they have been extensively studied in real algebraic geometry). On the other hand, constraint databases provide us with a new view on classic (linear and nonlinear) optimization theory.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07212/DagSemProc.07212.2/DagSemProc.07212.2.pdf
Constraint databases
elimination procedures
geographical information systems