ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

A Heuristic Approach to Attribute Partitioning.

Michael Hammer, Bahram Niamir: A Heuristic Approach to Attribute Partitioning. SIGMOD Conference 1979: 93-101
@inproceedings{DBLP:conf/sigmod/HammerN79,
  author    = {Michael Hammer and
               Bahram Niamir},
  editor    = {Philip A. Bernstein},
  title     = {A Heuristic Approach to Attribute Partitioning},
  booktitle = {Proceedings of the 1979 ACM SIGMOD International Conference on
               Management of Data, Boston, Massachusetts, May 30 - June 1},
  publisher = {ACM},
  year      = {1979},
  isbn      = {0-89791-001-X},
  pages     = {93-101},
  ee        = {http://doi.acm.org/10.1145/582095.582110, db/conf/sigmod/HammerN79.html},
  crossref  = {DBLP:conf/sigmod/79},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into separately stored subfiles. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that are transferred from secondary storage to primary memory in the processing of a transaction.

The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of an accurate partition evaluator and of a heuristic that guides a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The evaluator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way.

We have implemented an evaluator for a particular model database system and have developed a heuristic search technique. A series of experiments has demonstrated the accuracy and efficiency of this heuristic.

Copyright © 1979 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Philip A. Bernstein (Ed.): Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, May 30 - June 1. ACM 1979, ISBN 0-89791-001-X BibTeX
Contents

Online Edition: ACM Digital Library


References

[1]
...
[2]
Jair M. Babad: A Record and File Partitioning Model. Commun. ACM 20(1): 22-31(1977) BibTeX
[3]
Don S. Batory: On Searching Transposed Files (Abstract). VLDB 1978: 488 BibTeX
[4]
...
[5]
...
[6]
...
[7]
...
[8]
...
[9]
P. A. Dearnley: A Model of a Self-Organising Data Management System. Comput. J. 17(1): 13-16(1974) BibTeX
[10]
Mark J. Eisner, Dennis G. Severance: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases. J. ACM 23(4): 619-635(1976) BibTeX
[11]
...
[12]
Michael Hammer, Arvola Chan: Index Selection in a Self-Adaptive Data Base Management System. SIGMOD Conference 1976: 1-8 BibTeX
[13]
...
[14]
...
[15]
...
[16]
...
[17]
Jeffrey A. Hoffer, Dennis G. Severance: The Use of Cluster Analysis in Physical Data Base Design. VLDB 1975: 69-86 BibTeX
[18]
...
[19]
...
[20]
Salvatore T. March, Dennis G. Severance: The Determination of Efficient Record Segmentations and Blocking Factors for Shared Data Files. ACM Trans. Database Syst. 2(3): 279-296(1977) BibTeX
[21]
...
[22]
...
[23]
Arvola Chan, Bahram Niamir: On Estimating the Cost of Accessing Records in Blocked Database Organizations. Comput. J. 25(3): 368-374(1982) BibTeX
[24]
...
[25]
Mario Schkolnick: A Clustering Algorithm for Hierarchical Structures. ACM Trans. Database Syst. 2(1): 27-44(1977) BibTeX
[26]
...
[27]
Peter M. Stocker, P. A. Dearnley: Self-Organising Data Management Systems. Comput. J. 16(2): 100-105(1973) BibTeX
[28]
...
[29]
...
[30]
S. Bing Yao: Approximating the Number of Accesses in Database Organizations. Commun. ACM 20(4): 260-261(1977) BibTeX
[31]
...
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Fri Oct 3 22:41:24 2008