RAP. 2 - an Associative Processor for data bases

Schuster, S. A.; Nguyen, H. B.; Ozkarahan, Esen A.; Smith, K.C.

doi:10.1145/800094.803027

Cited by 25 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, some amount of processing may be performed directly by marking data on the disk, without having to move it to primary memory. An example of such a system is the Relational Associative Processor (RAP) [12]. The main problem with this approach is the high cost of implementation and a number of technological difficulties in supporting the special-purpose circuitry of the read/write mechanisms.…”

Section: The L/o-bandwidth Problemmentioning

confidence: 99%

AGM: a dataflow database machine

Bic

Hartmann

1989

ACM Trans. Database Syst.

View full text Add to dashboard Cite

In recent years, a number of database machines consisting of large numbers of parallel processing elements have been proposed. Unfortunately, there are two main limitations in database processing that prevent a high degree of parallelism; these are the available I/O bandwidth of the underlying storage devices and the concurrency control mechanisms necessary to guarantee data integrity. The main problem with conventional approaches is the lack of a computational model capable of utilizing the potential of any significant number of processing elements and storage devices and, at the same time, preserving the integrity of the database.This paper presents a database model and its associated architecture, which is based on the principles of data-driven computation. According to this model, the database is represented as a network in which each node is conceptually an independent, asynchronous processing element, capable of communicating with other nodes by exchanging messages along the network arcs. To answer a query, one or more such messages, called tokens, are created and injected into the network. These then propagate asynchronously through the network in search of results satisfying the given query.The asynchronous nature of processing permits the model to be mapped onto a computer architecture consisting of large numbers of independent disk units and processing elements. This increases both the available I/O bandwidth as well as the processing potential of the machine. At the same time, new concurrency control and error recovery mechanisms are necessary to cope with the resulting parallelism.

show abstract

Section: The L/o-bandwidth Problemmentioning

confidence: 99%

AGM: a dataflow database machine

Bic

Hartmann

1989

ACM Trans. Database Syst.

View full text Add to dashboard Cite

show abstract

“…Other exemples of PPT are CASSM [3], RAP [4], RARES [5], proposed data structures were very rigid, and hardware was registers and comparators.…”

mentioning

confidence: 99%

The schuss filter

Gonzalez-Rubio¹,

Rohmer²,

Terral³

1984

Proceedings of the 11th Annual International Symposium on Computer Architecture - ISCA '84

View full text Add to dashboard Cite

“…Examples of database machines are: RAP (Relational Associative Processor), [SCHU78] ; DBC (Data Base Computer), [BAN78A] ; DIREC'I'…”

mentioning

confidence: 99%

The effect of target applications on the design of database machines

Hawthorn

1981

Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data - SIGMOD '81

View full text Add to dashboard Cite

LBL-12412Specialized, single function processors can be built to be faster and cheaper than general purpose processors. Most database machines use such special purpose processors to manipulate data, with a general purpose managing processor to control the special purpose processors and perform utility functions.In this paper, the organization and use of these data manipulation processors is explored. Database machines are classified into single data manipulation processor systems, multiple disk-associated data manipulation processor systems, and multiple cache-associated processor systems.Examples of actual database machines are given for each category.Application types are classified into business, bibliographic search, and statistical analysis systems. A metric is developed to compare the performance of the categories of database machines with respect to the application types. The metric is the effective instruction rate, which is cornparable to the instruction rate (millions of instructions per second) for conventional computers.It is shown that the effective instruction rate is highly ~ensitive to the proportion of work performed in the database machine's data manipulation processors.Therefore, determining the work that must be performed in the machine's managing processor is found to be important to determining the performance of the machine.Database machine performance for each category of database machines is compared for each type of application. It is shown that single processor systems are best for business applications; that disk-based multiple processor systems are best for bibliographic search applications; and that hybrid systems are best for statistical analysis applications. Therefore, the design of the organization of data manipulation processors is shown to be application-dependent.

show abstract

RAP. 2 - an Associative Processor for data bases

Cited by 25 publications

References 11 publications

AGM: a dataflow database machine

AGM: a dataflow database machine

The schuss filter

The effect of target applications on the design of database machines

Contact Info

Product

Resources

About