Advertisement

BOLTS: A Retrieval Language for Tree-Structured Data Base Systems

  • W. T. Hardgrave

Abstract

Bolts is A low-level retrieval language for tree-structured data base systems. Bolts consists of several functions that provide the capability to extract nodal information in the form of sets. Those sets of nodes can then be manipulated using the BOLTS counterparts of set union, intersection, and complement. This design overcomes the problems that are inherent in the traditional approach to retrieval using Boolean operations.

Keywords

Terminal Node Data Management System Tree Intersection File Organization Data Base Management 
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

  1. 1.
    CODASYL Systems Committee Technical Report, A Survey of Generalized Data Base Management Systems, The Association of Computing Machinery, New York (May 1969).Google Scholar
  2. 2.
    CODASYL Systems Committee Technical Report, April 71 Report of Data Base Task Group (DBTG), The Association of Computing Machinery, New York (April 1971).Google Scholar
  3. 3.
    R. E. Bleier and A. H. Vorhaus, File Organization in the SDS Time-Shared Data Manage-ment System (TDMS), inIFIP Congress 1968(1968) pp. 1245–1252.Google Scholar
  4. 4.
    J. H. Bloom, Some Techniques and Trade-offs Affecting Large Data Base Retrieval Times, inProc. 24th Nat. Conf ACM(1969), pp. 83–95.Google Scholar
  5. 5.
    R. G. Canning, The Debate on Data Base Management,EDP Analyzer 10(3) (March 1972).Google Scholar
  6. 6.
    N. Chapin, A Comparison of File Organization Techniques, inProc. 24th Nat. Conf. ACM(1969), pp. 273–283.Google Scholar
  7. 7.
    D. L. Childs, Description of a Set-Theoretic Data Structure, inAFIPS Conf. Proc, Vol. 33, Part1(1968), pp. 557–564.Google Scholar
  8. 8.
    C. Cho, Techniques for Storage, Retrieval, and Multi-file Operations for an Information System, in Proc. 6th Ann. Princeton Conf. on Information Science and Systems, Princeton University, Princeton, New Jersey (March 1972 ).Google Scholar
  9. 9.
    W. D. Climenson, File Organization and Search Techniques, inAnn. Rev. Information Science and Technology, Vol. 1, Wiley, New York (1969), pp. 107–136.Google Scholar
  10. 10.
    G. G. Dodd, Elements of the Data Management Systems,Computing Surveys,1(2), 117–133 (June 1969).CrossRefGoogle Scholar
  11. 11.
    G. D. Everett,Data Structure and Algorithmic Determinacy: A Formal Model for the Comparison of Data Management Systems, Ph.D. Diss., Univ. of Texas at Austin, Austin, Texas (August 1971).Google Scholar
  12. 12.
    G. D. Everett, C. W. Dissly, and W. T. Hardgrave, Remote File Management System (RFMS) User’s Manual, (TRM-16), Computation Center, Univ. of Texas at Austin, Austin, Texas (August 1971).Google Scholar
  13. 13.
    F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts (1968).Google Scholar
  14. 14.
    W. T. Hardgrave,Theoretical Aspects of Boolean Operations on Tree Structures and Implications for Generalized Data Management, Ph.D. Diss., TSN-26, Computation Center, Univ. of Texas at Austin, Austin, Texas (August 1972).Google Scholar
  15. 15.
    I. N. Herstein,Topics in Algebra, Blaisdell, Waltham, Massachusetts (1964).Google Scholar
  16. 16.
    D. Hsiao and F. Harary, A Formal System for Information Retrieval from Files,Commun. ACM 13(2), 67–73 (February 1970).CrossRefGoogle Scholar
  17. 17.
    D. E. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Massachusetts (1968).Google Scholar
  18. 18.
    R. R. Korfhage,Logic and Algorithms with Applications to the Computer and Information Sciences, Wiley, New York (1966).Google Scholar
  19. 19.
    D. Lefkovitz,File Structures for On-Line Systems, Spartan, New York (1969).Google Scholar
  20. 20.
    T. C. Lowe, The influence of Data Base Characteristics and Usage on Direct Access File Organization,J. ACM,15(4), 535–548 (October 1968).CrossRefGoogle Scholar
  21. 21.
    E. I. Lowenthal,A Functional Approach to the Design of Storage Structures for Generalized Data Management Systems, Ph.D. Diss., Univ. of Texas at Austin, Austin, Texas (August 1971).Google Scholar
  22. 22.
    V. Y. Lum, Multi-Attribute Retrieval with Combined Indexes,Commun. ACM 13(11), 660–665 (1970).CrossRefGoogle Scholar
  23. 23.
    S. MacLane and G. Birkhoff,Algebra, Macmillan, New York (1968).Google Scholar
  24. 24.
    S. E. Madnick, Design Strategies for File Systems: A Working Model, File Organization, Publ. No. 3,IFIP Administrative Data Processing Group, Amsterdam (1969), pp. 117–136.Google Scholar
  25. 25.
    MARS VI Multi-Access Retrieval System, Reference Manual, Publ. No. 44625500, Control Data Corp., Sunnyvale, California (1970).Google Scholar
  26. 26.
    L. D. Martin, A Model for File Structure Determination for Large On-Line Data Files, in File 68 Int. Seminar on File Organization,IFIP Administrative Data Processing Group(1968), pp. 793–834.Google Scholar
  27. 27.
    W. C. McGee, File Structures for Generalized Data Management, inIFIP Congress1968, The Hague (1968), pp. F68–F73.Google Scholar
  28. 28.
    W. C. McGee, Generalized File Processing,Ann. Rev. of Automatic Programming, Vol. 5, Pergamon (1969), pp. 77–149.Google Scholar
  29. 29.
    E. Mendelson,Introduction to Mathematical Logic, Van Nostrand, Princeton, New Jersey (1964).Google Scholar
  30. 30.
    J. Minker and J. Sable, File Organization and Data Management,Ann. Rev. of Information Science and Technology, Vol. 2, Wiley, New York (1967), 123–160.Google Scholar
  31. 31.
    P. Namian, Algebra of Management Information, inIFIP Congress1968, (1968), pp. 1240–1244.Google Scholar
  32. 32.
    T. W. Olle, Data Structures and Storage Structures for Generalized File Processing, in File 68 Int. Seminar on File Organization,Student Litteratur, Lund, Sweden (1968), pp. 285–292.Google Scholar
  33. 33.
    T. W. Olle, UL/1: A Non-Procedural Language for Retrieving Information from Data Bases, inIFIP Congress1968 ( 1968 ), pp. 572–578.Google Scholar
  34. 34.
    R. G. Parsons, An Adaption of the AIP “Searchable Physics Information Notices” for Use on CDC 6000 Series Computers, (CPT-118), The Center for Particle Theory, Univ. of Texas at Austin, Austin, Texas (1971).Google Scholar
  35. 35.
    F. B. Ray,Directed Graph Structures for Data Base Management: Theory, Storage Structures and Algorithms, Ph.D. Diss. Univ. of Texas at Austin, Austin, Texas (August 1972).Google Scholar
  36. 36.
    Remote File Management System (RFMS) (TSD–7-TSD–13), Computation Center, Univ. of Texas at Austin, Austin, Texas (1968–1970).Google Scholar
  37. 37.
    A. Robinson, Introduction to Model Theory and to the Metamathematics of Algebra, North-Holland, Amsterdam (1963).Google Scholar
  38. 38.
    F. F. Schubert, Basic Concepts in Data Base Management Systems,Datamation 18(7), 427 (1972).Google Scholar
  39. 39.
    A. K. Scidmore and B. L. Weinberg, Storage and Search Properties of a Tree-Organized Memory System,Commun. ACM 6(1), 28–31 (1963).CrossRefGoogle Scholar
  40. 40.
    S. C. Shapiro, The List Set Generator: A Construct for Evaluating Expressions,Commun. ACM,13(12), 741–744 (1970).CrossRefGoogle Scholar
  41. 41.
    D. B. Steig, File Management Systems Revisited,Datamation, 18 (10), 48–51 (1972).Google Scholar
  42. 42.
    E. H. Sussenguth, Use of Tree Structures for Processing Files,Commun. ACM 6(5), 272–279 (1963).CrossRefGoogle Scholar
  43. 43.
    SYSTEM 2000 Data Management System, Reference Manual, MRI Systems Corp., Austin, Texas (Feburary 1972).Google Scholar
  44. 44.
    UCS-VI UN I DAT A Data Management System, Reference Manual, United Computing Systems, Kansas City, Missouri (1970).Google Scholar
  45. 45.
    S. Warshall, On Computational Cost, inAnn. Rev. in Automatic Programming, Vol. 5, Pergamon (1969), pp. 309–330.Google Scholar
  46. 46.
    L. Welke, A Review of File Management Systems,Datamation,18(10) 52–54 (1972).Google Scholar
  47. 47.
    A. J. Winkler,A Methodology for Comparison of File Organization and Processing Procedures for Hierarchical Storage Structures, Ph.D. Diss., Univ. of Texas at Austin, Austin, Texas (May 1970).Google Scholar
  48. 48.
    E. Wong and T. C. Chang, Canonical Structure in Attribute-Based File Organization,Commun. ACM,14(9), 593–597 (1971).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1974

Authors and Affiliations

  • W. T. Hardgrave
    • 1
  1. 1.The University of TennesseeKnoxvilleUSA

Personalised recommendations