Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Domain-independent formulas and databases
Theoretical Computer Science
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
A rule-based language with functions and sets
ACM Transactions on Database Systems (TODS)
Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
Expressiveness and complexity of restricted languages for complex objects
DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Syntactical characterization of a subset of domain-independent formulas
Journal of the ACM (JACM)
Safety and translation of calculus queries with scalar functions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable query languages for complex object databases
Journal of Computer and System Sciences
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Domain-Independent Queries on Databases with External Functions
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Collections of Objects in SQL3
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Safety, domain independence and translation of complex value database queries
Information Sciences: an International Journal
Expressive power of query languages for constraint complex value databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
| Hi-index | 0.00 |
We consider the theory of database queries with functions on the complex value data model. The notion of a syntactic criteria, called `embedded allowed', for queries which guarantee embedded domain independence, is generalized for this model. We show that all embedded allowed calculus (or fix-point) queries are external function domain independent and continuous. We also develop an algorithm for translating embedded allowed queries into equivalent algebraic expressions as a basis for evaluating safe queries in all calculus-based query classes. In the second part of this paper, we compare the expressive power of various complex value query languages extended with functions and their certain restricted versions. If we assume polynomial time (space) complexity of external functions and type usage by the database, such as density, then strongly embedded allowed inflationary (partial) fix-point queries express precisely QPTIME (QPSPACE). Finally, we show the relationship between properties such as embedded domain independence, finiteness and embedded allowed in various calculus-based query languages.