Acta Informatica

, Volume 26, Issue 5, pp 485–499

A family of NP-complete data aggregation problems

  • Paul Helman


We consider a family of general aggregation problems and prove each of its members to be NP-complete in the strong sense. These problems require that we partition a set of objects into “aggregates”. The goal is to minimize the expected cost of satisfying an anticipated collection of requests for subsets of the objects, where the cost of satisfying a request includes both the number and the sizes of the aggregates which must be retrieved. The aggregation problems are viewed as very basic versions of important database optimization problems, including: the partitioning of data items into record types, the clustering of records into physical blocks of storage, and the partitioning of a database into granules to support locking. The NP-completeness results demonstrate that such optimization problems are intractable, even when simplified to the extreme. The fact that the problems are NP-complete in the strong sense also rules out pseudopolynomial time solutions, unless P = NP.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Babad, J.: A record and file partitioning model. CACM, 20, 22–31 (1977)Google Scholar
  2. 2.
    Chen, P.: The entity-relationship model — towards a unified view of data. ACM Trans. Database Syst. 1, 9–36 (1976)Google Scholar
  3. 3.
    Garey, M., Johnson, D.: Computers and Intractability: A guide to the theory of NP-completeness. San Francisco, Calif.: W.H. Freeman 1979Google Scholar
  4. 4.
    Hammer, M., Niamir, B.: A heuristic approach to attribute partitioning. Proc. ACM/SIGMOD Int. Conf. Manage. Data, pp. 93–100, 1979Google Scholar
  5. 5.
    Helman, P., Veroff, R.: Designing deductive databases. J. Autom. Reasoning 4, 29–69 (1988)Google Scholar
  6. 6.
    March, S.: Techniques for structuring database records. ACM Comput. Surv. 15, 45–79 (1983)Google Scholar
  7. 7.
    Meyer, T., Helman, P.: Heuristics for designing database records to minimize retrieval times. University of New Mexico, Department of Computer Science, Technical Report No. CS87-4, 1987Google Scholar
  8. 8.
    Schkolnick, M.: A clustering algorithm for hierarchical structures. ACM Trans. Database Syst. 2, 27–44 (1977)Google Scholar
  9. 9.
    Smith, J., Smith, D.: Database abstraction: aggregation and generalization. CACM 20, 405–413 (1977)Google Scholar
  10. 10.
    Teorey, T., Fry, J.: Design of Database Structures. Englewood Cliffs, N.J.: Prentice Hall 1982Google Scholar
  11. 11.
    Ullman, J.: Principles of Database Systems. Potomac, Maryland: Computer Science Press 1982Google Scholar
  12. 12.
    Yao, S., Kunii, T.: Data Base Design Techniques. Berlin Heidelberg New York: Springer 1982Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Paul Helman
    • 1
  1. 1.Department of Computer ScienceUniversity of New MexicoAlbuquerqueUSA

Personalised recommendations