ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A search path selection algorithm for the Data Independent Accessing Model (DIAM)
Full text PdfPdf (938 KB)
Source International Conference on Management of Data archive
Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control table of contents
Ann Arbor, Michigan
Pages: 367 - 388  
Year of Publication: 1974
Authors
M. M. Astrahan
S. P. Ghosh
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 9,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800296.811521
What is a DOI?

ABSTRACT

The Data Independent Accessing Model (DIAM) provides great flexibility in specification of access paths to data. When a query is expressed in a Representation Independent Language (RIL), the problem arises of finding the relevant access paths and choosing the best ones for the query. A heuristic algorithm is described for finding the paths and making the choice.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CODASYL, "Data Base Task Group Report" ACM HQ Oct. 1969.
 
2
Fehder, P.L., "The Representation-Independent Language Part 1: Introduction and the subsetting operation, IBM Research Report No. RJ 1121, 1972.
3
M. M. Astrahan , E. B. Altman , P. L. Fehder , M. E. Senko, Concepts of a Data Independent Accessing Model, Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control, p.349-362, January 1972  [doi>10.1145/800295.811497]
4
E. B. Altman , M. M. Astrahan , P. L. Fehder , M. E. Senko, Specifications in a Data Independent Accessing Model, Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control, p.363-382, January 1972  [doi>10.1145/800295.811498]
 
5
Senko, M.E., Altman, E.B., Astrahan, M.M. and Fehder, P.L., "Data Structures and Accessing in Data Base System", IBM Systems Journal Vol. 12, No. 1, pp. 30-93, 1973.
 
6
Ghosh, S.P. and Senko, M.E., "On the Analysis of Search Procedures in an Information Retrieval System Based on String Paths," IBM Research Report No. RJ 1140, 1972.
 
7
Ghosh, S.P. and Astrahan, M.M., "A Translator Optimizer for Obtaining Answers to Entity Set Queries from an Arbitrary Access Path Network", IBM Research Report NO. RJ 1282, 1973.

CITED BY  2
Matthias Jarke , Jurgen Koch, Query Optimization in Database Systems, ACM Computing Surveys (CSUR), v.16 n.2, p.111-152, June 1984
Michael E. Senko, DIAM II: The binary infological level and its database language - FORAL, ACM SIGPLAN Notices, v.11 n.SI, p.121-140, March 1976

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.2 Physical Design
          Subjects: Access methods

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design
          Subjects: Data models


General Terms:
Algorithms, Management

Collaborative Colleagues:
M. M. Astrahan: colleagues
S. P. Ghosh: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player