SQL/XNF - processing composite objects as abstractions over relational data

An extension to SQL, called the SQL extended normal form (XNF), is discussed. It enhances relational technology by a composite object facility, which comprises not only extraction of composite objects from existing databases but also efficient navigation and manipulation facilities provided by an appropriate application programming interface. The language itself allows sharing of the database among normal form SQL applications and composite object applications. It provides proper subsetting of the database and subsequent structuring, exploiting subobject sharing and recursion, all based on its powerful composite object constructor concept, which is closed under the language operations. XNF is integrated into the relational framework, thus benefiting from the available technology such as relational engine and query optimization

Flexible Relations - Operational Support of Variant Relational Struetures

The relational model is accepted for its simplicity and eIegance. At the other side the simplicity causes the problem, that most semantic type constructs are not representable as a simple relation. Variant and heterogeneous structures belong to those constructs not adequatly supported by the simple relational model. In this paper we give an overview of the model of flexible relations that allows to model and process arbitrary heterogeneous structures, while preserving the relational philosophy of operating with a single constructor. As flexible relations support both the modeling and the operational aspect of variant structures seamlessly, our model truly helps to further bridge the gap between semantic and operational data models. We discuss the structural part of the moQ.el and introduce an algebra for flexible relations. Further we examine a subdass of flexible relations, that can be processed as efficiently as the simple relational model, and show that this subdass possesses desirable structural normal form properties. In addition, we point out that our approach exceeds the objectoriented paradigm in modeling power, typing precision, and query optimization potential

Flexibility in Data Management

With the ongoing expansion of information technology, new fields of application requiring data management emerge virtually every day. In our knowledge culture increasing amounts of data and work force organized in more creativity-oriented ways also radically change traditional fields of application and question established assumptions about data management. For instance, investigative analytics and agile software development move towards a very agile and flexible handling of data. As the primary facilitators of data management, database systems have to reflect and support these developments. However, traditional database management technology, in particular relational database systems, is built on assumptions of relatively stable application domains. The need to model all data up front in a prescriptive database schema earned relational database management systems the reputation among developers of being inflexible, dated, and cumbersome to work with. Nevertheless, relational systems still dominate the database market. They are a proven, standardized, and interoperable technology, well-known in IT departments with a work force of experienced and trained developers and administrators. This thesis aims at resolving the growing contradiction between the popularity and omnipresence of relational systems in companies and their increasingly bad reputation among developers. It adapts relational database technology towards more agility and flexibility. We envision a descriptive schema-comes-second relational database system, which is entity-oriented instead of schema-oriented; descriptive rather than prescriptive. The thesis provides four main contributions: (1)~a flexible relational data model, which frees relational data management from having a prescriptive schema; (2)~autonomous physical entity domains, which partition self-descriptive data according to their schema properties for better query performance; (3)~a freely adjustable storage engine, which allows adapting the physical data layout used to properties of the data and of the workload; and (4)~a self-managed indexing infrastructure, which autonomously collects and adapts index information under the presence of dynamic workloads and evolving schemas. The flexible relational data model is the thesis\' central contribution. It describes the functional appearance of the descriptive schema-comes-second relational database system. The other three contributions improve components in the architecture of database management systems to increase the query performance and the manageability of descriptive schema-comes-second relational database systems. We are confident that these four contributions can help paving the way to a more flexible future for relational database management technology

Implementing version support for complex objects

New applications in the area of office information systems, computer aided design and manufacturing make new demands upon database management systems. Among others highly structured objects and their history have to be represented and manipulated. The paper discusses some general problems concerning the access and storage of complex objects with their versions and the solutions developed within the AIM/II project. Queries related to versions are distinguished in ASOF queries (asking information valid at a certain moment) and WALK-THROUGH-TIME (WTT) queries (obtaining trend information concerning a certain period). In the paper some new algorithms to handle such queries are presented. A brief analysis gives an indication about the performance of query processing in historical databases