Please use this identifier to cite or link to this item:
Title: Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems
Authors: Bank, Bernd
Egenhofer, M.
Heintz, J.
Revesz, P.
Issue Date: 2007
Publisher: Dagstuhl
Source: BANK, B. & EGENHOFER, M. & HEINTZ, J. & KUIJPERS, B. & REVESZ, P. (Ed.) Constraint Databases, Geometric Elimination and Geographic Information Systems.
Series/Report: Dagstuhl Seminar Proceedings
Series/Report no.: 07212
Abstract: During the past 15 years the topic of constraint databases (CDB) [2, 3] 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 in finite sets of continuous data, which have a geometric interpretation, have 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 [2, 3, 4]. In these applications in finite 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 of classic (linear and nonlinear) optimization theory.
Document URI:
Link to publication:
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
07212.SWM.ExtAbstract.1282.pdf130.26 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Feb 24, 2022


checked on Feb 24, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.