Ripple Joins for Online Aggregation

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1999, Pages 287-298

  Haas, Peter J ^a   Hellerstein, Joseph M ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION SUPPORT SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; QUERY LANGUAGES; QUERY PROCESSING;

AGGREGATION QUERIES; CONFIDENCE INTERVAL; DECISION SUPPORT APPLICATIONS; JOIN ALGORITHM; OFFLINE; ONLINE AGGREGATIONS; ONLINE PROCESSING; QUERY RESULTS; RELATIONAL DATABASE MANAGEMENT SYSTEMS; STATISTICAL PROPERTIES;

ASPECT RATIO;

EID: 85128358092     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/304182.304208     Document Type: Conference Paper

References (26)

1. M. Abramowitz and I. A. Stegun. Handbook of Mathematical Functions. Dover, New York, 1972. Ninth printing.
2. P. Billingsley. Probability and Measure. Wiley, New York, 1986.
3. T. F. Ghan, G. H. Golub, and R. J. LeVeque. Algorithms for computing the sample variance: Analysis and recommendation. Amer. Statist., 37:242-247, 1983.
4. D. J. Dewitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Michael R. Stonebraker. and D. Wood. Implementation Techniques for Main Memory Database Systems. in Proc. 1984 ACM SIGMOD Zntl. Conf. Managment of Data, pages 1-8. ACM Press, 1984.
5. J. Gray and G. Graefe. The five-minute rule ten years later and other computer storage rules of thumb. SZGMOD Record, 26(4), 1997.
6. G. Graefe. Query Evaluation Techniques for Large Databases. ACM Comput. Surveys, 25(2):73-170, June 1993.
7. P. J. Haas. Large-sample and deterministic confidence intervals for online aggregation. In Proc. Ninth Zntl. Conf. Scientific and Statist. Database Management, pages 51-63. IIEEE Computer Society Press, 1997.
8. J. M. Hellerstein, R. Avnur, and V. Raman. Informix under CONTROL: Online query processing. Submitted for publication, 1999.
9. P. J. Haas and 3. M. Hellerstein. Join algorithms for online aggregation. IBM Research Report RJ 10126, IBM Almaden Research Center, San Jose, CA, 1998.
10. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In Proc. 1997 ACM SZGMOD Zntl. Conf. Managment of Data, pages 171-182. ACM Press, 1997.
11. J. M. Hellerstein and J. F. Naughton. Query Execu, tion Techniques for Caching Expensive Methods. In Proc. 1996 ACM SZGMOD Zntl. Conf. Managment of Data, pages 423-424. ACM Press, 1996.
12. P. J. Haas, J. F. Naughton, and A. N. Swami. On the relative cost of sampling for join selectivity estimation. In Proc. Thirteenth ACM SZGACT-SZGMOD-SZGART Symp. Pri, nciples of Database Sys., pages 14-24. ACM Press, 1994.
13. P. J. Haas, J. F. Naughton, S. Seshadri, and A. N. Swami. Selectivity and cost estimation for joins based on random sampling. J. Comput. System Sci., 52:550-569, 1996.
14. W. Hoeffding. A class of statistics with asymptotically normal distribution. Ann. Math. Statist., 19:293-325, 1948.
15. W. Hou, G. Ozsoyoglu, and B. Taneja. Statistical estimators for relational algebra expressions. In Proc. Seventh ACM SZGACT-SZGMOD-SZGART Symp. Principle:; of Database Sys., pages 276-287. ACM Press, 1988.
16. W. Hou, G. Ozsoyoglu, and B. Taneja. Processing aggregate relational queries with hard time constraints. In Pmt. 1989 ACM SZGMOD Zntl. Conf. Managment of Data, pages 68-77. ACM Press, 1989.
17. IBM Corporation. IBM 082 Universal Database Administration Guide, Version 5. North York, Ontario, Canada, 1997.
18. Informix Corporation. Znformix Universal Server Guide to SQL: Syntax, Version 9.01. Menlo Park, CA, March 19!17.
19. G. Ozsoyoglu, K. Du, A. Tjahjana, W. Hou, and D. Y. Rowland. On estimating COUNT, SUM, and AVERAGE relational algebra queries. In D. Dimitris Karagiannis, editor, Database and Expert Systems Applications, Proceedings of the International Conference in Berlin, Germany, 1991 (DEXA 91), pages 406-412. Springer-Verlag, 1991.
20. V. O'day and R. Jeffries. Orienteering in an information landscape: How information seekers get from here to there. In Human Factors in Computing Systems: ZNTERCHZ '93 Conf. Proc., pages 438-445. ACM Press, 1993.
21. F. Olken. Random Sampling from Databases. Ph.D. IXssertation, University of California, Berkeley, CA, 1993. Avtilable as Tech. Report LBL-32883, Lawrence Berkeley Laboratories, Berkeley, CA.
22. Oracle Corporation. Oracle8 Server SQL Reference, Release 8.0. Redwood Shores, CA, June 1997.
23. PostgreSQL Home Page, 1998. http://www.postgresql.org.
24. V. Raman, B. Raman, and J. M. Hellerstein. Online dynamic reordering for interactive data processing. Technical Report UCB//CSD-99-1043, Computer Science Division, UC Berkeley, 1999. Submitted for publication.
25. R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Rule ordeiing in bottom-up fixpoint evaluation of logic programs. tins. Knowledge and Data Engrg., 6(4):501-517, 1994.
26. A. N. Wilschut and P. M. G. Apers. Dataflow query execution in a parallel main-memory environment. In Proc. First Intl. Conf. Parallel and Distributed Info. Sys. (PDZS), pages 68-77. IEEE Computer Society Press, 1991.