Current studentsExisting staffContact us
 

Expressive power of query languages for constraint complex value databases

Simple item page
dc.contributor.authorLiu, H.C.
dc.date.issued2011
dc.description.abstractMotivated by constraint complex values which allow us to represent nested finitely representable sets, we study the expressive power of various query languages over constraint complex value databases. The tools we use come in the form of collapse results which are well established results in the context of first-order logic. We show that active-generic collapse carries over to second-order logic for structures with o-minimality and any relational signature in the complex value model. We also consider the problem of safety in the context of embedded finite complex value models and constraint complex value databases.
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011; 6588:195-209
dc.identifier.doi10.1007/978-3-642-20152-3_15
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttps://hdl.handle.net/1959.8/151873
dc.language.isoen
dc.publisherSpringer
dc.rightsCopyright 2011 Springer-Verlag Berlin Heidelberg
dc.source.urihttps://doi.org/10.1007/978-3-642-20152-3_15
dc.subjectcomplex values
dc.subjectexpressive power
dc.subjectfirst order logic
dc.subjectminimality
dc.subjectover-constraint
dc.subjectsecond-order logic
dc.subjectgeographic information system
dc.subjectquery language
dc.subjectconstraint complext
dc.subjectquery class
dc.titleExpressive power of query languages for constraint complex value databases
dc.typeJournal article
pubs.publication-statusPublished
ror.mmsid9915909188401831

Files

Collections