Paper Info
Title
Domain-Oriented Relational Languages
Abstract
A view of the semantics of a relational data base consists in considering that the data base domains represent the sets of objects of the subject matter and that the relations represent various kinds of associations among these objects. This view is supported by query languages where each variable ranges on a domain of the relational data base and predicates correspond to the associations modeled by relations. This paper defines two domain-oriented relational languages. DRC is a many-sorted calculus, where the structural role of domains is emphasized by defining types for variables and type-checking rules. ILL is an English-like language, which is wholly built upon a structure of expressions nested inside other expressions. "Domain-languages" are contrasted with "tuple languages", which manipulate as basic objects the relation n-tuples. Directly manipulating domains and domain values interacts more directly with the semantics expressed by the relations and produces simpler and more English-like languages.
Year
Venue
Keywords
1977
VLDB
basic object,domain values interacts,relational data base,query language,domain-oriented relational language,defining type,english-like language,many-sorted calculus,relation n-tuples,data base domain
Field
DocType
Citations 
Codd's theorem,Query language,Relational calculus,Expression (mathematics),Relational database,Tuple,Computer science,Tuple relational calculus,Database,Domain relational calculus
Conference
28
PageRank 
References 
Authors
23.89
7
2
Name
Order
Citations
PageRank
Michel Lacroix12823.89
Alain Pirotte2916260.52