Massive Parallel Database Computer MPDC and Its Control Schemes for Massively Parallel Processing

  • Y. Tanaka
Part of the NATO ASI Series book series (volume 24)


High-volume processing of databases requires frequent references to a very large storage space, which makes it inevitable to frequently access mechanically-accessed secondary memory devices like moving head disk units.


Concurrency Control Control Subsystem Segment Processing Page Buffer Free Page 
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. Bayer and McCreight 1972.
    Bayer, R. and E. McCreight, ‘Organization and Maintenance of Large Unordered Indices,’ Acta Informatica, vol.1 fasc. 3, pp.173–189, 1972.CrossRefGoogle Scholar
  2. Bayer et al. 1980a
    Bayer, R., Heller, H., and Reiser, A., ‘Parallelism and Recovery in Database Systems,’ ACM Trans. Database Systems, vol.5 no.2, pp.139–156, 1980.MATHCrossRefGoogle Scholar
  3. Bayer et al. 1980b
    Bayer, R., Elhardt, K., Heller, H., and Reiser, A., ‘Distributed Concurrency Control in Database Systems,’ Proc. 6th VLDB, pp.275-284, 1980.Google Scholar
  4. Bayer and Schkolnick 1977.
    Bayer, R. and Schkolnick, M., ‘Concurrency of Operating on B-Trees,’ Acta Informatica, vol.9 no.1, pp.1–21, 1977.MathSciNetMATHCrossRefGoogle Scholar
  5. Bayer and Schlichtiger 1984.
    Bayer, R. and Schlichtiger, P., ‘Data Management Support for Database Management,’ Acta Informatica, vol.21 fasc.l, pp.1–28, 1984.MATHCrossRefGoogle Scholar
  6. Bernstein and Goodman 1983.
    Bernstein, P.A. and Goodman, N., ‘Multiversion Concurrency Control — Theory and Algorithms,’ ACM Trans. Database Systems, vol.8 no.4, pp.465–483, 1983.MathSciNetMATHCrossRefGoogle Scholar
  7. Ellis 1977.
    Ellis, CS., ‘Concurrent Search and Insertion in 2–3 Trees,’ TR-78-05-01, Dept. of Computer Science, Univ. of Washington, Seattle, 1977.Google Scholar
  8. Haneywell 1973.
    ‘Haneywell File Management Supervisor,’ Order No.DB54, Honeywell Information Systems, Inc., 1973.Google Scholar
  9. Kedem and Siberschatz 1980.
    Kedem, Z. and Silberschatz, A., ‘Non-Two Phase Locking Protocols with Shared and Exclusive Locks,’ Proc. VLDB, pp.309-320, 1980.Google Scholar
  10. Kessels 1980.
    Kessels, J.L.W., ‘The Readers and Writers Problem Avoided,’ Information Processing Letters, vol.10 no.3, pp.159–162, 1980.CrossRefGoogle Scholar
  11. Lehman and Yao 1981.
    Lehman, P.L. and Yao, S.B., ‘Efficient Locking for Concurrent Operations on B-Trees,’ ACM Trans. Database Systems, vol.6 no.4, pp.650-670.Google Scholar
  12. Papadimitriou and Kanellakis 1984.
    Papadimitriou, C.H. and Kanellakis, P.C., ‘On Concurrency Control by Multiple Versions,’ ACM Trans. Database Systems, vol.9 no.1, pp.89–99, 1984.MathSciNetMATHCrossRefGoogle Scholar
  13. Silberschatz and Kedem 1980.
    Silberschatz, A. and Kedem, Z., ‘Consistency in Hierarchical Database Systems,’ J.ACM, vol.27 no.1, pp.72-80.Google Scholar
  14. Stearns et al. 1976
    Stearns, R.E., Lewis, P.M. II, and Rosenkrantz, D.J., ‘Concurrency Control for Database Systems,’ Proc. 17th IEEE Symp. Foundations of Computer Science, pp.19-32, 1976.Google Scholar
  15. Tanaka et al. 1980
    Tanaka, Y., Nozaka, Y. and Masuyama, A., Pipeline Searching and Sorting Modules as Components of a Data Flow Database Computer, ‘Proc. IFIP’ 80, pp.427-432, 1980.Google Scholar
  16. Tanaka 1982.
    Tanaka, Y., ‘A Data Stream Database Computer,’ Japan Annual Reviews: Computer Science &Technologies 1982, OHM-North-Holland, pp.265-286, 1982.Google Scholar
  17. Tanaka 1983a.
    Tanaka, Y., ‘A Data-Stream Database Machine with Large Capacity,’ Advanced Database Machine Architecture, Prentice-Hall, Inc., pp.168-202, 1983.Google Scholar
  18. Tanaka 1983b.
    Tanaka, Y., ‘Adaptive Segmentation Schemes for Large Relational Database Machines,’ Database Machines, Springer-Verlag, pp.293-318, 1983.Google Scholar
  19. Tanaka 1984a.
    Tanaka, Y., ‘Bit-Sliced VLSI Algorithms for Search and Sort,’ Proc.10th VLDB, pp.225-235, 1984Google Scholar
  20. Tanaka 1984b.
    Tanaka, Y., ‘A Multiport Page-Memory Architecture and A Multiport Disk-Cache System,’ New Generation Computing, vol.2 no.3, pp.241–260, 1984.CrossRefGoogle Scholar
  21. Tanaka 1984c.
    Tanaka, Y., ‘MPDC: Massive Parallel Architecture for Very Large Databases,’ Proc. Int’l Conf. on Fifth Generation Computer Systems 1984, pp.113-137, 1984.Google Scholar
  22. Tanaka 1985.
    Tanaka, Y., ‘A VLSI Algorithm for Sorting Variable-Length Character Strings,’ (to appear in New Generation Computing).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Y. Tanaka
    • 1
  1. 1.Department of Electrical EngineeringHokkaido UniversitySapporo, 060Japan

Personalised recommendations