Some filing schemes based on finite groups of automorphisms | Computing Skip to main content
Springer Nature Link
Log in

Some filing schemes based on finite groups of automorphisms

Speicherplatzorganisation mit Hilfe endlicher Automorphismengruppen

  • Published:
Computing Aims and scope Submit manuscript

Abstract

From some families of partialt-designs which have automorphism groups of high transitivity new algebro-algorithmical filing systems permittingt-queries are constructed. Due to the computational properties of the groups used, new bounds for the retrieval times are obtained in several cases.

Zusammenfassung

Ausgehend voneinigen Familien partiellert-designs, die Automorphismengruppen hoher Transitivität besitzen, werden neue algebro-arithmetische Adressierverfahren fürt-fache Abfragen entwickelt. Aus der arithmetischen Struktur der zugrundeliegenden Gruppen ergeben sich neue Schranken für die Abrufzeiten.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Abraham, C. T., Gosh, S. P., Ray-Chaudhuri, D. K.: File organisations based on finite Geometries. Research Report RC 1459, IBM Watson Research Centre, Yorktown Heights, N.Y., 1965.

    Google Scholar 

  2. Alltop, W. O.: An infinite class of 5-designs. Journal Comb. Th.A 12, 390–395 (1972).

    Article  Google Scholar 

  3. Beth, Th.: Algebraische Auflösungsalgorithmen für einige unendliche Familien von 3-Designs. Le Matematiche29, Fasc. 1 (1974).

  4. Bose, R. C.: Mathematical theory of the symmetrical factorial designs. Sankhya8, 107–166 (1947).

    Google Scholar 

  5. Bose, R. C., Koch, G. G.: The design of combinatorial information retrieval systems for files with multiple valued attributes. SIAM J. Appl. Math.17 (1969).

  6. Bucholz, W.: File organisation and addressing. IBM Systems Journal2, 86–111 (1963).

    Google Scholar 

  7. Carmichael, R. D.: Introduction to the theory of groups of finite order. Dover 1956.

  8. Ray-Chaudhuri, D. K.: Combinatorial retrieval systems for files. SIAM Journal Appl. Math.16 (1968).

  9. Reichertz, P. L.: Medizinische Informatik: Aufgaben, Wege, Bedeutung. Verhandlung deutscher Naturforscher und Ärzte1972, 106–120.

  10. Sumiyasu Yamamoto, Hideto Ikeda, Shinsei Shige-Eda, Kazuhiko Ushio, Noboru Hamada: Design of a new balanced file organisation scheme with the least redundancy. Information and Control28, 156–175 (1975).

    Article  Google Scholar 

  11. van Lint, J. H.: Coding theory (Lecture notes in mathematics, Vol. 201.) Berlin-Heidelberg-New York: Springer 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Maschinen und Datenverarbeitung I, Universität Erlangen-Nürnberg, Martensstraße 3, D-8520, Erlangen, Federal Republic of Germany

    Th. Beth &  K. S. Vijayan

Authors
  1. Th. Beth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. S. Vijayan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beth, T., Vijayan, K.S. Some filing schemes based on finite groups of automorphisms. Computing 20, 95–108 (1978). https://doi.org/10.1007/BF02252340

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02252340

Keywords

Search

Navigation