Skip to main content
Log in

Page-query compaction of secondary memory auxiliary databases

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Prestoring redundant data in secondary memory auxiliary databases is an idea that can often yield improved retrieval performance through better clustering of related data. The clusters can be based on either whole query results or, as this paper indicates, on more specialized units called page-queries. The deliberate redundancy introduced by the designer is typically accompanied by much unnecessary redundancy among the elements of the auxiliary database. This paper presents algorithms for efficiently removing unwanted redundancy in auxiliary databases organized into page-query units. The algorithms presented here extend prior work done for secondary memory compaction in two respects: First, since it is generally not possible to remove all unwanted redundancies, the paper shows how can the compaction be done to remove the most undesirable redundancy from a system performance point-of-view. For example, among the factors considered in determining the worst redundancies are the update behavior and the effects of a particular compaction scheme on memory utilization. Second, unlike traditional approaches for database compaction which aim merely at reducing the storage space, this paper considers the paging characteristics in deciding on an optimal compaction scheme. This is done through the use of page-queries. Simulation results are presented and indicate that page-query compaction results in less storage requirements and more time savings than could be obtained by standard non-page-query compaction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blakeley, J., Larson, P., and Tompa, F., “Efficiently Updating Materialized Views,” in:Proceedings of the ACM SIGMOD Annual Conference, 1986.

  2. Blakeley, J., Coburn, N., and Larson, P., “Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates,” in:Proceeding of the Twelfth International Conference on Very Large Data Bases, Kyoto, Japan, August 1986.

  3. Deogun, J.S., Raghavan, V.V., and Tsou, T.K.W., “Organization Of Clustered Files for Consecutive Retrieval,” in:ACM Transaction on database Systems, Vol. 9, No. 4, December 1984, pp. 646–671.

    Google Scholar 

  4. Ghosh, S.P.,Database Organization for Data Management, Chapter 6, Academic Press, 1977.

  5. Gupta, U., “Bounds on Storage for Consecutive Retrieval,” in:Journal of the Association for Computing Machinery, Vol. 26, No. 1, January 1979, pp. 28–36.

    Google Scholar 

  6. Hanson, E., “A Performance Analysis of View Materialization Strategies,” in:Proceedings of the ACM SIGMOD International Conference, 1987.

  7. Kamel, N., “The Use of Controlled Redundancy in Self-Adaptive Databases,” Ph.D. thesis, Computer Science Department, University of Colorado, Boulder, Colorado, 1985.

    Google Scholar 

  8. Kamel N. and King R., “Intelligent Database Caching through the Use of Page-Answers and Page-Traces,”ACM TODS, Forthcoming.

  9. Kamel, N., “Page-Queries: A Tool for Organizing Secondary Memory Auxiliary Databases,” Submitted toInformation Systems, 1991.

  10. Kou, L., “Polynomial Complete Consecutive Information Retrieval Problems,” in:SIAM Journal of Computing, Vol. 6, No. 1, March 1977.

  11. Larson, P.A. and Yang, H.Z., “Computing Queries from Derived Relations,” in:Proc. of the 11th International Conference on Very Large Databases, 1985, pages 259–269.

  12. Maier, D. and Ullman, J., “Fragments of Relations,” in:Proceedings of the ACM SIGMOD International Conference, 1983.

  13. Sun, X.H. and Kamel N., “Solving Implication Problems for Database Applications,” in:Proceedings of the ACM SIGMOD, Portland, Oregon, 1989, 185–192. Also in:ACM SIGMOD Record, Vol. 18, No. 2, June 1989.

  14. Daniel Rosenkrantz and Harry B. Hunt, III, “Processing Conjunctive Predicates and Queries,” in:Proceedings of the of 6th VLDB, (1980), 64–72.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Recommended by: Ramez Elmasri

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kamel, N. Page-query compaction of secondary memory auxiliary databases. Distrib Parallel Databases 2, 371–404 (1994). https://doi.org/10.1007/BF01265320

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01265320

Keywords

Navigation