Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dense-order constraint databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
First-order queries on databases embedded in an infinite structure
Information Processing Letters
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
Domain-independent queries on databases with external functions
Theoretical Computer Science - Special issue: database theory
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
Safe stratified Datalog with integer order does not have syntax
ACM Transactions on Database Systems (TODS)
Query languages with arithmetic and constraint databases
ACM SIGACT News
Relational queries over interpreted structures
Journal of the ACM (JACM)
SIAM Journal on Computing
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
A collapse result for constraint queries over structures of small degree
Information Processing Letters
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences - Special issue on PODS 2000
Safe Database Queries with External Functions
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Constructibility and decidability versus domain independence and absoluteness
Theoretical Computer Science
Safety, domain independence and translation of complex value database queries
Information Sciences: an International Journal
Hi-index | 0.00 |
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 activegeneric 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.