Abstract
In this paper we present RAPID, a co-processor for database operations. RAPID is a highly parallel processor, using wired algorithms, and built with several copies of a full custom VLSI component. RAPID displays several original features, such as a Sequential Partitioned Structure mixing sequential and parallel evaluation, and a full query resolution. The interfaces of RAPID with the DBMS and the host machine are quite simple. The main component of RAPID contains 16 to 32 processing elements, with sophisticated functionalities. It evaluates a 1000 tuples x 1000 join in about 3 milliseconds. The join duration is linear with the size of the source relations, even with source relations of more than one million of tuples. RAPID is presently being implemented in HCMOS3 technology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
AHO, Ullman, “Universality of Data Retrieval Languages”, 6th Conf. on Principles of Programming Languages, San Antonio, Texas, 1979
Anderson, G.A., “Multiple Match Resolvers: A New Design Method”, IEEE Transactions on Computers (Correspondence), dec. 1974
Boral, H., Dewitt, DJ., “Database Machines: An Idea Whose Time Has Passed? A Critique of the Future of Database Machines”, Proc.Int. Workshop on Database Machines, Munich, Springer ed., sept. 1983
Dewitt, D.J., Boral, H.,ed. “Database Machines”, 4th Int. Workshop on Database Machines Grand Bahama Island, Bahamas, mars 1985), Springer, NY, 1985
Fairchild, “The Clipper 32 bits Microprocessor: User Manual”, Addison Wesley, 1987
Faudemay, P., “Un processeur VLSI pour les opérations de bases de données”, Ph.D thesis, University Paris 6, Paris, june 1986 (in french)
Faudemay, P., Valduriez, P., “Design and Analysis of a Direct Filter Using Parallel Comparators”, in [DEWI85]
Hsiao, D.K., ed. “Advanced Database Machine Architecture”, Prentice-Hall, NJ, 1983
Iverson, K. “A Programming Language”, Wiley, 1966
Koster, A., Sondak, N., Sullivan, P., “The Application of a Geometric Arithmetic Systolic Processor to Database Machine Design”, Int. Conf. on Data Engineering, Los Angeles, feb.1986
Minker, J., “An Overview of Associative or Content-Adressable Memory Systems and a KWIC index to the Literature: 1956–1970”, Computing Reviews, Oct. 1971
Pistor, P., Andersen, F., “Designing a Generalized NF2 Model with an SQL-Type Language Interface”, 12th Int. Conf. on Very Large Data Bases, Kyoto, Aug. 1986
Pramanik, S., “Hardware Organization for Non Numeric Processing”, 7th. Int. Conf. on Very Large Data Bases, Cannes, France, sept. 1981
Salton, G., Fox, E., Wu, H., “Extended Boolean Information Retrieval”, Comm.ACM, dec. 1983
Stanfill, C, Kahle, B., “Parallel Free-Text Search on the Connection Machine System”, Comm.ACM, dec. 1986
Tanaka, Y. “Bit Sliced Algorithms for Search and Sort”, 10th Int. Conf. on Very Large Data Bases, Singapore, Aug. 1984
Takahashi, K. et al. “A New String Search Hardware Architecture for VLSI”, 13th Int. Symp. on Computer Architecture, Tokyo, Japan, june 1986
Thurber, K.J., Wald, L.D., “Associative and Parallel Processors”, Computing Surveys, vol.7, no.4, dec. 1975
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Faudemay, P., Etiemble, D., Bechennec, JL., He, H. (1988). The Database Processor ‘Rapid’. In: Kitsuregawa, M., Tanaka, H. (eds) Database Machines and Knowledge Base Machines. The Kluwer International Series in Engineering and Computer Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1679-4_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1679-4_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8948-7
Online ISBN: 978-1-4613-1679-4
eBook Packages: Springer Book Archive