skip to main content
10.1145/303976.303978acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free Access

Tracking join and self-join sizes in limited storage

Authors Info & Claims
Published:01 May 1999Publication History
First page image

References

  1. AGP99.S. Acharya, P. B. Gibbons, and V. Poosala. Congressional samples for approximate answering of group-by queries. Technical report, Bell Laboratories, Murray Hill, New Jersey, March 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. AGPR99.S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In Proc. A CM SIGMOD International Conf. on Management of Data, June 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. AMS96.N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. 28th A CM Symp. on the Theory of Computing, pages 20-29, May 1996. Full version to appear in JCSS special issue for STOC'96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BDF+97.D. Barbar~, W. DuMouchel, C. Faloutsos, P. J. Haas, J. IVl. Hellerstein, Y. Ioannidis, H. V. Jagadish, T. Johnson, R. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The New Jersey data reduction report. Bulletin of the Technical Committee on Data Engineering, 20(4):3-45, 1997.Google ScholarGoogle Scholar
  5. GGMS96.S. Ganguly, P. B. Gibbons, Y. Matias, and A. Silberschatz. Bifocal sampling for skewresistant join size estimation. In Proc. A CM SIGMOD International Conf. on Management of Data, pages 271-281, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. GM98a.P.B. Gibbons and Y. Matias. New samplingbased summary statistics for improving approximate query answers. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 331-342, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. GM98b.P.B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, 1998. To appear. Available as Bell Labs tech. rep., Sept. 1998, and at http://www.bell-labs.com/~pbgibbons/. Also, a two-page summary of this paper appeared in SODA'99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. GMP97a.P.B. Gibbons, Y. Matias, and V. Poosala. Aqua project white paper. Technical report, Bell Laboratories, Murray Hill, New Jersey, December 1997.Google ScholarGoogle Scholar
  9. GMP97b.P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. :n Proc. 23rd International Conf. on Very Large'. Data Bases, pages 466-475, August 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Goo89.I.J. Good. Surprise indexes and p-values. J. Statistical Computation and Simulation, 32:90- 92, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  11. HH99.P. Haas and J. Hellerstein. Ripple joins for online aggregation. In Proc. A CM SIGMOD Interna-. tional Conf. on Management of Data, June 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. HHW97.J.M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation, in Proc. A CM SIGMOD International Conf. on Management of Data. pages 171-182, May 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. HNSS93.P. J. Haas, J. F. Naughton, S. Seshadri, and A. N. Swami. Fixed-precision estimation of join. selectivity. In Proc. 12th A CM Symp. on Prin. ciples of Database Systems, pages 190-201, May' 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. HNSS95.P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. I~ Proc. 21st International Conf. on Very Large Data Bases, pages 311-322, September 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. HÖT88.W.-C. Hou, G. ()zsoyoglu, and B. K. Taneja. Statistical estimators for relational algebra ex-. pressions. In Proc. 7th A CM Syrup. on Princi. ples of Database Systems, pages 276-287, March. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. IP95.Y.E. Ioannidis and V. Poosala. Balancing his-. togram optimality and practicality for query re-. suit size estimation. In Proc. A CM SIGMOD international Conf. on Management of Data. pages 233-244, May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. LN95.R.j. Lipton and J. F. Naughton. Query size estimation by adaptive sampling. J. Computer and System Sciences, 51(1):18-25, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. LNS90.R.J. Lipton, J. F. Naughton, and D. A. Schnei-. def. Practical selectivity estimation through. adaptive sampling. In Proc. A CM SIGMOJD International Conf. on Management of Data, pages 1-12, May 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. MRL98.G.S. Manku, S. Rajagopalan, and B. G. Lindsley. Approximate medians and other quantiles in one pass and with limited memory, in Proc. A CM SIGMOD International Conf. on. Management of Data, pages 426-435, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. MS99.Y. Matias and E. Segal. Approximate iceberg queries. Technical report, Department of Computer Science, Tel Aviv University, Tel Aviv, Israel, March 1999.Google ScholarGoogle Scholar
  21. Poo97.V. Poosala. Histogram-based estimation techniques in databases. PhD thesis, Univ. of Wisconsin-Madison, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Vit85.J.S. Vitter. Random sampling with a reservoir. A CM Transactions on Mathematical Software, 11(1):37-57, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. VL93.S.V. Vrbsky and J. W. S. Liu. Approximatea query processor that produces monotonically improving approximate answers. IEEE Trans. on Knowledge and Data Engineering, 5(6):1056-1068, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Tracking join and self-join sizes in limited storage

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            May 1999
            374 pages
            ISBN:1581130627
            DOI:10.1145/303976

            Copyright © 1999 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 1999

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            PODS '99 Paper Acceptance Rate32of116submissions,28%Overall Acceptance Rate642of2,707submissions,24%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader