Safety, domain independence and translation of complex value database queries

Hong Cheu Liu; Jeffrey Xu Yu; Weifa Liang

doi:10.1016/j.ins.2008.02.005

Safety, domain independence and translation of complex value database queries

Hong Cheu Liu^*, Jeffrey Xu Yu, Weifa Liang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	2507-2533
Number of pages	27
Journal	Information Sciences
Volume	178
Issue number	12
DOIs	https://doi.org/10.1016/j.ins.2008.02.005
Publication status	Published - 15 Jun 2008

Access to Document

10.1016/j.ins.2008.02.005

Cite this

@article{c4ee26dab0b64ea0b3f4cc0b49c4e7d5,

title = "Safety, domain independence and translation of complex value database queries",

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.",

keywords = "Complex value, Domain independence, Expressive power, Query translation, Safe query",

author = "Liu, {Hong Cheu} and Yu, {Jeffrey Xu} and Weifa Liang",

year = "2008",

month = jun,

day = "15",

doi = "10.1016/j.ins.2008.02.005",

language = "English",

volume = "178",

pages = "2507--2533",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "12",

}

TY - JOUR

T1 - Safety, domain independence and translation of complex value database queries

AU - Liu, Hong Cheu

AU - Yu, Jeffrey Xu

AU - Liang, Weifa

PY - 2008/6/15

Y1 - 2008/6/15

N2 - 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.

AB - 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.

KW - Complex value

KW - Domain independence

KW - Expressive power

KW - Query translation

KW - Safe query

UR - http://www.scopus.com/inward/record.url?scp=41749120526&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2008.02.005

DO - 10.1016/j.ins.2008.02.005

M3 - Article

SN - 0020-0255

VL - 178

SP - 2507

EP - 2533

JO - Information Sciences

JF - Information Sciences

IS - 12

ER -

Safety, domain independence and translation of complex value database queries

Abstract

Access to Document

Other files and links

Fingerprint

Cite this