- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- GMP97a.P.B. Gibbons, Y. Matias, and V. Poosala. Aqua project white paper. Technical report, Bell Laboratories, Murray Hill, New Jersey, December 1997.Google Scholar
- 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 ScholarDigital Library
- Goo89.I.J. Good. Surprise indexes and p-values. J. Statistical Computation and Simulation, 32:90- 92, 1989.Google ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- MS99.Y. Matias and E. Segal. Approximate iceberg queries. Technical report, Department of Computer Science, Tel Aviv University, Tel Aviv, Israel, March 1999.Google Scholar
- Poo97.V. Poosala. Histogram-based estimation techniques in databases. PhD thesis, Univ. of Wisconsin-Madison, 1997. Google ScholarDigital Library
- Vit85.J.S. Vitter. Random sampling with a reservoir. A CM Transactions on Mathematical Software, 11(1):37-57, 1985. Google ScholarDigital Library
- 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 ScholarDigital Library
Index Terms
- Tracking join and self-join sizes in limited storage
Recommendations
Tracking Join and Self-Join Sizes in Limited Storage
This paper presents algorithms for tracking (approximate) join and self-join sizes in limited storage, in the presence of insertions and deletions to the data set(s). Such algorithms detect changes in join and self-join sizes without an expensive ...
Multi-way spatial join selectivity for the ring join graph
Efficient spatial query processing is very important since the applications of the spatial DBMS (e.g. GIS, CAD/CAM, LBS) handle massive amount of data and consume much time. Many spatial queries contain the multi-way spatial join due to the fact that ...
Optimizing Nonindexed Join Processing in Flash Storage-Based Systems
Flash memory-based disks (or simply flash disks) have been widely used in today's computer systems. With their continuously increasing capacity and dropping price, it is envisioned that some database systems will operate on flash disks in the near ...
Comments