Add to ORKGQueries on Databases with User-Defined Functions The notion of a database query is generalized for databases with user-defined functions. Then, we can prove that the computable queries coincide with those expressible by an extension of the relational machine, with oracles ([4]). This implies that any complete query language, extended with user-defined function symbols in a "reasonable " way, is still complete. We give an example of a complete query language with user-defined functions, and discuss its connections with object inventions
AbstractWe investigate the expressive power of the typedλ-calculus when expressing computations over...
This paper suggests that more powerful data base systems (DBMS) can be built by supporting data base...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
The notion of a database query is generalized for databases with user-defined functions. Then, we ca...
The concept of “reasonable ” queries on relational data bases is investigated. We provide an abstrac...
We investigate queries in the presence of external functions with arbitrary inputs and outputs (atom...
AbstractA relational database can be considered as a finite structure for a finite relational signat...
AbstractRelational database transformations, encompassing database queries and updates, are studied....
AbstractWe study queries over databases with external functions, from a language-independent perspec...
AbstractThe concept of “reasonable” queries on relational data bases is investigated. We provide an ...
This thesis explores the use of functional languages to implement, manipulate and query databases. ...
This thesis explores the use of functional languages to implement, manipulate and query databases. I...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
We investigate queries in the presence of external functions with arbitrary inputs and outputs (atom...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
AbstractWe investigate the expressive power of the typedλ-calculus when expressing computations over...
This paper suggests that more powerful data base systems (DBMS) can be built by supporting data base...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
The notion of a database query is generalized for databases with user-defined functions. Then, we ca...
The concept of “reasonable ” queries on relational data bases is investigated. We provide an abstrac...
We investigate queries in the presence of external functions with arbitrary inputs and outputs (atom...
AbstractA relational database can be considered as a finite structure for a finite relational signat...
AbstractRelational database transformations, encompassing database queries and updates, are studied....
AbstractWe study queries over databases with external functions, from a language-independent perspec...
AbstractThe concept of “reasonable” queries on relational data bases is investigated. We provide an ...
This thesis explores the use of functional languages to implement, manipulate and query databases. ...
This thesis explores the use of functional languages to implement, manipulate and query databases. I...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
We investigate queries in the presence of external functions with arbitrary inputs and outputs (atom...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
AbstractWe investigate the expressive power of the typedλ-calculus when expressing computations over...
This paper suggests that more powerful data base systems (DBMS) can be built by supporting data base...
We consider the theory of database queries on a relational data model that includes a set of fixed r...