
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin J. Strauss, "DomainDriven Data Synopses for Dynamic Quantiles," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 7, pp. 927938, July, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.108, author = {Anna C. Gilbert and Yannis Kotidis and S. Muthukrishnan and Martin J. Strauss}, title = {DomainDriven Data Synopses for Dynamic Quantiles}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {7}, issn = {10414347}, year = {2005}, pages = {927938}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.108}, 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  DomainDriven Data Synopses for Dynamic Quantiles IS  7 SN  10414347 SP927 EP938 EPD  927938 A1  Anna C. Gilbert, A1  Yannis Kotidis, A1  S. Muthukrishnan, A1  Martin J. Strauss, PY  2005 KW  Index Terms Quantiles KW  database statistics KW  data streams. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Agrawal, T. Imielinski, and A. Swami, “Mining Associations between Sets of Items in Massive Databases,” Proc. ACM SIGMOD, pp. 207216, May 1993.
[2] R. Agrawal and R. Srikant, “Mining Quantitative Association Rules in Large Relational Tables,” Proc. ACM SIGMOD, pp. 112, June 1996.
[3] R. Agrawal and A. Swami, “A OnePass SpaceEfficient Algorithm for Finding Quantiles,” Proc. Conf. Management of Data, 1995.
[4] N. Alon, Y. Matias, and M. Szegedy, “The Space Complexity of Approximating the Frequency Moments,” Proc. ACM Symp. Theory of Computing, pp. 2029, 1996.
[5] N. Alon and J.H. Spencer, The Probabilistic Method. New York: Wiley and Sons, 1992.
[6] K. Alsabti, S. Ranka, and V. Singh, “A OnePass Algorithm for Accurately Estimating Quantiles for DiskResident Data,” Proc. Very Large Data Bases Conf., pp. 346355, 1997.
[7] M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, “Time Bounds for Selection,” J. Computer and System Sciences, vol. 7, no. 4, pp. 448461, 1973.
[8] M. Charikar, K. Chen, and M. FarachColton, “Finding Frequent Items in Data Streams,” Proc. 29th Int'l Colloquium Automata, Languages, and Programming, 2002.
[9] F. Chen, D. Lambert, and J.C. Pinheiro, “Incremental Quantile Estimation for Massive Tracking,” Proc. Int'l Conf. Knowledge Discovery and Data Mining, pp. 516522, Aug. 2000.
[10] Cisco NetFlow, http://www.cisco.com/warp/public/732net flow /, 1998.
[11] G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan, “Comparing Data Streams Using Hamming Norms (How to Zero In),” Proc. Very Large Data Bases Conf., pp. 335345, 2002.
[12] G. Cormode and S. Muthukrishnan, “An Improved Data Stream Summary: The CountMin Sketch and Its Applications,” LATIN, pp. 2938, 2004.
[13] M. Datar, A. Gionis, P. Indyk, and R. Motwani, “Maintaining Stream Statistics over Sliding Windows,” Proc. 13th ACMSIAM Symp. Discrete Algorithms, 2002.
[14] D.J. DeWitt, J.F. Naughton, and D.A. Schneider, “Parallel Sorting on a SharedNothing Architecture Using Probabilistic Splitting,” Proc. Conf. Parallel and Distributed Information Systems, pp. 280291, 1991.
[15] A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi, “Processing Complex Aggregate Queries over Data Streams,” Proc. ACM SIMGOD, pp. 6172, June 2002.
[16] P. Gibbons, “Distinct Sampling for HighlyAccurate Answers to Distinct Values Queries and Event Reports,” Proc. Very Large Data Bases Conf., pp. 541550, 2001.
[17] P. Gibbons, Y. Matias, and V. Poosala, “Fast Incremental Maintenance of Approximate Histograms,” Proc. Very Large Data Bases Conf., pp. 466475, 1997.
[18] A.C. Gilbert and Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, “Surfing Wavelets on Streams: OnePass Summaries for Approximate Aggregate Queries,” Proc. Very Large Data Bases Conf., pp. 7988, 2001.
[19] A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, “How to Sumamtize the Universe: Dynamic Maintenance of Quantiles,” Proc. Very Large Data Bases Conf., pp. 454465, 2002.
[20] A.C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, “Fast, SmallSpace Algorithms for Approximate Histogram Maintenance,” Proc. 34th ACM Symp. Theory of Computing, pp. 389398, 2002.
[21] M. Greenwald and S. Khanna, “SpaceEfficient Online Computation of Quantile Summaries,” Proc. ACM SIGMOD, pp. 5866, May 2001.
[22] P. Indyk, “Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation,” Proc. 41st Symp. Foundations of Computer Science, pp. 189197, 2000.
[23] P. Indyk, N. Koudas, and S. Muthukrishnan, “Identifying Representative Trends in Massive Time Series Data Sets Using Sketches,” Proc. Very Large Data Bases, pp. 363372, 2000.
[24] R. Jain and I. Chlamtac, “The $P^2$ Algorithm for Dynamic Calculation of Quantiles and Histograms without Storing Observations,” Comm. ACM, vol. 28, no. 10, 1985.
[25] T. Johnson, S. Muthukrishnan, P. Dasu, and V. Shkapenyuk, “Mining Database Structure; or, How to Build a Data Quality Browser,” Proc. ACM SIGMOD, 2002.
[26] G.S. Manku, S. Rajagopalan, and B.G. Lindsay, “Approximate Medians and Other Quantiles in One Pass and with Limited Memory,” Proc. ACM SIGMOD, 1998.
[27] G.S. Manku, S. Rajagopalan, and B.G. Lindsay, “Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Data Sets,” Proc. ACM SIGMOD, pp. 251262, 1999.
[28] J.I. Munro and M.S. Paterson, “Selection and Sorting with Limited Storage,” Theoretical Computer Science, vol. 12, pp. 315323, 1980.
[29] M.S. Paterson, “Progress in Selection,” technical report, Univ. of Warwick, Coventry, U.K., 1997.
[30] V. Poosala, “HistogramBased Estimation Techniques in Database Systems,” PhD dissertation, Univ. of WisconsinMadison, 1997.
[31] V. Poosala and Y.E. Ioannidis, “Estimation of QueryResult Distribution and Its Application in ParallelJoin Load Balancing,” Proc. Very Large Data Bases Conf., pp. 448459, 1996.
[32] V. Poosala, Y.E. Ioannidis, P.J. Haas, and E.J. Shekita, “Improved Histograms for Selectivity Estimation of Range Predicates,” Proc. ACM SIGMOD, pp. 294305, 1996.
[33] Y. Matias, J. Vitter, and M. Wang, “Dynamic Maintenance of WaveletBased Histograms,” Proc. Very Large Data Bases Conf., pp. 101110, Sept. 2000.
[34] J.S. Vitter, “Random Sampling with a Reservoir,” ACM Trans. Math. Software, vol. 11, no. 1, pp. 3757, 1985.