A Relational Database Machine for Very Large Information Retrieval Systems

  • Ushio Inoue
  • Seiichi Kawazu
Conference paper
Part of the NATO ASI Series book series (volume 24)


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.


Main Memory Finite State Machine Random Access Memory Selection Operation Text Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.G. Langdon, Jr. et al., “Special Issue on Database Machines”, IEEE Trans. Comput., Vol.C-28 No.6, June 1979Google Scholar
  2. [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-438Google Scholar
  3. [3]
    R. Epstein and P. Hawthorn, “Design Decisions for the Intelligent Database Machine”, Proc. NCC 80, May 1980, pp.237-241Google Scholar
  4. [4]
    Y. Tanaka, “Bit-Sliced VLSI Algorithms for Search and Sort”, Proc. 10th VLDB, Aug. 1984, pp.225-234Google Scholar
  5. [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–148CrossRefGoogle Scholar
  6. [6]
    K. Kannan, “The Design of a Mass Memory for a Database Computer”, Proc. 5th Comp. Arch., Apr. 1978, pp.44-51Google Scholar
  7. [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-210Google Scholar
  8. [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-287Google Scholar
  9. [9]
    E. Babb, “Implementing a Relational Database by Means of Specialized Hardware”, ACM Trans. DB Syst., Vol.4 No.1, Mar. 1979, pp.1–29CrossRefGoogle Scholar
  10. [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–254CrossRefGoogle Scholar
  11. [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–378CrossRefGoogle Scholar
  12. [12]
    R.L. Rivest, “Partial-Match Retrieval Algorithms”, SIAM J. Comput., Vol.5 No.l, Mar. 1976, pp.19–50MathSciNetMATHCrossRefGoogle Scholar
  13. [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–71CrossRefGoogle Scholar
  14. [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–290MathSciNetCrossRefGoogle Scholar
  15. [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-235Google Scholar
  16. [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–834CrossRefGoogle Scholar
  17. [17]
    A. Mukhopadhyay, “Hardware Algorithms for Nonnumeric Computation”, Proc. 5th Comp. Arch., Apr. 1978, pp.8-16Google Scholar
  18. [18]
    L.A. Hollaar and D.C. Roberts, “Current Research into Specialized Processors for Text Information Retrieval”, Proc. 4th VLDB, Sept. 1978, pp.270-279Google Scholar
  19. [19]
    L.A. Hollaar, “Text Retrieval Computers”, Computer, Vol.12 No.3, Mar. 1979, pp.40–50CrossRefGoogle Scholar
  20. [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-116Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ushio Inoue
    • 1
  • Seiichi Kawazu
    • 1
  1. 1.Yokosuka Electrical Communication LaboratoriesNippon Telegraph and Telephone CorporationJapan

Personalised recommendations