Safety, domain independence and translation of complex value database queries

Authors:
Hong-Cheu Liu;Jeffrey Xu Yu;Weifa Liang
Affiliations:
Department of Computer Science and Information Engineering, Diwan University, Tainan County 72153, Taiwan;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong, China;Department of Computer Science, The Australian National University, Canberra ACT 0200, Australia
Venue:
Information Sciences: an International Journal
Year:
2008

Citing 23
Cited 1

Sets and negation in a logic data base language (LDL1)

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Logic programming with sets

Journal of Computer and System Sciences
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
Domain independence and the relational calculus

Acta Informatica
Tractable query languages for complex object databases

Journal of Computer and System Sciences
Domain-independent queries on databases with external functions

Theoretical Computer Science - Special issue: database theory
Safety, domain independence and generalized quantification

Data Engineering
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Remarks on the algebra of non first normal form relations

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Safe Database Queries with External Functions

IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Algebraic equivalences of nested relational operators

Information Systems
The use of Hints in SQL-Nested query optimization

Information Sciences: an International Journal
Constructibility and decidability versus domain independence and absoluteness

Theoretical Computer Science

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

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify recursive sets of formulas, called embedded allowed, which is a class with desirable properties of ''reasonable'' queries. We then show that all embedded allowed calculus (or fix-point) queries are domain independent and continuous. An algorithm for translating embedded allowed queries into equivalent algebraic expressions as a basis for evaluating safe queries in all calculus-based query classes has been developed. Finally we discuss the topic of ''domain independent query programs'', compare the expressive power of the various complex value query languages and their embedded allowed versions, and discuss the relationship between safety, embedded allowed, and domain independence in the various calculus-based queries.