COMBI-operator - Database support for data mining applications

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 429-439

  Hinneburg, Alexander ^a   Habich, Dirk ^a   Lehner, Wolfgang ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATABASE SYSTEMS;

DATA MINING APPLICATIONS; DATABASE SUPPORT; EFFICIENT IMPLEMENTATION; HIGH DIMENSIONAL DATA; LARGE HIGH-DIMENSIONAL DATA; LOW DIMENSIONAL; RESEARCH TOPICS; SYNTHETIC DATASETS;

DATA MINING;

EID: 85012131952     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-012722442-8/50045-8     Document Type: Conference Paper

References (27)

1. Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, and Sunita Sarawagi. On the computation of multidimensional aggregates. In VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India, pages 506-521. Morgan Kaufmann, 1996.
2. Charu C. Aggarwal and Philip S. Yu. Finding generalized projected clusters in high dimensional spaces. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA, pages 70-81. ACM, 2000.
3. Rakesh Agrawal and Kyuseok Shim. Developing tightly-coupled data mining applications on a relational database system. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 287-290. AAAI Press, 1996.
4. Amihood Amir, Reuven Kashi, and Nathan S. Netanyahu. Analyzing quantitative databases: Image is everything. In VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy, pages 89-98. Morgan Kaufmann, 2001.
5. Kevin S. Beyer and Raghu Ramakrishnan. Bottomup computation of sparse and iceberg cubes. In SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadelphia, Pennsylvania, USA, pages 359-370. ACM Press, 1999.
6. Surajit Chaudhuri, Vivek R. Narasayya, and Sunita Sarawagi. Efficient evaluation of queries with mining predicates. In Proceedings of the 18th International Conference on Data Engineering. IEEE Computer Society, 2002.
7. Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy, Amit Shukla, Kristin Tufte, and Yihong Zhao. Cubing algorithms, storage estimation, and storage and processing alternatives for olap. Data Engineering Bulletin, 20(1):3-11, 1997.
8. Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D. Ullman. Computing iceberg queries efficiently. In VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pages 299-310. Morgan Kaufmann, 1998.
9. Johannes Gehrke, Raghu Ramakrishnan, and Venkatesh Ganti. Rainforest - a framework for fast decision tree construction of large datasets. In VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pages 416-427, 1998.
10. Jim Gray, Adam Bosworth, Andrew Layman, and Hamid Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and subtotal. In Proceedings of the Twelfth International Conference on Data Engineering, February 26 - March 1, 1996, New Orleans, Louisiana, pages 152-159. IEEE Computer Society, 1996.
11. Jiawei Han, Jian Pei, Guozhu Dong, and Ke Wang. Efficient computation of iceberg cubes with complex measures. In Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pages 1-12. ACM Press, 2001.
12. Alexander Hinneburg and Daniel A. Keim. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 506-517. Morgan Kaufmann, 1999.
13. Alexander Hinneburg, Daniel A. Keim, and Markus Wawryniuk. Hdeye: Visual mining of highdimensional data (demo). In SIGMOD 2002, Proceedings ACM SIGMOD International Conference on Management of Data, June 3-6, 2002, USA. ACM Press, 2002.
14. Tomasz Imielinski, Aashu Virmani, and Amin Abdulghani. DataMine: application programming interface and query language for database mining. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 256-262. AAAI Press, 1996.
15. Michael Jaedicke and Bernhard Mitschang. Userdefined table operators: Enhancing extensibility for ORDBMS. In VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, 1999, Edinburgh, Scotland, UK, pages 494-505. Morgan Kaufmann, 1999.
16. Theodore Johnson and Dennis Shasha. Some approaches to index design for cube forest. Data Engineering Bulletin, 20(1):27-35, 1997.
17. Rosa Meo, Giuseppe Psaila, and Stefano Ceri. A new SQL-like operator for mining association rules. In VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, 1996, Mumbai (Bombay), India, pages 122-133. Morgan Kaufmann, 1996.
18. Amir Netz, Surajit Chaudhuri, Usama M. Fayyad, and Jeff Bernhardt. Integrating data mining with SQL databases: OLE DB for data mining. In Proceedings of the 17th International Conference on Data Engineering, pages 379-387. IEEE Computer Society, 2001.
19. Carlos Ordonez and Paul Cereghini. SQLEM: fast clustering in SQL using the EM algorithm. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 559-570. ACM Press, 2000.
20. Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 418-427. ACM Press, 2002.
21. Kenneth A. Ross and Divesh Srivastava. Fast computation of sparse datacubes. In VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece, pages 116-125. Morgan Kaufmann, 1997.
22. Nick Roussopoulos, Yannis Kotidis, and Mema Roussopoulos. Cubetree: Organization of and bulk updates on the data cube. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 89-99. ACM Press, 1997.
23. Sunita Sarawagi, Shiby Thomas, and Rakesh Agrawal. Integrating association rule mining with relational database systems: alternatives and implications. In Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pages 343-354. ACM Press, 1998.
24. Kai-Uwe Sattler and Oliver Dunemann. SQL database primitives for decision tree classifiers. In Proceedings of the tenth international Conference on Information and Knowledge Management, pages 379-386, 2001.
25. Shalom Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, and Arnon Rosenthal. Query flocks: A generalization of association-rule mining. In SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, 1998, Seattle, Washington, USA, pages 1-12. ACM Press, 1998.
26. Haixun Wang and Carlo Zaniolo. Using SQL to build new aggregates and extenders for object-relational systems. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, pages 166-175. Morgan Kaufmann, 2000.
27. Yihong Zhao, Prasad Deshpande, and Jeffrey F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 159-170. ACM Press, 1997.