Performance of complex queries in Main Memory Database Systems

Published 1 February 1987

Dina Bitton, Maria Hanrahan, Carolyn Turbyfill

DOI10.1109/icde.1987.7272358

Citations26

TL;DR

This paper describes and evaluates the main memory database structures and query processing algorithms implemented in this prototype of a Main Memory Database System (MMDBS) that was designed to support complex interactive queries and identifies strategies that exploit memory residence effectively.

Abstract

Memory residence can buy both functionality and performance for a database management system. In this paper, we present a description and a benchmark of an experimental implementation of a Main Memory Database System (MMDBS) that was designed to support complex interactive queries. We describe and evaluate the main memory database structures and query processing algorithms implemented in this prototype. Our measurements and analysis, focused on aggregates and joins, include both memory requirements and response time, since there is a clear trade-off between space and time in the design of a MMDBS. In contrast to conventional Disk-based Database Systems (DDBS's), we found that an MMDBS can efficiently execute complex relational queries. We identify strategies that exploit memory residence effectively. We also identified a number of performance problems related to query optimization in main memory and memory management for MMDBS's.

Keywords

Computer Science

ACM SIGMOD RecordThe design of POSTGRES

691 Citations1986Michael Stonebraker, Lawrence A. Rowe

Query by example

489 Citations1975Moshé M. Zloof

In the last few years the authors have witnessed a trend to appeal to the non-professional user who has little or virtually no computer or mathematical background, and this book aims to address that need.

Minds at UW (University of Wisconsin)Benchmarking Database Systems A Systematic Approach

396 Citations1983Dina Bitton, David J. DeWitt +1 more

A customized database and a comprehensive set of queries that can be used for systematic benchmarking of relational database systems and a first attempt in developing a scientific methodology for performance evaluation of database management systems are described.

View PDF

Addison-Wesley Longman Publishing Co., Inc. eBooksOperating system support for database management

139 Citations1986Michael Stonebraker

IBM Systems JournalOffice-by-Example: A business language that unifies data and word processing and electronic mail

131 Citations1982Moshé M. Zloof

Through the programming language discussed in this paper, executives and other office personnel can perform data and word processing and communications via terminals via terminals through Office-by-Example, which provides rich and powerful access to the computing system computation, data base, communication, and display facilities.

COMPCONDesign of a Memory Resident DBMS.

66 Citations1985Arthur C. Ammann, Maria Hanrahan +1 more

A robust and readily self-healing polymer, which is synthesized by one-pot polymerization among 2,4'-tolylene diisocyanate, isophorone diisophene, and poly(oxy-1,4-butanediyl), is achieved through reasonably tuning the hardness of the molecular segment and the strength of the dynamic crosslinking bond.

View PDF

The bounded disorder access method

33 Citations1986Witold Litwin, David Lomet

The bounded disorder method is the only one of the methods employing large nodes that can cope well with arbitrary key distributions, and is a good choice as the only access method of a data base system.

eCommons (Cornell University)Performance Evaluation of Main Memory Database Systems

12 Citations1986Dina Bitton, Carolyn Turbyfill

A comprehensive benchmark of the relational Main Memory Database System (MMDBS), that is the foundation of the interactive office system, and identifies issues that must be considered in the design and implementation of MMDBS''s.

View PDF