Titlebook: Database Programming Languages (DBPL-4); Proceedings of the F Catriel Beeri,Atsushi Ohori,Dennis E. Shasha Conference proceedings 1994 Spri

绅士

Bulk Data Types, A Theoretical Approachg. We present a formal definition of bulk data types, based on parameterized algebraic specifications. We then define appropriate relationships between bulk types, and show that BDTs together with such relationships form a category with sets as the terminal object. We consider how to apply structura

PURG

Tidious

Ordered Types in the AQUA Data Modelance. This relationship can be a total or partial order among the elements or among equivalence classes where each equivalence class consists of one or more elements. In terms of data structures, ordered types can be viewed as graphs, trees, or lists..Lately there has been a lot of interest in bulk

resilience

A Functional Object Database Languageet strong and statically checked, type system. Its main source of flexibility is its support for object evolution, that is, dynamic type changes of existing objects. Originally, BCOOL was used as a formal basis for a more traditional (relational algebra-style) database language, COOL. In this paper,

minimal

The AQUA Data Model and Algebrat as a part of the EREQ project. The model adopts a uniform view of objects and values and separates syntactic, semantic, and implementation concerns. The algebra addresses issues of type-defined equality and duplicate elimination as well as extensions to bulk types other than sets.

Consensus

An Abstract Object-Oriented Query Execution Languagethe question prompts us to address a different, though related question: What are appropriate abstractions for expressing object-oriented query execution plans? Our answer takes the form of a language that can serve as the interface between an optimizer and an execution engine. Our query execution l

BRAND

ADORE