Abstract
Statistical Databases usually allow only statistical queries. In order to answer a query some kind of summarization must be performed on the raw data. If the size of the original data is too large, e.g. as in Census data and the Current Population Survey, obtaining accurate answers is extremely time consuming. Thus, if the application allows for some precision loss in the answer, the mechanism for query answering could take advantage of previously computed summaries to answer other summary queries. In this paper we describe the necessary notions to maintain a database of previously computed summary information to allow fast query answering of new summary queries with a qualified accuracy and without having to go back to the original data. We use the concept of summary tables, study the potential of sets of summary tables for answering queries, and organize these sets in a lattice structure.
Partially supported by a scholarship from FUNDAYACUCHO, Caracas, Venezuela.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Finkelstein: Common expression analysis in database applications. Proceedings of the ACM SIGMOD Conference, 1982, Orlando, Florida, pp 235–245.
M. Fréchet: Sur Les Tableaux dont les marges et des bornes sont données. Review of the International Institute of Statistics 28:1/2 (1960), pp 10–32.
M. Fréchet: Les Tableaux dont les marges sont données. Trabajos de Estadística, 1960, pp 3–18.
F. M. Malvestuto: Answering Queries in Categorical Data Bases. Proceedings of the Sixth ACM-SIGMOD Symposium, San Diego 1987, pp 87–96.
F. M. Malvestuto: The derivation problem for summary data. Proceedings of the ACM-SIGMOD Symposium, 1988, pp 82–89.
A. Shoshani: Statistical Databases: Characteristics, Problems and some Solutions. Proceedings of the 8th VLDB, Mexico City, Mexico 1982, pp 208–222.
G. Ozsoyoglu and J. Chung: Information Loss in the Lattice Model of Summary Tables due to Cell suppression. Second IEEE Data Engineering Conference, Los Angeles, California, Feb. 1986, pp. 75–85.
G. Ozsoyoglu, Z. M. Ozsoyoglu and V. Matos: Extending Relational Algebra and Relational Calculus with Set-Valued Attributes and Aggregate Functions. ACM Transactions on Database Systems, Vol 12, No 4, Dec. 1987, pp 566–592.
N. C. Rowe: Rule-based statistical Calculations on a “Database Abstract”. Proceedings of the First LBL Workshop on Statistical Database Management, March 1982, pp 163–175.
H. Sato: Handling Summary Information in a Database: Derivability. Proceedings of SIGMOD, 1981, pp 98–107.
E. Seneta: Non-negative matrices and Markov Chains. Springer-Verlag, New York 1980.
T-A. Su, J. Chung and G. Ozsoyoglu: On the Cell Suppression by Merging Technique in the Lattice Model of Summary Tables. IEEE Symposium on Computer Security and Privacy, April 1989, pp 126–137.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abad-Mota, S. (1992). Approximate query processing with summary tables in statistical databases. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032451
Download citation
DOI: https://doi.org/10.1007/BFb0032451
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive