On consecutive storage of records

  • Janusz Górski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ehrich H.D., Lipski W. On the storage space requirement of consecutive retrieval with redundancy. Inf. Proc. Lett. 4, 1976, 101–104.CrossRefGoogle Scholar
  2. [2]
    Fulkerson D.S., Gross O.A. Incidence matrices and interval graphs. Pacif. Jour. Math. 15, 1965, 835–855.Google Scholar
  3. [3]
    Ghosh S.P. File organization. The consecutive retrieval property. Comm. ACM 15, 1972, 802–808.CrossRefGoogle Scholar
  4. [4]
    Ghosh S.P. On the theory of consecutive storage of relevant records. Inform. Sci. 6, 1973, 1–9.CrossRefGoogle Scholar
  5. [5]
    Ghosh S.P. Consecutive storage of relevant records with redundancy. Comm. ACM 18, 1975, 464–471.CrossRefGoogle Scholar
  6. [6]
    Górski J. An effective algorithm for finding partitions of a given set. To appear.Google Scholar
  7. [7]
    Górski J. Memory organization for effective information retrieval. Doctoral thesis, CC PAS, 1976, Warsaw. In Polish.Google Scholar
  8. [8]
    Kou L.T. Polynomial complete consecutive information retrieval problems. Technical Report TR74-193, Dept. of Comp. Sci., Cornell University, Ithaca, NY, 1974.Google Scholar
  9. [9]
    Kuratowski K., Mostowski A. Set Theory. North Holland, Amsterdam, 1967.Google Scholar
  10. [10]
    Lipski W. Combinatorial aspects of information storage and retrieval. Proc. MFCS 74, Springer-Verlag, Berlin-Heidelberg-New York 1975, 270–279.Google Scholar
  11. [11]
    Lipski W., Marek W. File organization, an application of graph theory. Proc. Collq. Automata, Languages and Progr., Saarbrücken, 1974, 270–279.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Janusz Górski
    • 1
  1. 1.Instytut InformatykiPolitechnika GdańskaGdańskPoland

Personalised recommendations