Technical Reports (CIS)
Document Type
Technical Report
Date of this Version
September 1994
Abstract
We investigate queries in the presence of external functions with arbitrary inputs and outputs (atomic values, sets, nested sets etc). We propose a new notion of domain independence for queries with external functions which, in contrast to previous work, can also be applied to query languages with fixpoints or other kinds of iterators. Next, we define two new notions of computable queries with external functions, and prove that they are equivalent, under the assumption that the external functions are total. Thus, our definition of computable queries with external functions is robust. Finally, based on the equivalence result, we give examples of complete query languages with external functions. A byproduct of the equivalence result is the fact that Relational Machines are complete for complex objects: it was known that they are not complete over flat relations.
Recommended Citation
Dan Suciu, "Domain-Independent Queries on Databases With External Functions", . September 1994.
Date Posted: 20 August 2007
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-94-48.