Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/633
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Heintz, Joos | - |
dc.contributor.author | KUIJPERS, Bart | - |
dc.date.accessioned | 2005-03-14T12:31:46Z | - |
dc.date.available | 2005-03-14T12:31:46Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | CONSTRAINT DATABASES, PROCEEDINGS. p. 1-24 | - |
dc.identifier.isbn | 3-540-22126-3 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/633 | - |
dc.description.abstract | Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the expressive power of first-order logic over the reals, as a constraint database query language, has been studied extensively. The difficulty of the effective evaluation of first-order queries, usually involving some form of quantifier elimination, has been largely neglected. The contribution of this paper is a discussion of various aspects that influence the efficiency of the evaluation of queries expressible in first-order logic over the reals. We emphasize the importance of data structures and their effect on the complexity of quantifier-elimination. We also propose a novel data model that supports data exploration and visualization as well as efficient query evaluation. In this context, we introduce the concept of sample point query. Finally, we show that a particular kind of sample point query cannot be evaluated in polynomial sequential time by means of branching-parsimonious procedures. Research partially supported by the following Argentinian, Belgian, German and Spanish grants: | - |
dc.language.iso | en | - |
dc.publisher | Springer-Verlag | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | Constraint Databases, Data Structures and Efficient Query Evaluation | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencename | CONSTRAINT DATABASES, PROCEEDINGS | - |
dc.identifier.epage | 24 | - |
dc.identifier.spage | 1 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 3074 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.isi | 000222323700001 | - |
item.accessRights | Closed Access | - |
item.validation | ecoom 2005 | - |
item.contributor | Heintz, Joos | - |
item.contributor | KUIJPERS, Bart | - |
item.fulltext | No Fulltext | - |
item.fullcitation | Heintz, Joos & KUIJPERS, Bart (2004) Constraint Databases, Data Structures and Efficient Query Evaluation. In: CONSTRAINT DATABASES, PROCEEDINGS. p. 1-24. | - |
crisitem.journal.issn | 0302-9743 | - |
Appears in Collections: | Research publications |
WEB OF SCIENCETM
Citations
8
checked on Jul 13, 2024
Page view(s)
68
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.