Supporting ranking and clustering as generalized order-by and group-by

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 127-138

  Li, Chengkai ^a   Wang, Min ^b   Lim, Lipyeow ^b   Wang, Haixun ^b   Chang, Kevin Chen Chuan ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Clustering; Data exploration; Grouping; Query processing; Ranking; Retrieval; Top k

Indexed keywords

BOOLEAN SEMANTICS; CLUSTERRANK QUERY; DATA EXPLORATION; DATABASE QUERIES;

BOOLEAN FUNCTIONS; CLUSTERING ALGORITHMS; DATA MINING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; SEMANTICS;

QUERY PROCESSING;

EID: 35448944026     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247496     Document Type: Conference Paper

References (31)

1. S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis. Automated ranking of database query results. In CIDR, 2003.
2. P. Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, 2002.
3. M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219-230, 1997.
4. K. Chakrabarti, S. Chaudhuri, and S. Hwang. Automatic categorization of query results. In SIGMOD, pages 755-766, 2004.
5. C. Y Chan and Y. E. Ioannidis. An efficient bitmap encoding scheme for selection queries. In SIGMOD, 1999.
6. S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In VLDB, pages 397-410, 1999.
7. S. Chaudhuri, R. Ramakrishnan, and G. Weikum. Integrating DB and IR technologies: What is the sound of one hand clapping? In CIDR, pages 1-12, 2005.
8. D. Donjerkovic and R. Ramakrishnan. Probabilistic optimization of top n queries. In VLDB, 1999.
9. R. Fagin, A. Lote, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
10. F. Farnstrom, J. Lewis, and C. Elkan. Scalability for clustering algorithms revisited. 2(1):51-57, August 2000.
11. V. Ganti, J. Gehrke, and R. Ramakrishnan. CACTUS -clustering categorical data using summaries. In KDD, pages 73-83, 1999.
12. M. Gavrilov, D. Anguelov, P. Indyk, and R. Motwani. Mining the stock market (extended abstract): which measure is best? In SIGKDD, pages 487-496, 2000.
13. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, New York, 2000.
14. V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. SIGMOD, 2001.
15. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754-765, 2003.
16. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
17. K. Kerdprasop, N. Kerdprasop, and P. Sattayatham. Weighted k-means for density-biased clustering. In DaWaK, pages 488-497, 2005.
18. B. Larsen and C. Aone. Fast and effective text mining using linear-time document clustering. In SIGKDD, pages 16-22, 1999.
19. A. Leuski and J. Allan. Improving interactive retrieval by combining ranked lists and clustering. In RIAO, pages 665-681, 2000.
20. C. Li, K. C.-C. Chang, I. F. Eyas, and S. Song. RankSQL: Query algebra and optimization for relational top-k queries. In SlGMOD, pages 131-142, 2005.
21. F. Morii. A generalized k-means algorithm with semi-supervised weight coefficients. In ICPR, pages 198-201, 2006.
22. P. E. O'Neil. Model 204 architecture and performance. In Proceedings of the 2nd International Workshop on High Performance Transaction Systems, pages 40-59, 1987.
23. P. E. O'Neil and G. Graefe. Multi-table joins through bitmapped join indices. SIGMOD Record, 24(3):8-11, 1995.
24. P. E. O'Neil and D. Quass. Improved query performance with variant indexes. In SlGMOD, pages 38-49, 1997.
25. G. Sheikholeslami, S. Chatterjee, and A. Zhang. WaveCluster: A multi-resolution clustering approach for very large spatial databases. In VLDB, pages 428-439, 1998.
26. R. R. Sinha, S. Mitra, and M. Winslett. Bitmap indexes for large scientific data sets: A case study. In IPDPS, 2006.
27. W. Wang, J. Yang, and R. R. Muntz. STING: A statistical information grid approach to spatial data mining. In VLDB, pages 186-195, 1997.
28. K. Wu, E. Otoo, and A. Shoshani. Optimizing bitmap indices with efficient compression. ACM TODS, 31(1):1-38, 2006.
29. M.-C. Wu and A. P. Buchmann. Encoded bitmap indexing for data warehouses. In ICDE, pages 220-230, 1998.
30. F. Zemke, K. Kulkami, A. Witkowski, and B. Lyle. Introduction to OLAP function. Change proposal. ANS-NCTS H2-99-14 (April), 1999.
31. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD, pages 103-114, 1996.