Skip to main content

A Relational Database Machine for Very Large Information Retrieval Systems

  • Conference paper
Database Machines

Part of the book series: NATO ASI Series ((NATO ASI F,volume 24))

  • 70 Accesses

Abstract

An overview is presented of a new advanced relational database machine (ADAM) for very large information retrieval systems. Novel features of ADAM are as follows.

  1. (1)

    A relation is divided into several parts and stored in general purpose magnetic disks. A parallel access method and a clustering technique based on the extended K-d tree are employed to shorten data transfer time from disks to the main memory.

  2. (2)

    Selection operations are performed at the time of the data transfer by specialized hardware attached to a disk controller. A table based on the finite state machine is used to perform text search of selection operations.

  3. (3)

    The three-phase (filtering, sorting and comparing) join method is used to accelerate join operations. Each phase is performed in parallel by specialized hardware.

The performance of ADAM is two orders higher than that of conventional general purpose computers when applied to very large information retrieval systems. The cost performance is also one order of magnitude better.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.G. Langdon, Jr. et al., “Special Issue on Database Machines”, IEEE Trans. Comput., Vol.C-28 No.6, June 1979

    Google Scholar 

  2. S. Uemura, T. Yuba, A. Kokubu, R. Ohomote and Y. Sugawara, “The Design and Implementation of a Magnetic-Bubble Database Machine”, Proc. IFIP 80, Oct. 1980, pp.433-438

    Google Scholar 

  3. R. Epstein and P. Hawthorn, “Design Decisions for the Intelligent Database Machine”, Proc. NCC 80, May 1980, pp.237-241

    Google Scholar 

  4. Y. Tanaka, “Bit-Sliced VLSI Algorithms for Search and Sort”, Proc. 10th VLDB, Aug. 1984, pp.225-234

    Google Scholar 

  5. G. Miranker, L. Tang and C.K. Wong, “A ‘Zero-Time’ VLSI Sorter”, IBM J. Res. Develop., Vol.27 No.2, Mar. 1983, pp.140–148

    Article  Google Scholar 

  6. K. Kannan, “The Design of a Mass Memory for a Database Computer”, Proc. 5th Comp. Arch., Apr. 1978, pp.44-51

    Google Scholar 

  7. T. Lang, E. Nahouraii, K. Kasuga and E.B. Fernandez, “An Architectural Extension for a Large Database System Incorporating a Processor for Disk Search”, Proc. 3rd VLDB, Oct. 1977, pp.204-210

    Google Scholar 

  8. H.O. Leilich, G. Stiege and H. Ch. Zeidler, “A Search Processor for Data Base Management Systems”, Proc. 4th VLDB, Sept. 1978, pp.280-287

    Google Scholar 

  9. E. Babb, “Implementing a Relational Database by Means of Specialized Hardware”, ACM Trans. DB Syst., Vol.4 No.1, Mar. 1979, pp.1–29

    Article  Google Scholar 

  10. H. Boral and D.J. Dewitt, “Processor Allocation Strategies for Multiprocessor Database Machines”, ACM Trans. DB Syst., Vol.6 No.2, June 1981, pp.227–254

    Article  Google Scholar 

  11. M.W. Blasgen and K.P. Eswaran, “Storage and Access in Relational Data Bases”, IBM Syst. J., Vol.16 No.4, 1977, pp.363–378

    Article  Google Scholar 

  12. R.L. Rivest, “Partial-Match Retrieval Algorithms”, SIAM J. Comput., Vol.5 No.l, Mar. 1976, pp.19–50

    Article  MathSciNet  MATH  Google Scholar 

  13. J. Nievergelt, H. Hinterberger and K.C. Sevcik, “The Grid File: An Adaptable, Symmetric Multikey File Structure”, ACM Trans. DB Syst., Vol.9 No.l, Mar. 1984, pp.38–71

    Article  Google Scholar 

  14. J.M. Chang and K.S. Fu, “Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method”, IEEE Trans. Soft. Engi., Vol.SE-7 No.3, May 1981, pp.284–290

    Article  MathSciNet  Google Scholar 

  15. S. Fushimi, M. Kitsuregawa, H. Tanaka and T. Moto-oka, “Multidimensional Clustering Technique for Large Relational Database Machines”, Proc. Foundations of Data Organization, May 1985, pp.226-235

    Google Scholar 

  16. F.J. Burkowski, “A Hardware Hashing Scheme in the Design of a Multiterm String Comparator”, IEEE Trans. Comput., Vol.C-31 No.9, Sept. 1982, pp.825–834

    Article  Google Scholar 

  17. A. Mukhopadhyay, “Hardware Algorithms for Nonnumeric Computation”, Proc. 5th Comp. Arch., Apr. 1978, pp.8-16

    Google Scholar 

  18. L.A. Hollaar and D.C. Roberts, “Current Research into Specialized Processors for Text Information Retrieval”, Proc. 4th VLDB, Sept. 1978, pp.270-279

    Google Scholar 

  19. L.A. Hollaar, “Text Retrieval Computers”, Computer, Vol.12 No.3, Mar. 1979, pp.40–50

    Article  Google Scholar 

  20. D.R. McGregor, R.G. Thomson and W.N. Dawson, “High Performance Hardware for Database Systems”, in “Systems for Large Data Bases” P.C. Lockemann and E.J. Neuhold(Eds.), North-Holland, 1976, pp.103-116

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inoue, U., Kawazu, S. (1986). A Relational Database Machine for Very Large Information Retrieval Systems. In: Sood, A.K., Qureshi, A.H. (eds) Database Machines. NATO ASI Series, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82937-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82937-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82939-0

  • Online ISBN: 978-3-642-82937-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics