Similarity group-by

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 904-915

  Silva, Yasin N ^a   Aref, Walid G ^a   Ali, Mohamed H ^b  

^a PURDUE UNIVERSITY   (United States)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SCENARIO; EXECUTION TIME; GROUP-BY OPERATIONS; OPTIMIZATION TECHNIQUES; PERFORMANCE STUDY; POSTGRESQL; QUERY OPERATORS;

ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; DECISION THEORY;

CLUSTERING ALGORITHMS;

EID: 67649641445     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.113     Document Type: Conference Paper

References (29)

1. N. Koudas and K. C. Sevcik, "High Dimensional Similarity Joins: Algorithms and Performance Evaluation," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 1, pp. 3-18, 2000.
2. G. Hjaltason and H. Samet, "Incremental distance join algorithms for spatial databases," SIGMOD Record, vol. 27, no. 2, pp. 237-248, 1998.
3. C. Böhm and F. Krebs, "The k-Nearest Neighbour Join: Turbo charging the KDD process," Knowledge and Information Systems, vol. 6, no. 6, pp. 728-749, 2004.
4. C. Böhm, B. Braunmüller, M. Breunig, and H. Kriegel, "High performance clustering based on the similarity join," in Proc. 9th CIKM, 2000, pp. 298-305.
5. C. Yu, B. Cui, S. Wang, and J. Su, "Efficient index-based KNN join processing for high-dimensional data," Information and Software Technology, vol. 49, no. 4, pp. 332-344, 2007.
6. C. Xia, H. Lu, B. Chin, and O. Hu, "GORDER: An Efficient method for KNN join processing," in Proc. 30th VLDB, 2004, pp. 756-767.
7. C. Böhm and H. Kriegel, "A cost model and index architecture for the similarity join," in Proc. 17th ICDE, 2001, pp. 411-420.
8. C. Böhm, F. Krebs, and H. Kriegel, "Optimal Dimension Order: A generic technique for the similarity join," in Proc. 4th DaWaK, 2002, pp. 135-149.
9. H. Kriegel, P. Kunath, M. Pfeifle, and M. Renz, "Probabilistic similarity join on uncertain data," in Proc. 11th DASFAA, 2006, pp. 295-309.
10. A. Jain, M. Murty, and P. Flynn, "Data clustering: a review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
11. P. Berkhin, "Survey of clustering data mining techniques," Accrue Software, 2002.
12. B. Stein, S. zu Eissen, and F. Wibrock, "On cluster validity and the information need of users," in Proc. 3rd AIA, 2003, pp. 216-221.
13. M. Halkidi, Y. Batistakis, and M. Vazirgiannis, "Clustering validity checking methods: part II," SIGMOD Record, vol. 31, no. 3, pp. 19-27, 2002.
14. M. Li, G. Holmes, B. Pfahringer, "Clustering large datasets using Cobweb and K-Means in tandem," in Proc. 17th Australian Joint Conference on Artificial Intelligence, 2004, pp. 368-379.
15. F. Farnstrom, J. Lewis, and C. Elkan, "Scalability for clustering algorithms revisited," SIGKDD Explorations Newsletter, vol. 2, no. 1, pp. 51 -57, 2000.
16. S. Guha, R. Rastogi, and K. Shim, "CURE: An efficient clustering algorithm for large databases," SIGMOD Record, vol. 27, no. 2, pp. 73-84, 1998.
17. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases," SIGMOD Record, vol. 25, no. 2, pp. 103-114, 1996.
18. C. Zhang and Y. Huang, "Cluster By: A new SQL extension for spatial data aggregation," in Proc. 15th GIS, 2007, pp. 1-4.
19. W. Yan and P. Larson, "Eager Aggregation and Lazy Aggregation," in Proc. 21th VLDB, 1995, pp. 345-357.
20. P. Larson. "Data reduction by partial preaggregation," in Proc. 18th ICDE, 2002, pp. 706-715.
21. C. Galindo-Legaria and M. Joshi, "Orthogonal optimization of subqueries and aggregation," SIGMOD Record, vol. 30, no. 2, pp. 571-581, 2001.
22. J. Goldstein and P. Larson, "Optimizing queries using materialized views: a practical, scalable solution," SIGMOD Record, vol. 30, no. 2, pp. 331-342, 2001.
23. S. Cohen, W. Nutt, and Y. Sagiv, "Rewriting Queries with Arbitrary Aggregation Functions Using Views," ACM Transactions on Database Systems, vol. 31, no. 2, pp. 672-715, 2006.
24. S. Cohen, "User-defined aggregate functions: bridging theory and practice," in Proc. SIGMOD, 2006, pp. 49-60.
25. E. Schallehn, K. Sattler, and G. Saake, "Extensible Grouping and Aggregation for Data Reconciliation," in Proc. 4th EFIS, 2001, pp. 19-32.
26. E. Schallehn and K. Sattler, "Using similarity-based operations for resolving data-level conflicts," in Proc. 20th BNCOD, 2003, pp. 172-189.
27. E. Schallehn, K. Sattler, and G. Saake, "Efficient similarity-based operations for data integration," Data & Knowledge Engineering, vol. 48, no. 3, pp. 361-387, 2004.
28. C. Li, M. Wang, L. Lim, H. Wang, and K. C. Chang, "Supporting ranking and clustering as generalized order-by and group-by," in Proc. SIGMOD, 2007, pp. 127-138.
29. TPC-H Version 2.6.1. [Online]. Available: http://www.tpc.org/tpch