Relational Data Base Machines
ComputerPublished 1 March 1979
Diane C. P. Smith, John Miles Smith
Citations29
SJR quartileQ2
SJR score0.55
SNIP1.02
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Relational data base machines using head-per-track disk technology or its electronic equivalent can move processing logic closer to the data, providing simplified storage organizations for large-scale applications.
Abstract
Relational data base machines using head-per-track disk technology or its electronic equivalent can move processing logic closer to the data, providing simplified storage organizations for large-scale applications.
Keywords
Computer Science
Communications of the ACMA relational model of data for large shared data banks
5,238 Citations1970E. F. Codd
A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Communications of the ACMA relational model of data for large shared data banks
4,834 Citations1983E. F. Codd
ACM Transactions on Database SystemsSystem R
1,043 Citations1976M. M. Astrahan, Michael W. Blasgen +12 more
This paper contains a description of the overall architecture and design of the system, and emphasizes that System R is a vehicle for research in database architecture, and is not planned as a product.
ACM Transactions on Database SystemsThe design and implementation of INGRES
884 Citations1976Michael Stonebraker, Gerald Held +2 more
The currently operational (March 1976) version of the INGRES database management system is described, giving 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.
ACM Transactions on Database SystemsImplementing a relational database by means of specialzed hardware
254 Citations1979E. Babb
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.
IEEE Transactions on ComputersDirect—A Multiprocessor Organization for Supporting Relational Database Management Systems
220 Citations1979De Witt
Communications of the ACMOptimizing the performance of a relational algebra database interface
214 Citations1975John Miles Smith, Philip Yen-Tang Chang
An approach for implementing a “smart” interface to support a relational view of data is proposed to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification supplied by the user.
RAP
179 Citations1975Esen A. Ozkarahan, S. A. Schuster +1 more
Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data for efficient search mechanisms to handle large data bases within concurrent processing and on-line response limits.
ACM Transactions on Database SystemsThe design of a rotating associative memory for relational database applications
174 Citations1976C. S. Lin, Diane C. P. Smith +1 more
RARES is designed to enhance the performance of an optimizing relational query interface by supporting important high level optimization techniques and can perform tuple selection operations at the storage device and also can provide a mechanism for efficient sorting.
CASSM
112 Citations1975Stanley Y. W. Su, G. Jack Lipovski
The application view of CASSM, a Clontext Addressed Segment Sequential Memory implemented on a head-per-track disc and an array of non-numeric microprocessors, offers potential solutions to several large data base problems.
Advances in computersLogic per Track Devices
108 Citations1970Daniel L. Slotnick
This chapter describes a system that could not exist and would not even be worth thinking about (because many are needed) in the absence of cheap highly reliable electronic parts.
IEEE Transactions on ComputersDBC—A Database Computer for Very Large Databases
90 Citations1979Banerjee, Hsiao +1 more
Design considerations of a database computer are presented and several key concepts which are vital to database management are incorporated in the design and organization of the components.
ACM SIGARCH Computer Architecture NewsThe architecture of CASSM
86 Citations1973George P. Copeland, G. Jack Lipovski +1 more
ACM Transactions on Database SystemsConcepts and capabilities of a database computer\
75 Citations1978Jayanta Banerjee, David K. Hsiao +1 more
The concepts and capabilities of a database computer (DBC) are given and the proposed design is one of the first to describe a complete data-secure computer capable of handling large databases.
DIRECT - a multiprocessor organization for supporting relational data base management systems
66 Citations1978David J. DeWitt
The design of DIRECT, a multiprocessor organization for supporting relational data base management systems is presented, which has a MIMD (multiple instruction stream, multiple data stream) architecture and can simultaneously support both intra-query and inter-query concurrency.
A highly parallel computing system for information retrieval
64 Citations1972Behrooz Parhami
The tremendous expansion in the volume of recorded knowledge and the desirability of more sophisticated retrieval techniques have resulted in a need for automated information retrieval systems, but the high cost of such systems has prevented their widespread use.
Very Large Data BasesA search processor for data base management systems
61 Citations1978Hans-Otto Leilich, Günther Stiege +1 more
A special processor for performing the selection and restriction operation of data base management systems by linearly searching large files with very high speed is described.
The architecture of a context addressed segment-sequential storage
57 Citations1972Leonard D. Healy, G. Jack Lipovski +1 more
An architecture in which a cellular structure is adapted to the use of sequential-access bulk storage is described, which combines most of the advantages of a distributed processor with that of inexpensive bulk storage.
Very Large Data BasesThe rebound sorter: an efficient sort engine for large files
55 Citations1978T. C. Chen, Vincent Y. Lum +1 more
A new sorting scheme, called the rebound sort, implementable on a variety of technologies, e.g., magnetic bubbles and charge-coupled devices is described, which accepts as input a sequence of records, sorts them, and outputs the sorted records automatically.
The architecture of CASSM
54 Citations1973George P. Copeland, G. Jack Lipovski +1 more
It is intended to demonstrate that distributing intelligence throughout a rotating memory device can decrease the time required for search operations in large data bases, and that the search strategy and storage management functions can be efficiently carried out in hardware, greatly simplifying the software of information systems.
ACM Transactions on Database SystemsAnalysis of aarchitectural features for enhancing the performance of a database machine
29 Citations1977Esen A. Ozkarahan, K. C. Sevcik
The response time provided by RAP under several scheduling disciplines involving priority by class is analyzed, the cost effectiveness of the additional hardware in RAP necessary to support multiprogramming is assessed, and a detailed design of the RAP virtual memory system and its monitor is presented.
Structure memory designs for a database computer
28 Citations1977David K. Hsiao, Krishnamurthi Kannan +1 more
The design of an important component of the database computer, namely, the structure memory, is described and three design alternatives using three different technologies are proposed.
ACM Transactions on Database SystemsA note on associative processors for data management
24 Citations1978Glen G. Langdon
Some alternatives to the design of comparators, garbage collection, and domain extraction for architectures like the Relational Associative Processor (RAP) are offered.
A virtual memory system for a relational associative processor
18 Citations1976S. A. Schuster, Esen A. Ozkarahan +1 more
It has been found that user environments containing small relations or queries exhibiting either long processing times relative to paging requirements or some "locality" can efficiently page data between large data bases and data base machines without significant losses in performance.
Very Large Data BasesOn bubble memories and relational data base
16 Citations1978Hsiao-Yun Chang
The overall system is simpler both in operation and in programming, since the bubble hardware is intrinsically similar to the data model, and adapted to the access requirements.
Intelligent magnetic bubble memories
13 Citations1978Mário Jino, Jane W. S. Liu
It is intended to explore ways of incorporating the novel bubble chip organizations and bubble movement operations in the design of intelligent magnetic bubble memories and evaluate the improvements in performance of various file processing algorithms and memory organizations which can be achieved through their use.
Intelligent memory
11 Citations1976Murray Edelberg, L.R. Schissler
The intelligent memory is a computer memory formed of circulating serial storage loops and distributed processing logic that performs off-line sort processing, associative searching, updating and retrieval, and is capable of dynamically varying its loop size to accommodate varying data requirements.
Sorting with associative secondary storage devices
8 Citations1977C. S. Lin
This work discusses how to establish the sort domain histogram and analyzes the performance of the bucket sort algorithm, a method for sorting large files stored on disks which possess an associative search capability.
RePEc: Research Papers in EconomicsINFOPLEX: hierarchical decomposition of a large information management system using a microprocessor complex
7 Citations2003Stuart Madnick