10. DATE, C. J., An Introduction to Data Base Systems, Addison-Wesley, Reading, Mass. (1975)

11. SIBLEY, E. H., 'Special Issue: Data base management systems', Computing Surveys, 8, No. I (1976)

12. MARON, M. E., 'Relational data file I: Design philosophy', In: Information Retrieval (Edited by Schecter 6), 211-223 (1967)

13. LEVIEN, R., 'Relational data file Il: Implementation', In: Information Retrieval (Edited by Schecter 6), 225-241(1967)

14. HAYES, R. M. and BECKER, J., Handbook of Data Processing for Libraries, Melville Publishing Co., Los Angeles, California (1974)

15. HSIAO, D., 'A generalized record organization', IEEE Transactions on Computers, C-20, 1490-1495 (1971)

16. MANOLA, F. and HSIAO, D. K., 'A model for keyword based file structures and access', NRL Memorandum Report 2544, Naval Research Laboratory, Washington D.C. (1973)

17. SEVERANCE, D. G., 'A parametric model of alternative file structures', Information Systems, 1, 51-55 (1975)

18. van RIJSBERGEN, C. J., 'File organization in library automation and information retrieval', Journal of Documentation, 32, 294-317 ( 1976)

19. JONKERS, H. L., 'A straightforward and flexible design method for complex data base management systems', Information Storage and Retrieval, 9, 401-415 (1973)

20. FOSTER, J. M., List Processing, Macdonald, London; and American Elsevier Inc., New York ( 1967 )

21. STANFEL, L. E., 'Practical aspect of doubly chained trees for retrieval', Journal of the ACM, 19, 425~36 (1972)

22. STANFEL, L. E., 'Optimal trees for a class of information retrieval problems', Information Storage and Retrieval, 9, 43-59 (1973)

23. PATT, Y. N., Minimum search tree structure for data partitioned into pages', IEEE Transations on Computers, C-21, 961-967 (1972)

24. BERGE, C., The Theory of Graphs and its Applications, Methuen, London (1966)

25. HARARY, F., NORMAN, R. Z. and CARTWRIGHT, D., Structural Models: An Introduction to the Theory of Directed Graphs, Wiley, New York (1966)

26. ORE, 0., Graphs and their Uses, Random House, New York (1963)

27. KNUTH, D. E., The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, Massachusetts (1968)

28. KNUTH, D. E., The Art of Computer Programming, Vol 3, Sorting and Searching, Addison-Wesley, Reading, Massachusetts (1973)

29. MORRIS, R., 'Scatter storage techniques', Communications of the ACM, 11, 35-38 (1968)

30. LUM, V. Y., YUEN, P. S. T. and DODD, M., 'Key-to-address transform techniques: a fundamental performance study on large existing formatted files', Communications of the ACM, 14, 228-239 (1971)

31. BELL, J. K. and KAMAN, C. H., 'The linear quotient hash code', Communications of the ACM, 13, 675-677 ( 1970)

32. MURRAY, D. M., 'A scatter storage scheme for dictionary lookups' In: Report ISR-16 to the National Science Foundation, Section 11, Cornell University, Department of Computer Science (1969)

33. PAGE, E. S. and WILSON, L. B., Information Representation and Manipulation in a Computer, Cambridge University Press, Cambridge (1973)