Implementation of the Database Machine Direct
TL;DR: The structure of the DIRECT software is described, which includes software on host computers that interfaces with the database machine; software on the back-end controller of DIRECT; and software executed by the query processors.
read more
Abstract: DIRECT is a multiprocessor database machine designed and implemented at the University of Wisconsin. This paper describes our experiences with the implementation of DIRECT. We start with a brief overview of the original machine proposal and how it differs from what was actually implemented. We then describe the structure of the DIRECT software. This includes software on host computers that interfaces with the database machine; software on the back-end controller of DIRECT; and software executed by the query processors. In addition to describing the structure of the software we will attempt to motivate and justify its design and implementation. We also discuss a number of implementation issues (e.g., debugging of the code across several machines). We conclude the paper with a list of the "lessons" we have learned from this experience.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Query evaluation techniques for large databases
TL;DR: This survey describes a wide array of practical query evaluation techniques for both relational and postrelational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set-matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.
A self-adjusting data distribution mechanism for multidimensional load balancing in multiprocessor-based database systems
Chiang Lee,Kien A. Hua +1 more
TL;DR: A self-adjusting data distribution scheme which balances computer workload at a cell (coarser grain than tuple) level during query processing to minimize redistribution cost and shows that under the authors' assumptions, it is always beneficial to rebalance computer workload before performing a join on skewed data.
36
Database concurrency control using data flow graphs
Margaret H. Eich,David L. Wells +1 more
TL;DR: Operations needed to create and maintain the DBFG structure as transactions are added or removed from the system are discussed and simulation results show that DBFG scheduling performs as well as two-phase locking.
24
A model and an architecture for a relational knowledge base
Haruo Yokota,Hidenori Itoh +1 more
- 01 May 1986
TL;DR: The relational knowledge base architecture the authors propose consists of a number of unification engines, several disk systems, a control processor, and a multiport page-memory to support a variety of knowledge representations.
23
Interconnecting shared-everything systems for efficient parallel query processing
Kien A. Hua,Chiang Lee,Jih-Kwon Peir +2 more
- 01 Dec 1991
TL;DR: A hybrid architecture in which SE clusters are interconnected through a communication network to form a SN structure at the inter-cluster level is presented, and a generalized performance model was developed to perform sensitivity analysis for the hybrid structure.
23
References
The design and implementation of INGRES
TL;DR: The currently operational (March 1976) version of the INGRES database management system is described in this article, which gives a relational view of data, supports two high level nonprocedural data sublanguages, and runs as a collection of user processes on top of the UNIX operating system for Digital Equipment Corporation PDP 11/40, 11/45, and 11/70 computers.
Decomposition—a strategy for query processing
Eugene Wong,Karel Youssefi +1 more
TL;DR: Strategy for processing multivariable queries in the database management system INGRES is considered, and algorithms for reduction and for choosing the variable to be substituted are given.
Implementing a relational database by means of specialzed hardware
TL;DR: New hardware is described which allows the rapid execution of queries demanding the joining of physically stored relations, with the main feature of the hardware being a special store which can rapidly remember or recall data.
266
The Roscoe distributed operating system
Marvin Solomon,Raphael A. Finkel +1 more
- 10 Dec 1979
TL;DR: This paper reports on experience with Roscoe and presents several problems currently being investigated by the Roscoe project.
89
RAP.2—An Associative Processor for Databases and Its Applications
Schuster,Nguyen,Ozkarahan,Smith +3 more
TL;DR: Details on a recently evolved, faster, and more flexible architecture for RAP are provided, called RAP, which combines the features of associative and array processors.
87