Showing papers by "Eugene J. Shekita published in 1990"
TL;DR: The purpose of the Starburst project is to improve the design of relational database management systems and enhance their performance, while building an extensible system to better support nontraditional applications and to serve as a testbed for future improvements in database technology.
Abstract: The purpose of the Starburst project is to improve the design of relational database management systems and enhance their performance, while building an extensible system to better support nontraditional applications and to serve as a testbed for future improvements in database technology. The design and implementation of the Starburst system to date are considered. Some key design decisions and how they affect the goal of improved structure and performance are examined. How well the goal of extensibility has been met is examined: what aspects of the system are extensible, how extensions can be done, and how easy it is to add extensions. Some actual extensions to the system, including the experiences of the first real customizers, are discussed. >
242 citations
01 May 1990
TL;DR: Three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems are described and an analysis is carried out to compare the performance of the pointers to their standard, non-pointer-based counterparts.
Abstract: In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems. Each join algorithm is described and an analysis is carried out to compare the performance of the pointer-based algorithms to their standard, non-pointer-based counterparts. The results of the analysis show that the pointer-based algorithms can provide significant performance gains in many situations. The results also show that the pointer-based nested-loops join algorithm, which is perhaps the most natural pointer-based join algorithm to consider using in an object-oriented database system, performs quite poorly on most medium to large joins.
116 citations
Proceedings Article•
13 Aug 1990
TL;DR: The design, implementation, and performance of an incremental join facility that has been added as an extension to the Starburst extensible DBMS, which provides an efficient access path for joins that materialize many-to-one relationships.
Abstract: In this paper we describe the design, implementation, and performance of an incremental join facility that has been added as an extension to the Starburst extensible DBMS. This facility provides an efficient access path for joins that materialize many-to-one relationships, and it works by maintaining hidden pointer fields embedded in related tuples. The facility was constructed for two reasons: as an experiment in using pointers in the internals of a relational DBMS, and as a stress-test of the Starburst extension architecture. In addition to describing the join facility and its performance, we also summarize what it taught us about extensibility both in Starburst and in general.
48 citations