Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R. and E. McCreight, ‘Organization and Maintenance of Large Unordered Indices,’ Acta Informatica, vol.1 fasc. 3, pp.173–189, 1972.
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.
Bayer, R., Elhardt, K., Heller, H., and Reiser, A., ‘Distributed Concurrency Control in Database Systems,’ Proc. 6th VLDB, pp.275-284, 1980.
Bayer, R. and Schkolnick, M., ‘Concurrency of Operating on B-Trees,’ Acta Informatica, vol.9 no.1, pp.1–21, 1977.
Bayer, R. and Schlichtiger, P., ‘Data Management Support for Database Management,’ Acta Informatica, vol.21 fasc.l, pp.1–28, 1984.
Bernstein, P.A. and Goodman, N., ‘Multiversion Concurrency Control — Theory and Algorithms,’ ACM Trans. Database Systems, vol.8 no.4, pp.465–483, 1983.
Ellis, CS., ‘Concurrent Search and Insertion in 2–3 Trees,’ TR-78-05-01, Dept. of Computer Science, Univ. of Washington, Seattle, 1977.
‘Haneywell File Management Supervisor,’ Order No.DB54, Honeywell Information Systems, Inc., 1973.
Kedem, Z. and Silberschatz, A., ‘Non-Two Phase Locking Protocols with Shared and Exclusive Locks,’ Proc. VLDB, pp.309-320, 1980.
Kessels, J.L.W., ‘The Readers and Writers Problem Avoided,’ Information Processing Letters, vol.10 no.3, pp.159–162, 1980.
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.
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.
Silberschatz, A. and Kedem, Z., ‘Consistency in Hierarchical Database Systems,’ J.ACM, vol.27 no.1, pp.72-80.
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.
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.
Tanaka, Y., ‘A Data Stream Database Computer,’ Japan Annual Reviews: Computer Science &Technologies 1982, OHM-North-Holland, pp.265-286, 1982.
Tanaka, Y., ‘A Data-Stream Database Machine with Large Capacity,’ Advanced Database Machine Architecture, Prentice-Hall, Inc., pp.168-202, 1983.
Tanaka, Y., ‘Adaptive Segmentation Schemes for Large Relational Database Machines,’ Database Machines, Springer-Verlag, pp.293-318, 1983.
Tanaka, Y., ‘Bit-Sliced VLSI Algorithms for Search and Sort,’ Proc.10th VLDB, pp.225-235, 1984
Tanaka, Y., ‘A Multiport Page-Memory Architecture and A Multiport Disk-Cache System,’ New Generation Computing, vol.2 no.3, pp.241–260, 1984.
Tanaka, Y., ‘MPDC: Massive Parallel Architecture for Very Large Databases,’ Proc. Int’l Conf. on Fifth Generation Computer Systems 1984, pp.113-137, 1984.
Tanaka, Y., ‘A VLSI Algorithm for Sorting Variable-Length Character Strings,’ (to appear in New Generation Computing).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tanaka, Y. (1986). Massive Parallel Database Computer MPDC and Its Control Schemes for Massively Parallel Processing. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-82937-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82939-0
Online ISBN: 978-3-642-82937-6
eBook Packages: Springer Book Archive