Showing papers by "Don Batory published in 1989"
06 Feb 1989
TL;DR: The versatility of the O/sup 2/FDL is demonstrated here for both relationally-complete expressions and more general computations.
Abstract: The Object-Oriented Functional Data Language (O/sup 2/FDL), an interactive, strongly typed database programming language, is discussed. It features inheritance and encapsulation of object-oriented languages and a functional notation for message expressions. The main contributions of the O/sup 2/FDL are: (1) functions of indefinite nesting levels that simplify nested list processing and form the basis of an efficient computation model; (2) path expressions that allow a flexible, graphical correspondence for database queries; (3) a type system featuring parametric and inclusion polymorphism, function restrictions, and type inferencing; and (4) system-defined functions that provide a concise and convenient notation for filtering aggregating, and combining objects. The versatility of the O/sup 2/FDL is demonstrated here for both relationally-complete expressions and more general computations. >
15 citations
20 Sep 1989
TL;DR: The authors explain how domain analysis has led them to a building-blocks technology for file management systems (FMSs), and they describe their most recent prototype, an FMS synthesizer, which enables a customized FMS to be assembled from prewritten components in minutes at virtually no cost.
Abstract: Domain analysis, a classical approach to the indentification of reusable software modules, relies on in-depth studies of existing systems, published algorithms, and structures to discern generic architectures for large classes of systems. An architecture is a template in which building-block modules can be plugged. Interfaces are standardized to make blocks interchangeable. The authors explain how domain analysis has led them to a building-blocks technology for file management systems (FMSs), and they describe their most recent prototype, an FMS synthesizer. The synthesizer enables a customized FMS to be assembled from prewritten components in minutes at virtually no cost. >
15 citations
TL;DR: It is demonstrated reusability can be achieved by imposing standardized interfaces and expressing algorithms in a DBMS-implementation-independent manner by standardizing algorithm definitions in terms of query-graph rewrite rules.
8 citations
03 Jan 1989
TL;DR: By elevating the semantics of long fields from a sequence of bytes to a sequenceof instances of a (potentially complex) data type, the mechanisms for storing and retrieving nested relations and long fields are equated.
Abstract: Two seemingly distinct features of next-generation database management systems (DBMSs): long fields and nested relations. A long field contains an uninterpreted sequence of bytes of potentially enormous length. A nested relation is a relation that has relation-valued attributes; the nesting of relations can be arbitrarily deep. By elevating the semantics of long fields from a sequence of bytes to a sequence of instances of a (potentially complex) data type, the mechanisms for storing and retrieving nested relations and long fields are equated. An implementation of these ideas in the context of the GENESIS extensible DBMS is described. >
3 citations