Paper Info
Title
A new recursive subclass of domain independent formulas based on subimplication
Abstract
We motivate and define subimplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible and deductive databases and show that under the subimplication completion they are domain independent and safe
Year
DOI
Venue
1995
10.1109/ICDE.1995.380366
ICDE
Keywords
Field
DocType
relational calculus query,relational databases,new recursive subclass,domain dependent query,domain independent formula,domain independent,relational algebra,databases domain,range-restricted formula,deductive databases,weakly range-restricted formulas,domain dependent queries,subimplication completion,domain independent formulas,query processing,recursive subclass,weakly range-restricted formula,general deductive database,tail,logic,mathematics,calculus
Codd's theorem,Conjunctive query,Relational calculus,Deductive database,Computer science,Tuple relational calculus,Relational algebra,Database theory,Domain relational calculus,Database
Conference
ISSN
ISBN
Citations 
1063-6382
0-8186-6910-1
7
PageRank 
References 
Authors
6.53
8
2
Name
Order
Citations
PageRank
Joonyeoub Sung176.53
Lawrence J. Henschen2478280.94