
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shantanu Joshi, Christopher Jermaine, "Materialized Sample Views for Database Approximation," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 3, pp. 337351, March, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2007.190664, author = {Shantanu Joshi and Christopher Jermaine}, title = {Materialized Sample Views for Database Approximation}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {3}, issn = {10414347}, year = {2008}, pages = {337351}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190664}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Materialized Sample Views for Database Approximation IS  3 SN  10414347 SP337 EP351 EPD  337351 A1  Shantanu Joshi, A1  Christopher Jermaine, PY  2008 KW  Indexing methods KW  Query processing KW  Sampling VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[2] J.M. Hellerstein, P.J. Haas, and H.J. Wang, “Online Aggregation,” Proc. ACM SIGMOD, pp. 171182, 1997.
[3] J.M. Hellerstein, R. Avnur, A. Chou, C. Hidber, C. Olston, V. Raman, T. Roth, and P.J. Haas, “Interactive Data Analysis: The Control Project,” Computer, vol. 32, no. 8, pp. 5159, Aug. 1999.
[4] P.J. Haas and J.M. Hellerstein, “Ripple Joins for Online Aggregation,” Proc. ACM SIGMOD, pp. 287298, 1999.
[5] P.S. Bradley, U.M. Fayyad, and C. Reina, “Scaling Clustering Algorithms to Large Databases,” Proc. Third Int'l Conf. Knowledge Discovery and Data Mining (KDD '98), pp. 915, 1998.
[6] F. Provost, D. Jensen, and T. Oates, “Efficient Progressive Sampling,” Proc. Fourth Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 2332, 1999.
[7] C. Meek, B. Thiesson, and D. Heckerman, “The LearningCurve Sampling Method Applied to ModelBased Clustering,” J. Machine Learning Research, vol. 2, pp. 397418, 2002.
[8] M. SaarTsechansky and F. Provost, “Active Sampling for Class Probability Estimation and Ranking,” Machine Learning, vol. 54, no. 2, pp. 153178, 2004.
[9] T. Scheffer and S. Wrobel, “Finding the Most Interesting Patterns in a Database Quickly by Using Sequential Sampling,” J. Machine Learning Research, vol. 3, pp. 833862, 2002.
[10] P.J. Haas and C. Koenig, “A Bilevel Bernoulli Scheme for Database Sampling,” Proc. ACM SIGMOD, pp. 275286, 2004.
[11] P.J. Haas, “The Need for Speed: Speeding Up DB2 Using Sampling,” IDUG Solutions J., vol. 10, pp. 3234, 2003.
[12] F. Olken and D. Rotem, “Random Sampling from B+ Trees,” Proc. 15th Int'l Conf. Very Large Data Bases (VLDB '89), pp. 269277, 1989.
[13] F. Olken and D. Rotem, “Simple Random Sampling from Relational Databases,” Proc. 12th Int'l Conf. Very Large Data Bases (VLDB '86), pp. 160169, 1986.
[14] F. Olken, D. Rotem, and P. Xu, “Random Sampling from Hash Files,” Proc. ACM SIGMOD, pp. 375386, 1990.
[15] F. Olken, “Random Sampling from Databases,” PhD dissertation, 1993.
[16] F. Olken and D. Rotem, “Sampling from Spatial Databases,” Proc. Ninth IEEE Int'l Conf. Data Eng. (ICDE '93), pp. 199208, 1993.
[17] G. Antoshenkov, “Random Sampling from PseudoRanked B+ Trees,” Proc. 18th Int'l Conf. Very Large Data Bases (VLDB '92), pp.375382, 1992.
[18] S. Chaudhuri, G. Das, and U. Srivastava, “Effective Use of BlockLevel Sampling in Statistics Estimation,” Proc. ACM SIGMOD, pp.287298, 2004.
[19] A.A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan, “Clustering Techniques for Minimizing External Path Length,” Proc. 22nd Int'l Conf. Very Large Data Bases (VLDB '96), pp. 342353, 1996.
[20] H. GarciaMolina, J. Widom, and J.D. Ullman, Database System Implementation. Prentice Hall, 1999.
[21] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, pp. 4757, 1984.
[22] S.T. Leutenegger, J.M. Edgington, and M.A. Lopez, “STR: A Simple and Efficient Algorithm for RTree Packing,” Proc. 13th IEEE Int'l Conf. Data Eng. (ICDE '97), pp. 497506, 1997.
[23] D.G. Severance and G.M. Lohman, “Differential Files: Their Application to the Maintenance of Large Databases,” ACM Trans. Database Systems, vol. 1, no. 3, pp. 256267, 1976.
[24] P.G. Brown and P.J. Haas, “Techniques for Warehousing of Sample Data,” Proc. 22nd IEEE Int'l Conf. Data Eng. (ICDE '06), p.6, 2006.
[25] P. Muth, P.E. O'Neil, A. Pick, and G. Weikum, “Design, Implementation, and Performance of the LHAM LogStructured History Data Access Method,” Proc. 24th Int'l Conf. Very Large Data Bases (VLDB '98), pp. 452463, 1998.