Limiting result cardinalities for multidatabase queries using histograms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2097, Issue , 2001, Pages 152-167

  Sattler, Kai Uwe ^a   Dunemann, Oliver ^a   Geist, Ingolf ^a   Saake, Gunter ^a   Conrad, Stefan ^b  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Histograms; Multidatabase; Optimization; Result Cardinality

Indexed keywords

DATABASE SYSTEMS; OPTIMIZATION;

ATTRIBUTE VALUES; CARDINALITIES; HETEROGENEOUS SOURCES; HISTOGRAMS; LARGE AMOUNTS OF DATA; MULTIDATABASES; QUERY OPERATORS; QUERY RESPONSE TIME;

GRAPHIC METHODS;

EID: 77949762502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45754-2_10     Document Type: Conference Paper

References (21)

1. [AGP99] S. Acharya, P.B. Gibbons, and V. Poosala. Aqua: A Fast Decision Support Systems Using Approximate Query Answers. In M.P. Atkinson, M.E. Orlowska, P. Valduriez, S.B. Zdonik, and M.L. Brodie, editors, VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 754-757. Morgan Kaufmann, 1999.
2. [AGPR99] S. Acharya, P.B. Gibbons, V. Poosala, and S. Ramaswamy. Join Synopses for Approximate Query Answering. In A. Delis, C. Faloutsos, and S. Ghandeharizadeh, editors, SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadephia, Pennsylvania, USA, pages 275-286. ACM Press, 1999.
3. [] D. Barbará, W. DuMouchel, C. Faloutsos, P.J. Haas, J.M. Hellerstein, Y.E. Ioannidis, H.V. Jagadish, T. Johnson, R.T. Ng, V. Poosala, K.A. Ross, and K.C. Sevcik. The New Jersey Data Reduction Report. Data Engineering Bulletin, 20(4):3-45, 1997.
4. [CK97] M.J. Carey and D. Kossmann. On Saying "Enough Already!" in SQL. In J. Peckham, editor, SIGMOD 1997, Proceedings of Annual Meeting, May 13-15, 1997, Tucson, Arizona, USA, pages 219-230. ACM Press, 1997.
5. [CK98] M.J. Carey and D. Kossmann. Reducing the Braking Distance of an SQL Query Engine. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB'98, August 24-27, 1998, New York City, New York, USA, pages 158-169. Morgan Kaufmann, 1998.
6. [CMN99] S. Chaudhuri, R. Motwani, and V.R. Narasayya. On Random Sampling over Joins. In A. Delis, C. Faloutsos, and S. Ghandeharizadeh, editors, SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadephia, Pennsylvania,USA, pages 263-274. ACM Press, 1999.
7. [GLRS93] J. Grant, W. Litwin, N. Roussopoulos, and T. Sellis. Query Languages for
8. Relational Multidatabases. The VLDB Journal, 2(2):153-171, April 1993.
9. Gra93[] G. Graefe. Query Evaluation Techniques For Large Databases. ACM Computing Surveys, 25(2):73-170, 1993.
10. [HHW97] J.M. Hellerstein, P.J. Haas, and H. Wang. Online Aggregation. In J. Peckham, editor, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 171-182. ACM Press, 1997.
11. [IP95] Y.E. Ioannidis and V. Poosala. Balancing Histogram Optimality and Practicality for Query Result Size Estimation. In M.J. Carey and D.A. Schneider, editors, ACM SIGMOD '95, Proceedings of Annual Meeting, San Jose, California, May 22-25, 1995, pages 233-244. ACM Press, 1995.
12. [JK84] M. Jarke and J. Koch. Query Optimization in Database Systems. ACM Computing Surveys, 16(2):111-152, 1984.
13. Li94[] K.-H. Li. Reservoir-sampling algorithms of time complexity O(n(1 + log(N/n))). ACM Transactions on Mathematical Software, 20(4):481-493, December 1994.
14. [LSS96] L. V. S. Lakshmanan, F. Sadri, and I. N. Subramanian. SchemaSQL – A Language for Interoperability in Relational Multi-database Systems. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, Proc. of the 22nd Int. Conf. on Very Large Data Bases, VLDB'96, Bombay, India, September 3-6, 1996, pages 239-250, San Francisco, CA, 1996. Morgan Kaufmann Publishers.
15. [OR86] F. Olken and D. Rotem. Simple Random Sampling from Relational Databases. In W.W. Chu, G. Gardarin, S. Ohsuga, and Y. Kambayashi, editors, VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings, pages 160-169. Morgan Kaufmann, 1986.
16. [PGI99] V. Poosala, V. Ganti, and Y.E. Ioannidis. Approximate Query Answering using Histograms. IEEE Data Engineering Bulletin, 22(4):5-14, 1999.
17. [PSC84] G. Piatetsky-Shapiro and C. Connell. Accurate Estimation of the Number of Tuples Satisfying a Condition. In B. Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984, pages 256-276. ACM Press, 1984.
18. [SCS00] K. Sattler, S. Conrad, and G. Saake. Adding Conflict Resolution Features to a Query Language for Database Federations. In M. Roantree, W. Hasselbring, and S. Conrad, editors, Proc. 3nd Int. Workshop on Engineering Federated Information Systems, EFIS'00, Dublin, Ireland, June, pages 41-52, Berlin, 2000. Akadem. Verlagsgesellschaft.
19. [SS94] A.N. Swami and K.B. Schiefer. On the Estimation of Join Result Sizes. In M. Jarke, J.A. Bubenko Jr., and K.G. Jeffery, editors, Advances in Database Technology - EDBT'94. 4th International Conference on Extending Database Technology, Cambridge, United Kingdom, March 28-31, 1994, Proceedings, volume 779 of Lecture Notes in Computer Science, pages 287-300. Springer, 1994.
20. [TGO99] K.-L. Tan, C. H. Goh, and B. C. Ooi. On Getting Some Answers Quickly, and Perhaps More Later. In Proceedings of the 15th International Conference on Data Engineering, 23-26 March 1999, Sydney, Austrialia, pages 32-39. IEEE Computer Society, 1999.
21. Vit87[] J.S. Vitter. An Eficient Algorithm for Sequential Random Sampling. ACM Transactions on Mathematical Software, 13(1):58-67, March 1987.