## 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: | 15 - 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

### 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 ...

### Citations

9119 | Introduction to algorithms
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ...ion is some D 0 2 S. But then T had to terminate on N 0 =s\Gamma1 (D 0 ): this gives us a terminating computation for M , contradiction. Finally, M can be made deterministic using standard techniques =-=[CLR90]-=-. Namely observe that the nondeterministic choices during a computation of M can be encoded by a string of natural numbers. Thus, the deterministic version M 0 of M systematically generates all string... |

891 | Theory of Recursive Functions and Effective Computability - Rogers - 1967 |

298 | Object identity as a query language primitive - ABITEBOUL, KANELLAKIS - 1998 |

275 | Semantics programming languages: Structures and techniques. Foundation of computing - Gunter - 1993 |

129 | Naturally Embedded Query Languages - Breazu-Tannen, Buneman, et al. - 1992 |

124 | Beeri: On the Power of Languages for the Manipulation of Complex Objects INRIA Rapports de Recherche No. 846
- Abiteboul, C
- 1988
(Show Context)
Citation Context ...parallel execution of the external functions, while the second definition restricts queries to sequential execution of the external functions, see Example 6.6 and Proposition 6.5. Abiteboul and Beeri =-=[AB88], and Esco-=-bar-Molano, Hull, and Jacobs [EMHJ93] propose two related language-independent definitions for "reasonable" queries with external functions. Their main purpose was to identify which of the q... |

123 |
Generic computation and its complexity
- ABITEBOUL, VIANU
- 1991
(Show Context)
Citation Context ...putability of queries with external functions is not addressed in [AB88, EMHJ93], and no previous attempt has been made to define complete query languages with external functions. Abiteboul and Vianu =-=[AV91]-=- introduce the notion of loose Generic Machine, later simplified to Relational Machines in [AVV92]. Their purpose was to define order-independent computations on databases. In order to compute a query... |

111 | Universal Algebra - Gratzer - 1979 |

84 | Computable queries for relational databases - Chandra, Harel - 1980 |

67 | Logical and computational aspects of programming with sets/bags/lists - Breazu-Tannen, Subrahmanyam - 1991 |

65 | Post-graduate Lecture Notes in Advanced Domain Theory (incorporating the â€˜Pisa notes - Plotkin - 1981 |

38 | Fixpoint logics, relational machines, and computational complexity - ABITEBOUL, VARDI, et al. - 1997 |

33 | Fixpoints and bounded fixpoints for complex objects - Suciu - 1993 |

32 | The story of O 2 - Deux - 1990 |

30 | Converting nested relational algebra expressions into algebra expressions - Paredaens, Gucht - 1992 |

28 | Untyped sets, inventions, and computable queries - Hull, Su - 1989 |

22 | Safety and translation of calculus queries with scalar functions (extended abstract - Escobar-Molano, Hull, et al. - 1993 |

21 | Abiteboul and Catriel Beeri. The power of languages for the manipulation of complex values - Serge - 1995 |

18 | On two forms of structural recursion
- Suciu, Wong
- 1993
(Show Context)
Citation Context ...eterized by some signature \Sigma. By adding new language constructs we obtain more powerful query languages: e.g. we have NRA(\Sigma) ae NRA(\Sigma; dcr ) = NRA(\Sigma; loop) = NRA(\Sigma; sri), see =-=[SW95]-=-. For fix , we have, for \Sigma = ;, NRA(fix ) = NRA(loop), while for certain \Sigma, NRA(\Sigma; fix ) 6` NRA(\Sigma; loop), because, over total database, the former language can express partial quer... |

16 | A Query Language for NC - Suciu, Tannen - 1994 |

14 | A Comparison Between Algebraic Query Languages for Flat and Nested Databases - Gyssens, Gucht - 1991 |

14 | The powerset algebra as a natural tool to handle nested database relations - Gyssens, Gucht - 1992 |

14 | Type two computational complexity - Constable - 1973 |

14 | Domain independent formulas and databases - Topor - 1987 |

8 | Completeness results for recursive data bases
- Hirst, Harel
- 1993
(Show Context)
Citation Context ...er is on "data-independence", an issue that is not present in the theory of higher-type computability, since the object of discourse there (the natural numbers) are fully interpreted. Hirst =-=and Harel [HH93]-=- consider recursive databases, i.e. databases over a countable domain in which each relation, considered as a set of tuples, is recursive. We could view each external function of a database as infinit... |

6 |
The power of reflective relational machines
- Abiteboul, Papadimitriou, et al.
- 1994
(Show Context)
Citation Context ...that the two notions of computability coincide, implies that, by extending the Relational Machines from flat relations to nested relations, we obtain completeness. Abiteboul, Papadimitriou, and Vianu =-=[APV94]-=- also achieve completeness by using a different exten3 sion of the Relational Machines, namely with reflections. A Reflective Relational Machine has the ability to dynamically create queries, and to a... |

6 |
Principles of proramming with collection types
- Buneman, Naqvi, et al.
- 1995
(Show Context)
Citation Context ...igma = fp 1 : u 1 ! v 1 ; : : : ; p l : u l ! v l g, and call p 1 ; : : : ; p l external function symbols. We define the Nested Relational Algebra over \Sigma, NRA(\Sigma), following the formalism in =-=[BNTW95]-=-, as an algebra of functions. The constructs are given in Figure 1. For any database D = (D; P 1 ; : : : ; P l ; ) (i.e. which has only external functions, no relations), every expression f : s ! t in... |

5 | An extensible rule-based language with complex objects and data-functions - Abiteboul, Grumbach, et al. - 1989 |

5 | Expressiveness and complexity of restricted languages for complex objects - Grumbach, Vianu - 1991 |

2 | Abiteboul and Victor Vianu. Generic computation and its complexity - Serge - 1991 |

2 |
Comments On Two Notions Of Higher Type Computability, Unpublished notes
- Bellantoni
- 1990
(Show Context)
Citation Context ...f type N ! N is a type 1 function; a function (N N ) k \Theta N l ! N is a type 2 function [Con73, KC91]. Functions of type level n are those which expect as inputs functions of type levelsn \Gamma 1 =-=[Bel94]. From thi-=-s perspective, our queries on databases with external functions are of type 2, in that they take as inputs scalar functions. Our emphasis however is on "data-independence", an issue that is ... |

1 | A new characteriztion of Mehlhorn's ppolynomial time functionals - Kapron, Cook - 1991 |