The present book is the second collection of papers of the colloquium mentioned in the review of the first part [see above]. In W. Litwin’s contributions the use of hashing techniques is investigated for addressing data on external memory. Both the load factor and the number of disk accesses are considered. F. Remmen considers an optimal logical data structure for an information system. Here optimal stands for containing a minimal number of relations. Under certain conditions such a structure can be proved unique. In ”A framework for advanced mass storage applications” G. M. Nijssen presents a framework for information systems. This framework is easy to understand for the user, and it enables him to solve problems of efficiency and correctness in an independent way. H. M. Blanken, O. J. J. Broenink, R. Engmann and A. H. Haitsma discuss the design and implementation of ERIS, an experimental relational information system. For the implementation the language SIMULA67 was used. Next, H. M. Blanken gives a discussion of the relational database management system called VIDEBAS, the architecture of which is based upon an inexpensive external memory and a large computation capacity. P. M. G. Apers treats the problem of optimal data allocation in a distributed database. He considers two cost functions: Total transmission cost and average response time. In English a more complete treatment of these issues can be found in Apers’s thesis entitled ”Query processing and data allocation in distributed database systems” (1983; Zbl 0508.68060). M. L. Kersten describes the interactive database facilities of the programming language PLAIN (programming laguage for interaction). Especially the integration of database concepts with programming language concepts and the protection of databases against unwanted access and contents is highlighted. Finally, R. A. C. Thomas gives a classification of distributed database systems and treats a few specific aspects of distribution by means of a distributed version of INGRES.