Queries on Databases with User-Defined Functions MS-CIS-93-62 LOGIC & COMPUTATION 70

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. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-62. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/282 Queries on Databases with User-Defined Functions MS-CIS-93-62 LOGIC & COMPUTATION 70

[1]  Patrick C. Fischer,et al.  Multilevel Nested Relational Structures , 1988, J. Comput. Syst. Sci..

[2]  Peter Schäuble,et al.  On the expressive power of query languages , 1994, TOIS.

[3]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[4]  Limsoon Wong,et al.  Naturally Embedded Query Languages , 1992, ICDT.

[5]  Richard Hull,et al.  Safety and translation of calculus queries with scalar functions , 1993, PODS.

[6]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[7]  Limsoon Wong,et al.  Query Languages for Bags , 1993 .

[8]  David A. Watt,et al.  Towards a Theory of Bulk Types , 2007 .

[9]  Jianwen Su,et al.  On accessing object-oriented databases: expressive power, complexity, and restrictions , 1989, SIGMOD '89.

[10]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

[11]  Jianwen Su,et al.  On the expressive power of database queries with intermediate types , 1988, PODS '88.

[12]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[13]  Philip Wadler,et al.  Comprehending monads , 1990, Mathematical Structures in Computer Science.

[14]  Jianwen Su,et al.  Untyped sets, invention, and computable queries , 1989, PODS '89.

[15]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[16]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[17]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, PODS '91.

[18]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[19]  Richard Hull,et al.  Relative information capacity of simple relational database schemata , 1984, SIAM J. Comput..

[20]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[21]  Philip W. Trinder,et al.  Comprehensions, a Query Notation for DBPLs , 1992, DBPL.

[22]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[23]  Peter Buneman,et al.  Structural Recursion as a Query Language , 1992, DBPL.

[24]  Jianwen Su,et al.  On the Expressive Power of Database Queries with Intermediate Types , 1991, J. Comput. Syst. Sci..