Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/13462
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VANDEURZEN, Luc | - |
dc.contributor.author | GYSSENS, Marc | - |
dc.contributor.author | Van Gucht, Dirk | - |
dc.date.accessioned | 2012-03-21T14:36:42Z | - |
dc.date.available | 2012-03-21T14:36:42Z | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | Freuder, Eugene C. (Ed.). Principles and Practice of Constraint Programming - CP96, Second International Conference, CP96, Cambridge, MA, USA, August 1996. Proceedings, p. 468-481 | - |
dc.identifier.isbn | 3-540-61551-2 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/13462 | - |
dc.description.abstract | It has been argued that the linear database model, in which semi-linear sets are the only geometric objects, is very suitable for most spatial database applications. For querying linear databases, the language FO + linear has been proposed. We present both negative and positive results regarding the expressiveness of FO+linear. First, we show that the dimension query is definable in FO + linear, which allows us to solve several interesting queries. Next, we show the non-definability of a whole class of queries that are related to sets not definable in FO+linear. This result both sharpens and generalizes earlier results independently found by Afrati et al. and the present authors, and demonstrates the need for more expressive linear query languages if we want to sustain the desirability of the linear database model. In this paper, we show how FO + linear can be strictly extended within FO + poly in a safe way. Whether any of the proposed extensions is complete for the linear queries definable in FO + poly remains open. We do show, however, that it is undecidable whether an expression in FO + poly induces a linear query. | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.rights | Copyright 1996 Springer-Verlag Berlin-Heidelberg | - |
dc.title | On Query Languages for Linear Queries Definable with Polynomial Constraints | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Freuder, Eugene C. | - |
local.bibliographicCitation.conferencedate | August 19-22, 1996 | - |
local.bibliographicCitation.conferencename | Second International Conference on Principles and Practice of Constraint Programming (CP '96) | - |
local.bibliographicCitation.conferenceplace | Cambridge, Massachusetts, USA | - |
dc.identifier.epage | 481 | - |
dc.identifier.spage | 468 | - |
local.publisher.place | Berlin-Heidelberg-New York | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 1118 | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.doi | 10.1007/3-540-61551-2_94 | - |
local.bibliographicCitation.btitle | Principles and Practice of Constraint Programming - CP96, Second International Conference, CP96, Cambridge, MA, USA, August 1996. Proceedings | - |
item.accessRights | Closed Access | - |
item.fulltext | No Fulltext | - |
item.contributor | VANDEURZEN, Luc | - |
item.contributor | GYSSENS, Marc | - |
item.contributor | Van Gucht, Dirk | - |
item.fullcitation | VANDEURZEN, Luc; GYSSENS, Marc & Van Gucht, Dirk (1996) On Query Languages for Linear Queries Definable with Polynomial Constraints. In: Freuder, Eugene C. (Ed.). Principles and Practice of Constraint Programming - CP96, Second International Conference, CP96, Cambridge, MA, USA, August 1996. Proceedings, p. 468-481. | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
12
checked on Sep 6, 2020
Page view(s)
74
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.