skip to main content
10.1145/1734714.1734730acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article
Free access

Storage optimization of tree structured files representing descriptor sets

Published: 11 November 1971 Publication History

Abstract

It is shown that the total node requirements for tree structured files can be minimized without significantly affecting the search time. However, search times are determined primarily by type of use, and the particular implementation of tree structured files.
In this paper theoretical results are reported for full and sparse files, and empirical techniques for minimizing total node requirements of tree structured files are given.

References

[1]
Climenson, W. D., File Organization and Search Techniques, Ann. Rev. of Inf. Sci. and Tech., 1, 107 (1966)
[2]
Salton, G., "Automatic Information Organization and Retrieval", McGraw-Hill Book Co., N. Y. (1968)
[3]
deMaine, P. A. D. and Marron, B. A., The SOLID System I. A Method for Organizing and Searching Files, in G. Schecter, ed. "Information Retrieval: A Critical View" (Thompson Book Co., Washington, 1967).
[4]
deMaine, P. A. D. and Chaffee, N. F., File Security in an Information Independent Data Management System, Proc. MIS Copenhagen Conference, October 14--16, 1970.
[5]
deMaine, P. A. D., Chaffee, N. F. and Springer, G. K., Automatic Organization of Files. I. Overview of the SOLID System, (J. IAG in process)
[6]
Springer, G. K., "AGISAR System for Processing Digitized Pictorial Data", Ph.D. Thesis, The Pennsylvania State University (1970).
[7]
Sussenguth, E. H., Jr., Use of Tree Structures for Processing Files, CACM 6(May 1963), 272--279.
[8]
Patt, Y. N., Variable Length Tree Structures Having Minimal Average Search Time, CACM 12 (Feb. 1969), 72--76.
[9]
Fredkin, E., Trie Memory, CACM 3 (Sept. 1960), 490--499.
[10]
Hellerman, H., Addressing Multidimensional Arrays, CACM 5(April 1962), 205--207.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGFIDET '71: Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
November 1971
368 pages
ISBN:9781450373005
DOI:10.1145/1734714
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 November 1971

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)53
  • Downloads (Last 6 weeks)15
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (1996)High-speed tools for Global Information Management I. Information processing and retrievalJournal of Systems Integration10.1007/BF022650876:3(217-240)Online publication date: Aug-1996
  • (1981)Analysis of a heuristic for full trie minimizationACM Transactions on Database Systems10.1145/319587.3196186:3(513-537)Online publication date: 1-Sep-1981
  • (1980)Symbolic Gray Code as a Multikey Hashing FunctionIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.1980.47669762:1(83-90)Online publication date: 1-Jan-1980
  • (1977)Analysis of the Multiple-Attribute-Tree Data-Base OrganizationIEEE Transactions on Software Engineering10.1109/TSE.1977.2311753:6(451-467)Online publication date: 1-Nov-1977
  • (1976)A MUMPS-based Relational Data Base system (MRDB)Proceedings of the 1976 annual conference10.1145/800191.805608(324-328)Online publication date: 20-Oct-1976
  • (1976)Complexity of trie index constructionProceedings of the 17th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1976.11(197-207)Online publication date: 25-Oct-1976

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media