Expressive power of query languages for constraint complex value databases
Date
2011
Authors
Liu, H.C.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011; 6588:195-209
Statement of Responsibility
Conference Name
Abstract
Motivated 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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2011 Springer-Verlag Berlin Heidelberg