Skip to main content
SpringerLink
Log in

A model for optimizing indexed file structures

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

Multilevel indexes have long been used for accessing records in sorted files. Given the access cost at each level, the total cost of retrieving a record from the file can be substantially reduced by selecting the proper size of the index at each level. Organizations involving a variable number of levels are covered and binary searching is compared to sequential searching.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ivan Flores,Data Structure and Management (Prentice-Hall, Englewood Cliffs, New Jersey, 1970).

    Google Scholar 

  2. David Lefkovitz,File Structures for On-Line Systems (Spartan Books, New York, 1969).

    Google Scholar 

  3. Gerard Salton,Automatic Information Organization and Retrieval (McGraw-Hill, New York, 1968).

    Google Scholar 

  4. George Dodd, “Elements of data management systems,”Computing Surveys 1(2):177–133 (1969).

    Google Scholar 

  5. D. L. Childs, “Feasibility of a set-theoretic data structure,” inProc. IFIP Congress 1968 (North-Holland, Amsterdam), Vol. 1, pp. 420–430.

  6. E. F. Codd, “A relational model of data for large shared data banks,”Commun. ACM 13(6):377–387 (1970).

    Google Scholar 

  7. A. C. Fleck, “Towards a theory of data structures,”J. Computer System Sci. 5:475–488 (1971).

    Google Scholar 

  8. Arnold Rosenberg, “Data graphs and addressing schemes,”J. Computer System Sci. 5:193–238 (1971).

    Google Scholar 

  9. Arnold Rosenberg, “Symmetries in data graphs,”SIAM J. Computing 1:40–65 (1972).

    Google Scholar 

  10. Arnold Rosenberg, “Addressable data graphs,”J. ACM 19:309–340 (1972).

    Google Scholar 

  11. D. Hsaio and F. Harary, “A formal system for information retrieval from files,”ACM 13(2):67–73 (1970).

    Google Scholar 

  12. Jay Earley, “Toward an understanding of data structures,”ACM 14(10):617–627 (1971).

    Google Scholar 

  13. Jack Heller and Ben Shneiderman, “A graph theoretic model of data structures,”SIGIR Forum, Vol. 111, No. 4, Winter 1972.

  14. Ben Shneiderman, “Data Structures: Description, Manipulation and Evaluation,” Ph.D. Thesis, State University of New York at Stony Brook, 1973.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indiana University, Bloomington, Indiana

    Ben Shneiderman

Authors
  1. Ben Shneiderman
    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

Shneiderman, B. A model for optimizing indexed file structures. International Journal of Computer and Information Sciences 3, 91–101 (1974). https://doi.org/10.1007/BF01355589

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation