Extending the relational algebra to capture complex objects

An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt, the provision of network structures and shared subobjects as well as support for dynamic object definition and appropriate manipulation facilities is urgently needed for natural and accurate modeling as well as for efficient processing of the applications' objects. These concepts are the major concern of the molecule-atom data model (MAD model) and its molecule algebra which is introduced in this paper. They make the model stand out compared to the relational model and even to models limited to hierarchical and statically defined complex objects. By means of the molecule algebra a precise and complete specification of one conceivable kind of complex object processing and its inherent semantics is provided. Furthermore, this algebra is used as a sound basis to express the semantics of the high level query language MOL (molecule query language) that is able to deal with complex objects in a descriptive manner

Axiomatic Specification of Database Domain Statics

In the past ten years, much work has been done to add more structure to database models 1 than what is represented by a mere collection of flat relations (Albano & Cardelli [1985], Albano et al. [1986], Borgida eta. [1984], Brodie [1984], Brodie & Ridjanovic [1984], Brodie & Silva (1982], Codd (1979], Hammer & McLeod (1981], King (1984], King & McLeod [1984], [1985], Mylopoulos et al. [1980], Smith & Smith 1977a & b). 2 The informal approach which most of these studies advocate has a number of disadvantages. First, a recent survey of some of the pro­ posed models by Urban & Delcambre [1986] reveals a wide divergence in terminology and con­ cepts, making comparison of the expressive power of these models difficult. Second, undefined or even ill-defined concepts are a hindrance, not an aid, for the analysis of the Universe of Discourse (UoD). Third, informal treatment 9f such complex structures as set hierarchies, gen­ eralization hierarchies and aggregation hierarchies all in one model, with some dynamics thrown in for good measure, bodes ill for the consistency of these theories. The first goal of the research reported on is to integrate the static structures which these models propose in one coherent, axiomatic framework. It will be shown in chapter 7 that the theory presented here provides the needed conceptual foundations for these models. A second aim is to provide a possible worlds framework onto which to graft theories of the dynamics of the UoD. The third aim is to provide clear concepts which can aid the database model designer in his or her thinking about the UoD. In this report we concentrate on the first goal only, leav­ ing the formulation of theories of domain dynamics and the application to system development as research goals for the near future

Using Powerdomains to Generalize Relational Databases

Much of relational algebra and the underlying principles of relational database design have a simple representation in the theory of domains that is traditionally used in the denotational semantics of programming languages. By investigating the possible orderings on powerdomains that are well-known in the study of nondeterminism and concurrency it is possible to show that many of the ideas in relational databases apply to structures that are much more general than relations. This also suggests a method of representing database objects as typed objects in programming languages. In this paper we show how operations such as natural join and projection -- which are fundamental to relational database design -- can be generalized, and we use this generalized framework to give characterizations of several relational database concepts including functional dependencies and universal relations. All of these have a simple-minded semantics in terms of the underlying domains, which can be thought ..

Workshop on Database Programming Languages

These are the revised proceedings of the Workshop on Database Programming Languages held at Roscoff, Finistère, France in September of 1987. The last few years have seen an enormous activity in the development of new programming languages and new programming environments for databases. The purpose of the workshop was to bring together researchers from both databases and programming languages to discuss recent developments in the two areas in the hope of overcoming some of the obstacles that appear to prevent the construction of a uniform database programming environment. The workshop, which follows a previous workshop held in Appin, Scotland in 1985, was extremely successful. The organizers were delighted with both the quality and volume of the submissions for this meeting, and it was regrettable that more papers could not be accepted. Both the stimulating discussions and the excellent food and scenery of the Brittany coast made the meeting thoroughly enjoyable. There were three main foci for this workshop: the type systems suitable for databases (especially object-oriented and complex-object databases,) the representation and manipulation of persistent structures, and extensions to deductive databases that allow for more general and flexible programming. Many of the papers describe recent results, or work in progress, and are indicative of the latest research trends in database programming languages. The organizers are extremely grateful for the financial support given by CRAI (Italy), Altaïr (France) and AT&T (USA). We would also like to acknowledge the organizational help provided by Florence Deshors, Hélène Gans and Pauline Turcaud of Altaïr, and by Karen Carter of the University of Pennsylvania

and

This paper takes a rst step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among paths in the document. Our goal is to nd a way of converting an arbitrary DTD into a well-designed one, that avoids these problems. We rst introduce the concept of a functional dependency for XML, and de ne its semantics via a relational representation of XML. We then de ne an XML normal form, XNF, that avoids update anomalies and redundancies. We study its properties and show that it generalizes BCNF and a normal form for nested relations called NNF-FD when those are appropriately coded as XML documents. Finally, we present a lossless algorithm for converting any DTD into one in XN