language: en

[To appear in Proc. 11th Intl. Conf. on Data Engg., 1995]

The AQUA Approach to Querying Lists and Trees in Object-Oriented Databases

Bharathi Subramanian Theodore W. Leung
Brown University Brown University
Scott L. Vandenberg Stanley B. Zdonik
Siena College Brown University

Abstract Relational database systems and most object-oriented database systems provide support for queries. Usually these queries represent retrievals over sets or multisets. Many new applications for databases, such as multimedia systems and digital libraries, need support for queries on complex bulk types such as lists and trees. In this paper we describe an object-oriented query algebra for lists and trees. The operators in the algebra preserve the ordering between the elements of a list or tree, even when the result list or tree contains an arbitrary set of nodes from the original tree. We also present predicate languages for lists and trees which allow order-sensitive queries because they use pattern matching to examine groups of list or tree nodes rather than individual nodes. The ability to decompose predicate patterns enables optimizations that make use of indices.

1 Introduction