Complete geometric query languages

Citation
M. Gyssens et J. Van Den Bussche, Complete geometric query languages, J COMPUT SY, 58(3), 1999, pp. 483-511
Citations number
16
Categorie Soggetti
Computer Science & Engineering
Journal title
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
ISSN journal
00220000 → ACNP
Volume
58
Issue
3
Year of publication
1999
Pages
483 - 511
Database
ISI
SICI code
0022-0000(199906)58:3<483:CGQL>2.0.ZU;2-S
Abstract
We extend Chandra and Harel's seminal work on computable queries for relati onal databases to a setting in which also spatial data may be present using a constraint-based data model. Concretely, we introduce both coordinate-ba sed and point-based query languages that are complete in the sense that the y can express precisely all computable queries that are genetic with respec t to certain classes of transformations of space, corresponding to certain geometric interpretations of spatial data. The languages we introduce are o btained by augmenting basic languages with a "while" construct. We also sho w that the respective basic point-based languages are complete: relative to the subclass of the corresponding generic queries consisting of those that are expressible in the relational calculus with real polynomial constraint s. (C) 1999 Academic Press.