A heuristic approach to attribute partitioning

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1979, Pages 93-101

  Hammer, Michael ^a   Niamir, Bahram ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

DESIGN MECHANISMS; FIGURE OF MERITS; HEURISTIC APPROACH; HEURISTIC SEARCH TECHNIQUE; LARGE SPACES; PRIMARY MEMORY; SECONDARY STORAGE; USAGE PATTERNS;

DIGITAL STORAGE;

EID: 84976698424     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/582095.582110     Document Type: Conference Paper

References (31)

1. Alsbcrg P. A., "Space and Time Savings through Large Data Base Compression and Dynamic Restructuring", Proceedings of the IEEE, Vol. 63, No. 8, August 1975.
2. Babad, J. M., "A Record and File Partitioning Model", Communications of the ACM, Vol. 20, No. 1, January 1977.
3. Batory, D. S., "On Searching Transposed Files", Proceedings of the International Conference on Very Large Data Bases, 1978.
4. Benner F. H., "On Designing Generalized File Records for Management Information Systems", Proceedings of the Fall Joint Computer Conference, 1967.
5. Belford, C. C, "Dynamic Data Clustering and Partitioning", CAC 162, Center for Advanced Computation, Research in Network Data Management and Resource Sharing, University of Illinois at Urbana-Champaign, May 1975.
6. Blasgen, M. W., and Eswaran, K. P., "On the Evaluation of Queries in a Relational Data Base System", Computer Science Department, IBM Research Laboratory, San Jose, Calif., 1976.
7. Chan, A. Y., "Index Selection in a Self-adaptive Relational Data Base Management System", Massachusetts Institute of Technology, Laboratory for Computer Science Technical Report 166, Cambridge, Mass., Sept. 1976.
8. Day, R. H., "An Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming", Operations Research, 13, 3 (May 1956) 482-494.
9. Dearnley, P., "Model of a Self-organizing Data Management System", Computer Journal Vol. 17, No. 1, Feb. 1974.
10. Eisner, M. J., and Severance, D. C, "Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases", Journal of the Association for Computing Machinery, Vol. 23, No. 4, October 1976, pp. 619-635.
11. Golden, B. L., "A Statistical Approach to the Travelling Salesman Problem", Networks, Vol. 7, 1977.
12. Hammer, M. M., and Chan, A., "Index Selection in A Self-Adaptive Data Base Management System", Proceedings of the 1976 SIGMOD Conference, Washington. DC, June 2. 1976.
13. Hammer, M. M., and Chan, A. Y., "Acquisition and Utilization of Access Patterns in Relational Data Base Implementation", Pattern Recognition and Artificial Intelligence (editor Chen, C. H), Academic Press, 1976.
14. Hammer, M. M., "Self-adaptive Automatic Data Base Design", Proceedings of National Computer Conference, Dallas, Texas, June 1977.
15. Hammer, M. M., and Chan, A. Y., "A Statistical Inference Approach to the Validation of Database Design Heuristics", forthcoming memorandum.
16. Hoffer, J. A., "A Clustering Approach to the Generation of Subfiles for the Design of a Computer Data Base", Ph. D. Dissertation, Department of Operations Research, Cornell University (January 1975) 276pp.
17. Hoffer, J. A., and Severance, D. G., "The Use of Cluster Analysis in Physical Data Base Design", Proceedings of International Conference on Very Large Data Bases, Framingham MA, Sept. 1975.
18. Kennedy, S. R., "A File Partitioning Model", California Institute of Technology Information Science Technical Report 2, May 1972.
19. Kennedy, S. R., "The Use of Access Frequencies in Data Base Organization", Ph. D. Dissertation, The Wharton School, University of Pennsylvania (May 1973), 155pp.
20. March, S. T. and Severance D. G., "The Determination of Efficient Record Segmentation and Blocking Factors for Shared Data Files", ACM Transactions on Database Systems, Vol. 2. No. 3, Sept. 1977.
21. McCormick, W. T., Jr., Schweitzer, P. J., and White, T. W., "Problem Decomposition and Data Reorganization by a Clustering Technique", Operations Research, 20, 4(July 1972), 741-751.
22. Niamir, B., "Attribute Partitioning in a Self-adaptive Relational Database System", Massachusetts Institute of Technology, Laboratory for Computer Science Technical Report 192, Cambridge, Mass., January 1978.
23. Niamir, B., and Chan, A. Y., "On Estimating the Cost of Accessing Records in Blocked Database Organizations", MIT Laboratory for Computer Science, forthcoming Technical Memorandum.
24. Osman, I. M., "The Partitioning of a Data Base into Supplies Matching User's Queries", Computer Centre, University of Khartoum, Sudan.
25. Schkolnick, M., "A Clustering Algorithm for Hierarchical Structures", ACM Transactions on Database Systems, Vol. 2, No. 1, March 1977.
26. Seppälä, Y., "Definition of Extraction Files and Their Optimization by Zero-One Programming", BIT, 7, 3 (1967) 206-215.
27. Stocker, P. M., and Dearnley, P, A., "Self-organizing Data Management Systems", Computer Journal 16, 2 (May 1973).
28. Wang, L., "Simultaneous File Partitioning and Index Selection in a Self-adaptive Data Base Management System", MIT Laboratory for Computer Science, Data Base Systems Group unpublished report, August 1978.
29. Waters, S. J., "Hit Ratios", the Computer Journal, Volume 19, No. 1, April 1976.
30. Yao, S. B., "Approximating Block Accesses in Database Organizations", Communications of the ACM, Volume 20, No. 4. April 1977.
31. Yue, P. C, and Wong. C. K.. "On the Optimal Properties of a Partition Algorithm", IBM Research Report, RC 3797. March 30, 1972.