Domain-Independent Queries on Databases with External Functions (1995)
Cached
Download Links
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [ftp.cis.upenn.edu]
- [ftp.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in "LNCS 893: Proceedings of 5th International Conference on Database Theory," 177--190 |
| Citations: | 12 - 2 self |
BibTeX
@INPROCEEDINGS{Suciu95domain-independentqueries,
author = {Dan Suciu},
title = {Domain-Independent Queries on Databases with External Functions},
booktitle = {in "LNCS 893: Proceedings of 5th International Conference on Database Theory," 177--190},
year = {1995},
pages = {177--190},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction Database functionalities are important both for practical and for theoretical purposes. E.g. the system O 2 of ...
