Discovery of high-dimensional inclusion dependencies

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 683-685

  Koeller, Andreas ^a   Rundensteiner, Elke A ^b  

^a MONTCLAIR STATE UNIVERSITY   (United States)

^b Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH DIMENSIONAL INCLUSION DEPENDENCY; HYPERGRAPHS; REAL WORLD DATA SETS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; GRAPH THEORY; MANAGEMENT INFORMATION SYSTEMS; METADATA; PROBLEM SOLVING; REAL TIME SYSTEMS;

RELATIONAL DATABASE SYSTEMS;

EID: 0345359159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2003.1260834     Document Type: Conference Paper

References (7)

1. R. Agrawal and S. Ramakrishnan. Fast algorithms for mining association rules. In Proc. Intl. Conf. on Very Large Databases (VLDB), pages 487-499, 1994.
2. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, September 1973.
3. F. de Marchi, S. Lopes, and J.-M. Petit. Efficient algorithms for mining inclusion dependencies. In Proceedings of International Conference on Extending Database Technology (EDBT), pages 464-476, 2002.
4. M. Kantola, H. Mannila, K. J. Räihä, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. International J. of Intelligent Systems, 7:591-607, 1992.
5. A. Koeller and E. A. Rundensteiner. Discovery of high-dimensional inclusion dependencies. Technical Report WPI-CS-Tr-02-15, Worcester Polytechnic Institute, Dept. of Computer Science, 2002.
6. A. J. Lee, A. Koeller, A. Nica, and E. A. Rundensteiner. Data Warehouse Evolution: Trade-offs between Quality and Cost of Query Rewritings. In Proceedings of IEEE International Conference on Data Engineering, Special Poster Session, page 255, Sydney, Australia, March 1999.
7. M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering (TKDE), 12 (3):372-390, May/June 2000.