Advertisement

A Survey of File Organizations and Performance

  • Ehud Gudes
  • S. Ganesh

Abstract

The importance of information systems in today’s society is well recognized. Their users may vary from government executives and army generals to bank tellers and library patrons. Users’ requirements for an information system may vary significantly, but they all have at least two common goals. That is, they would like to improve performance and reduce cost.

Keywords

File Structure Record Type Binary Search Tree Combine Index File Organization 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Bibliography

  1. 1.
    J. Martin, Computer Data-Base Organization, second edition, Prentice-Hall, Englewood Cliffs, New Jersey (1977).Google Scholar
  2. 2.
    C. J. Date, An Introduction to Database Systems, second edition, Addison-Wesley, Reading Massachusetts (1977).MATHGoogle Scholar
  3. 3.
    J. P. Fry and E. H. Sibley, Evolution of data-base management systems, Comput. Surveys 8(1), 7–42 (1976).MATHCrossRefGoogle Scholar
  4. 4.
    G. Salton, Automatic Information Organization and Retrieval, McGraw-Hill, New York (1968).Google Scholar
  5. 5.
    G. Salton, Dynamic Information and Library Processing, Prentice-Hall, Englewood Cliffs, New Jersey (1975).Google Scholar
  6. 6.
    J. Minker, Information storage and retrieval—a survey and functional description, ACM SIGIR Forum 12(2), (1977).Google Scholar
  7. 7.
    D. M. Ritchie and K. Thompson, The UNIX time-sharing system, Comm. ACM 17(7), 365–375 (1974).CrossRefGoogle Scholar
  8. 8.
    IBM Corp., “Introduction to IBM Direct-Access and Organization Methods,” GC20–1649–9 (March, 1976).Google Scholar
  9. 9.
    D. G. Severance and J. V. Carlis, A practical approach to selecting record access paths, Comput. Surveys 9(4), 259–272 (1977).CrossRefGoogle Scholar
  10. 10.
    G. Weiderhold, Database Design, McGraw-Hill, New York (1977).Google Scholar
  11. 11.
    D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Massachusetts (1973).Google Scholar
  12. 12.
    D. G. Severance and R. Duhne, A practitioner’s guide to addressing algorithms, Comm. ACM 19(6), 314–326 (1976).MATHCrossRefGoogle Scholar
  13. 13.
    D. G. Severance, Identifier search mechanisms: a survey and generalized model, Comput. Surveys 6(3), 175–194 (1974).MATHCrossRefGoogle Scholar
  14. 14.
    J. Van Leeuwen, The complexity of data organization, Mathematical Centre Tracts 81, Computer Science Department, University of Utrecht, Holland, pp. 37–147 (1976).Google Scholar
  15. 15.
    D. C. Roberts, File organization techniques, in “Advances in Computers” Vol. 12 (M. Rubinoff and M. Yovits, eds.), pp. 115–174, Academic Press, New York (1972).Google Scholar
  16. 16.
    R. Bayer and E. McCreight, Organization and maintenance of large ordered indexes, Acta Inform 1(3), 173–189 (1972).CrossRefGoogle Scholar
  17. 17.
    Prime Inc., “primos File System,” MAN 2604, (1977).Google Scholar
  18. 18.
    IBM Corp., “File Design Handbook,” Contract F30602–69-C-0100 (November, 1969).Google Scholar
  19. 19.
    J. Nivergelt, Binary search trees and file organization, Comput. Surveys 6(3), 195–207 (1974).CrossRefGoogle Scholar
  20. 20.
    T. Lang, C. Wood, and E. B. Fernandez, Data-base buffer paging in virtual storage systems, ACM Trans. on Database Systems 2(4), 339–351 (1977).CrossRefGoogle Scholar
  21. 21.
    A. J. Smith, Sequentiality and prefetching in data-base systems, ACM Trans. on Database Systems 3(3), 223–247 (1978).CrossRefGoogle Scholar
  22. 22.
    B. Shneiderman, Jump searching—a fast sequential search technique, Comm. ACM 21(10), 831–834 (1978).MATHCrossRefGoogle Scholar
  23. 23.
    B. Shneiderman, Polynomial search, SoftwarePractice and Experience 3(5), 5–8 (1973).CrossRefGoogle Scholar
  24. 24.
    B. Shneiderman and V. Goodman, Batched searching of sequential and tree structured files, ACM Trans. Database Syst. 1(3), 256–267 (1976).CrossRefGoogle Scholar
  25. 25.
    D. G. Severance and G. M. Lohman, Differential files: their application to the maintenance of large databases, ACM Trans. Database Syst. 1(3), 256–267 (1976).CrossRefGoogle Scholar
  26. 26.
    J. A. Behymer, R. A. Ogilive, and A. G. Merten, Analysis of indexed sequential and direct file organizations, in “ACM SIGMOD Workshop on Data Description, Access and Control,” (1974).Google Scholar
  27. 27.
    R. Morris, Scatter storage techniques, Comm. ACM 11(1), 38–43 (1968).CrossRefGoogle Scholar
  28. 28.
    W. D. Maurer and T. G. Lewis, Hash table methods, Comput. Surveys 7(1), 5–19 (1975).MATHCrossRefGoogle Scholar
  29. 29.
    V. Y. Lum, General performance analysis of key to address transformation methods using an abstract file concept, Comm. ACM 16(10), 603–612 (1973).MATHCrossRefGoogle Scholar
  30. 30.
    W. P. Heising, Note on random access techniques, IBM Systems J., 2 112–116 (1963).CrossRefGoogle Scholar
  31. 31.
    G. Lyon, Packed scatter tables, Comm. ACM 21(10), 857–865 (1978).MATHCrossRefGoogle Scholar
  32. 32.
    G. H. Gonnet and J. I. Munro, The analysis of an improved hashing technique, in Proc. of SIGACT conference, p. 113 (1977).Google Scholar
  33. 33.
    J. K. Hughes, PL/I Programming, Wiley, New York (1973).MATHGoogle Scholar
  34. 34.
    N. Chapin, A comparison of file organization techniques, in Proc. 24th A CM National Conference, pp. 273–283 (1969).CrossRefGoogle Scholar
  35. 35.
    K. J. McDonell and A. Y. Montgomery, The design of indexed sequential files, Austral. Comput. J. 5(3) (1973).Google Scholar
  36. 36.
    F. T. Coyle, The hidden speed of ISAM, Datamation 17(2) (June 15, 1971).Google Scholar
  37. 37.
    B. Shneiderman, Optimum data base reorganization points, Comm. ACM 16(6), 362–365 (1973).MATHCrossRefGoogle Scholar
  38. 38.
    J. K. Mullin, An improved indexed sequential access method using hashed overflow, Comm. ACM 15(5), 301–307 (1972).MATHCrossRefGoogle Scholar
  39. 39.
    B. Shneiderman, A model for optimizing indexed file structures, Internat. J. Comput. and Inform. Sci. 3(2), 167–188 (1974).CrossRefGoogle Scholar
  40. 40.
    D. Comer and R. Sethi, The complexity of trie index construction,J. Assoc. Comput. Mach. 24(3), 1977, pp. 428–440.MathSciNetMATHCrossRefGoogle Scholar
  41. 41.
    P. D. deMaine and D. E. Whitten, Automatic organization of files, joblist Language, Management Datamatics 4(2), 1975, pp. 31–47.Google Scholar
  42. 42.
    P. D. deMaine and D. E. Whitten, Design for a distributed information network, Advances in Information Syst. Sci. 7, Plenum, New York (1979).Google Scholar
  43. 43.
    S. H. Zweben and M. A. McDonald, An optimal method for deletions in one-sided height-balanced trees, Comm. ACM 21(6), 441–445 (1978).MathSciNetMATHCrossRefGoogle Scholar
  44. 44.
    O. Nevalainen and M. Vesterinen, Determining blocking factors for sequential files by heuristic methods, Computer J. 20(3), 245–247 (1977).MATHCrossRefGoogle Scholar
  45. 45.
    S. R. Driscoll and E. Y. Lion, A selective traversal algorithms in binary search trees, Comm. ACM 21(6), 445–447 (1978).MATHCrossRefGoogle Scholar
  46. 46.
    R. Muntz and R. Uzgalis, Dynamic storage allocation for binary search trees in a two-level memory, in Proc. 4th Annual Princeton Conf, Princeton, New Jersey pp. 345–349 (1970).Google Scholar
  47. 47.
    IBM Corp., “OS/VS Virtual Storage Access Method (VSAM) Planning Guide,” GC26–3799–2, June 1973.Google Scholar
  48. 48.
    IBM Corp., “OS/VS Virtual Storage Access Method (VSAM) Programmer’s Guide,” GC26–3838–2, April 1976.Google Scholar
  49. 49.
    IBM Corp., “OS/VS2 Virtual Storage Access Method (VSAM) Logic,” SY26–3825.Google Scholar
  50. 50.
    T. N. Hibbard, Some combinatorial properties of certain trees with applications to searching and sorting, J. Assoc. Comput. Mach. 9(1), 13–28 (1962).MathSciNetMATHCrossRefGoogle Scholar
  51. 51.
    W. I. Landauer, The balanced tree and its utilization in information retrieval, IEEE Trans. Elec. Computers EC-12(5) 863–871 (1963).CrossRefGoogle Scholar
  52. 52.
    A. Yao, On random 2–3 trees, Acta Inform. 9 159–170 (1978).MATHCrossRefGoogle Scholar
  53. 53.
    D. E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms (2nd. edition) Addison-Wesley, Reading, Massachusetts (1973).Google Scholar
  54. 54.
    H. Wedekind, On the selection of access paths in a data base system, in Data Base Management, North-Holland, New York, pp. 385–397 (1974).Google Scholar
  55. 55.
    R. Bayer, Binary B-trees for virtual memory, in Proc. ACM SIGFIDET Workshop, pp. 219–235 (November, 1971).Google Scholar
  56. 56.
    R. Bayer, Symmetric binary B-trees: data structure and maintenance algorithms, Acta Inform. 1(4), 290–306 (1972).MathSciNetMATHCrossRefGoogle Scholar
  57. 57.
    R. Bayer and K. Unterauer, Prefix B-trees, ACM Trans. Database Syst. 2(1), 11–26. (1977).CrossRefGoogle Scholar
  58. 58.
    N. K. Krishnan, “On the Reorganization of B-Trees,” Master’s thesis, Computer Science Dept., The Pennsylvania State U. (1979).Google Scholar
  59. 59.
    M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, K. P. Eswaran, J. N. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson, System R: relational approach to database management, ACM Trans. Database Syst. 1(2), 97–137 (1976).CrossRefGoogle Scholar
  60. 60.
    M. Stonebraker, E. Wong, P. Kreps, and G. Held, The design and implementation of INGRES, ACM Trans. Database Syst. 1(3), 189–222 (1976).CrossRefGoogle Scholar
  61. 61.
    R. Bayer and M. Schkolnick, Concurrency of operations in B-trees, Acta Inform. 9(1), 1–21 (1978).MathSciNetGoogle Scholar
  62. 62.
    J. Spirn and S. Tsur, “Memory Management for B-Trees,” Report No. CS-79–31, Computer Science Dept. The Pennsylvania State U. (1979).Google Scholar
  63. 63.
    D. G. Keehn and J. O. Lacy, VSAM data set design parameters, IBM Systems J. 13(3), 186–212(1974).CrossRefGoogle Scholar
  64. 64.
    K. Maruyama and S. E. Smith, Analysis and design alternatives for virtual memory indexes, Comm. ACM 20(4), 245–253 (1977).MATHCrossRefGoogle Scholar
  65. 65.
    R. E. Wagner, Indexing design considerations, IBM Systems J. 12(4), 351–367 (1973).MATHCrossRefGoogle Scholar
  66. 66.
    . E. M. McCreight, Pagination of B*-trees with variable length records, Comm. ACM 20(9), 670–674 (1977).CrossRefGoogle Scholar
  67. 67.
    K. Maruyama and S. E. Smith, Optimal reorganization of distributed space disk files, Comm. ACM 19(11), 634–642 (1976).MATHCrossRefGoogle Scholar
  68. 68.
    IBM Corp., “Formatted File Organization Techniques,” Final Report, Contract No. AF30602–69-C-0097, Information Sciences Department, IBM Research, San Jose, California (March, 1970).Google Scholar
  69. 69.
    A. Reiter, Some experiments in directory organization—a simulation study, in Proc. of the Int. Symp. on Computer Performance, Cambridge, Massachusetts, pp. 1–9 (March, 1976).Google Scholar
  70. 70.
    A. Reiter, “A Study of Buffer Management Policies for Data Management Systems,” Technical Report No. 1619, Mathematics Research Center, U. of Wisconsin, Madison, (1976).Google Scholar
  71. 71.
    S. B. Yao, An attribute based model for database access cost analysis, ACM Trans. Database Syst. 2(1), 45–67 (1977).CrossRefGoogle Scholar
  72. 72.
    A. F. Cardenas, Analysis and performance of inverted data base structures. Comm. ACM 18 253–263 (1975).MATHCrossRefGoogle Scholar
  73. 73.
    D. Lefkovitz, File Structures for On-Line Systems, Spartan Books, New York (1969).Google Scholar
  74. 74.
    T. C. Lowe, The influence of data base characteristics and usage on direct access file organization,J. Assoc. Comput. Mach. 15(4), 535–548 (1968).CrossRefGoogle Scholar
  75. 75.
    L. R. Johnson, An Indirect Chaining method for addressing on secondary keys, Comm. ACM 4(5), 218–222 (1961).MATHCrossRefGoogle Scholar
  76. 76.
    A. J. Perlis and C. Thornton, Symbol manipulation by threaded lists, Comm. ACM 3, 195–204 (1960).CrossRefGoogle Scholar
  77. 77.
    J. Weizenbaum, Knotted list structure, Comm. ACM 5(3), 161–165 (1962).CrossRefGoogle Scholar
  78. 78.
    D. K. Hsiao and F. Harary, A formal system for information retrieval from files, Comm. ACM 13(2), 67–73 (1970) Corrigenda: Comm. ACM 13(4), 266 (1970).Google Scholar
  79. 79.
    M. R. Vose and J. S. Richardson, An approach to inverted index maintenance, Computer Bulletin 16(5), 256–262 (1972).Google Scholar
  80. 80.
    J. Inglis, Inverted indexes and multi-list structures, Comput. J. 17(1), 59–63 (1974).CrossRefGoogle Scholar
  81. 81.
    J. W. S. Liu, Algorithms for parsing search queries in systems with inverted file organization, ACM Trans. Database Syst. 1(4), 299–316 (1976).CrossRefGoogle Scholar
  82. 82.
    N. S. Prywes and J. H. Gray, The organization of a multilist-type associative memory, IEEE Trans. Comm. and Elec. 82, 488–492 (1963).Google Scholar
  83. 83.
    J. W. Welch and J. W. Graham, Retrieval using ordered lists in inverted and multilist files, in Proc. of 1976 ACM-SIGMOD Conference, Washington D.C. (1976).Google Scholar
  84. 84.
    F. Manola and D. Hsiao, “A Model for Keyword Based File Structures and Access,” NRL Memo Report 2544 (January, 1973).Google Scholar
  85. 85.
    D. K. Hsiao, Systems Programming. Concepts of Operating and Data Base Systems, Addison-Wesley, Reading, Massachusetts, pp. 262–295 (1975).MATHGoogle Scholar
  86. 86.
    E. Wong and T. C. Chiang, Canonical structure in attribute based file organization, Comm. ACM 14(9), 593–597 (1971).MATHCrossRefGoogle Scholar
  87. 87.
    J. L. Weldon and S. B. Navathe, An attribute-based file organization for a relational database, in Proc. ACM 1976 Annual Conf., pp. 319–323 (October, 1976).CrossRefGoogle Scholar
  88. 88.
    J. B. Rothnie and T. Lozano, Attribute based file organization in a paged memory environment, Comm. ACM 17(2), 63–69 (1974).CrossRefGoogle Scholar
  89. 89.
    V. Y. Lum, Multi-attribute retrieval with combined indexes, Comm. ACM 13(11), 660–665 (1970).CrossRefGoogle Scholar
  90. 90.
    B. Shneiderman, Reduced combined indexes for efficient multiple attribute retrieval, Inform. Systems 2, 149–154 (1977).CrossRefGoogle Scholar
  91. 91.
    E. H. Sussenguth Jr., Use of tree structures for processing files, Comm. ACM 6(5), 272–279 (1963).CrossRefGoogle Scholar
  92. 92.
    Y. Patt, Variable length tree structures having minimum average search time, Comm. ACM 12(2), 72–76 (1969).MathSciNetMATHCrossRefGoogle Scholar
  93. 93.
    L. E. Stanfel, Tree structures for optimal searching,J. Assoc. Comput. Mach. 17(3), 508–517 (1970).MathSciNetMATHCrossRefGoogle Scholar
  94. 94.
    A. F. Cardenas and J. P. Sagamang, Doubly-chained tree data base organization-analysis and design strategies, The Comput. J. 20(1), 15–26 (1977).MATHCrossRefGoogle Scholar
  95. 95.
    R. L. Rivest, Partial match retrieval algorithms, SIAM J. Comput. 5(1), 19–50 (1976).MathSciNetMATHCrossRefGoogle Scholar
  96. 96.
    J. D. Gabbe, T. B. Linden, R. E. Miller, and J. D. Beyer, Applications of Superimposed Coding to Partial-Match Retrieval, in Proc. Second Computer Software and Application Conference (compsac), pp. 464–469 (1978).CrossRefGoogle Scholar
  97. 97.
    W. A. Burkhard, Hasing and trie algorithms for partial match retrieval, ACM Trans. Database Syst. 1(2), 175–187 (1976).CrossRefGoogle Scholar
  98. 98.
    J. L. Bentley, Multidimensional binary search trees used for associative searching, Comm. ACM 18(9), 509–516 (1975).MathSciNetMATHCrossRefGoogle Scholar
  99. 99.
    R. L. Kashyap, S. K. C. Subas, and S. B. Yao, Analysis of the multiple-attribute data base organization, IEEE Trans. Software Engrg. 3(6), 451–475 (1977).CrossRefGoogle Scholar
  100. 100.
    A. Bolour, Optimality properties of multiple-way hashing functions,J. Assoc. Comput. Mach. J. of the ACM 26(2), 196–210 (1979).MathSciNetMATHCrossRefGoogle Scholar
  101. 101.
    W. C. Lin, R. C. T. Lee, and H. C. Du, Common properties of some multiattribute file systems, IEEE Trans. Software Engrg. 5(2), 160–174 (1979).MathSciNetCrossRefGoogle Scholar
  102. 102.
    R. C. Bose and G. G. Koch, The design of combinatorial information retrieval systems for files with multiple-valued attributes, SIAM J. Appl. Math. 17(6), 1203–1214 (1969).MathSciNetMATHCrossRefGoogle Scholar
  103. 103.
    S. P. Ghosh, File organization: the consecutive retrieval property, Comm. ACM 15(9), 802–808 (1972).MATHCrossRefGoogle Scholar
  104. 104.
    S. P. Ghosh, Consecutive storage of relevant records with redundancy, Comm. ACM 18(8), 464–471 (1975)MathSciNetMATHCrossRefGoogle Scholar
  105. 105.
    H. D. Ehrlich and W. Lipski Jr., On the storage space requirement of consecutive-retrieval with redundancy, Inform. Process. Lett. 4(4), 101–104 (1976).CrossRefGoogle Scholar
  106. 106.
    A. F. Cardenas, Evaluation and selection of file organization—a model and system. Comm. ACM 16(9), 540–548 (1973).CrossRefGoogle Scholar
  107. 107.
    D. R. Davis and A. D. Lin, Secondary key retrieval using an IBM 7090–1301 system, Comm. ACM 8(4), 243–246 (1965).CrossRefGoogle Scholar
  108. 108.
    S. B. Yao, Approximating block accesses in database organizations, Comm. ACM 20(4), 260–261 (1977).MATHCrossRefGoogle Scholar
  109. 109.
    S. Ganesh, Secondary Key Organizations: A Survey and Performance Analysis, Master’s thesis, Computer Science Dept., The Pennsylvania State U. (August, 1977).Google Scholar
  110. 110.
    A. J. Bayes, Retrieval timing for a packed direct access inverted file. Comm. ACM 12(10), 582–583 (1969).MathSciNetCrossRefGoogle Scholar
  111. 111.
    K. F. Siler, A stochastic evaluation model for database organizations in data retrieval systems, Comm. ACM 19(2), 84–95 (1976).MATHCrossRefGoogle Scholar
  112. 112.
    K. J. McDonell, The design of associative key lists (secondary indices), Austral. Comput. J. 8(1), 13–18 (1976).Google Scholar
  113. 113.
    K. J. McDonell, An inverted index implementation. The Comput. J. 20(2), 116–123 (1977).CrossRefGoogle Scholar
  114. 114.
    S. B. Yao, Modeling and performance evaluation of physical data base structures, in Proc. ACM 1976 Annual Conf, pp. 303–309 (October, 1976).CrossRefGoogle Scholar
  115. 115.
    J. K. Mullin, Retrieval-update speed tradeoffs using combined indices, Comm. ACM 14(12), 775–776 (1971).CrossRefGoogle Scholar
  116. 116.
    M. Stonebraker, Retrieval efficiency using combined indices, in Proc. 1972 ACM-SIGFIDET Workshop, pp. 243–256 (1972).CrossRefGoogle Scholar
  117. 117.
    F. P. Palermo, “A Quantitative Approach to the Selection of Secondary Indexes,” IBM Research Report on Formatted File Organization Techniques, Contract AF30602–69-C-0097, pp. II-1-II-12 (March, 1970).Google Scholar
  118. 118.
    M. Stonebraker, The choice of partial inversion and combined indices, Internat. J. Comput. Inform. Sci. 3(2), 167–188 (1974).MATHCrossRefGoogle Scholar
  119. 119.
    P. C. Yue and C. K. Wong, Storage cost considerations in secondary index selection, Internat. J. Comput. Inform. Sci. 4(4), 307–327 (1975).MATHCrossRefGoogle Scholar
  120. 120.
    H. D. Anderson and P. B. Berra, Minimum cost selection of secondary indexes for formatted files, ACM Trans. Database Syst. 2(1), 68–90 (1977).CrossRefGoogle Scholar
  121. 121.
    M. Schkolnick, Secondary index optimization, in Proc. ACM-SIGMOD International Conference on Management of Data, San Jose, pp. 186–192 (1975).Google Scholar
  122. 122.
    D. Comer, The difficulty of optimum index selection, ACM Trans. on Database Systems 3(4), 440–445 (1978).CrossRefGoogle Scholar
  123. 123.
    M. Hammer and A. Chan, Index selection in a self-adaptive data base management system, in Proc. of ACM-SIGMOD Conference, Washington, D.C., pp. 1–8 (1976).Google Scholar
  124. 124.
    Battele Columbus Laboratories, “A Capabilities Description of basis,” (1976).Google Scholar
  125. 125.
    J. T. Tou, R. W. DePree, and P. B. Lin, Telebrowsing of science information via a minicomputer, in Current Research in Scientific and Technical Information Transfer, Jeffrey Norton Publishers, New York (1977).Google Scholar
  126. 126.
    J. T. Tou and R. W. DePree, Telebrowsing system and its applications, in Proc. of the European Computing Congress, London, England (1978).Google Scholar
  127. 127.
    J. T. Tou and R. W. DePree, Medical consultation via telebrowsing, in Proc. of International Conference in Medical Computing, Berlin (1979).Google Scholar
  128. 128.
    IBM Corp., “Information Management System/Virtual Storage (IMS/VS), General Information Manual,” GC20–1260–3 (1975).Google Scholar
  129. 129.
    Codasyl, “Database Task Group Report” (April, 1971).Google Scholar
  130. 130.
    Cullinane Corp., “Integrated Database Management System, Program and Reference” (1975).Google Scholar
  131. 131.
    Sperry Rand Corp., “univac 1100 Series, Data Management System (DMS/1100) Schema Definition, Data Administrator Reference” (1973).Google Scholar
  132. 132.
    J. P. Malmquist, E. Gudes, and E. L. Robertson, Storage allocation for access path minimization in network structured data bases, in Data Bases: Improving Usability and Responsiveness, pp. 319–340, Academic Press, New York (1978).Google Scholar
  133. 133.
    M. M. Zloof, “Query by Example; Operations on Hirarchical Data Bases,” IBM Research Report, RC 5491 (June, 1975).Google Scholar
  134. 134.
    T. Haerder, Implementing generalized access path structure for a relational database system, ACM Trans. Database Syst. 3(3), 285–298 (1978).CrossRefGoogle Scholar
  135. 135.
    A. Reiter and E. H. Sibley, “Simulation and Data Administration,” Report No. 22, Information Systems Management Dept., U. of Maryland (1977).Google Scholar
  136. 136.
    T. L. DeLutis and J. D. Smith, “ipss/dbms: A Simulator for Data Base Management Systems,” Technical Report, Dept. of Computer and Info. Science, The Ohio State University (1977).Google Scholar
  137. 137.
    P. Hawthorn and M. Stonebraker, Performance analysis of relational data base management system, in Proc. of SIGMOD 1979, Boston, pp. 1–12 (1979).CrossRefGoogle Scholar
  138. 138.
    K. B. Irani and N. Lin, Quering network models for concurrent transaction processing in database system, in Proc. of SIGMOD 1979, Boston, pp. 134–142 (1979).CrossRefGoogle Scholar
  139. 139.
    J. P. Hayes, Computer Architecture and Organization, McGraw-Hill, New York (1978).MATHGoogle Scholar
  140. 140.
    D. K. Hsiao, Data base machines are coming, data base machines are coming!, Computer 12(3), 7–10 (1979).CrossRefGoogle Scholar
  141. 141.
    S. Y. W. Su, Cellular-logic devices: concepts and applications, Computer 12(3), 11–27 (1979).CrossRefGoogle Scholar
  142. 142.
    S. Y. W. Su and G. J. Lipski, cassm: A cellular system for very large data bases, in Proc. International Conf. on Very Large Data Bases, pp. 456–472 (September, 1975).Google Scholar
  143. 143.
    E. A. Ozkanahan and S. A Schuster, RAP—an associative processor for data base management, in Proc. of NCC 1975, pp. 370–387 (1975).Google Scholar
  144. 144.
    B. P. Berra and F. Oliver, The role of associative array processors in data base machine architecture, Computer 12(3), 53–63 (1979).CrossRefGoogle Scholar
  145. 145.
    D. S. Kerr, Data base machines with large content-addressable blocks and structured information processors, Computer 12(3), 64–80 (1979).CrossRefGoogle Scholar
  146. 146.
    J. Banerjee, R. Baum, and D. K. Hsiao, Concepts and capabilities of a database computer, ACM Trans. on Database Systems 3(4), 347–384 (1978).CrossRefGoogle Scholar
  147. 147.
    L. A. Hollaar, Specialized merge processor network for combining sorted lists, ACM Trans. on Database Systems 3(3), 272–284 (1978).CrossRefGoogle Scholar
  148. 148.
    L. A. Hollaar, Text retrieval computers, Computer 12(3), 40–52 (1979).CrossRefGoogle Scholar
  149. 149.
    J. T. Tou, Design of a medical system for diagnostic consultation and clinical decision-making, Proceedings of the 1978 International Computer Symposium, Taiwan, Republic of China, 80–98 (1978).Google Scholar
  150. 150.
    T. J. Teorey and K. S. Das, Application of an analytic model to evaluate storage structures, Proc. ACM-SIGMOD Conference, Washington, D.C., pp. 9–20 (1976).Google Scholar
  151. 151.
    A. L. Rosenberg and L. Snyder, Compact B-Trees, Proc. ACM-SIGMOD Conference, Boston, pp. 43–51 (1979).Google Scholar

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • Ehud Gudes
    • 1
  • S. Ganesh
    • 1
  1. 1.Computer Science DepartmentThe Pennsylvania State UniversityUniversity ParkUSA

Personalised recommendations