Discovering roll-up dependencies

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Discovering roll-up dependencies

Full text

Pdf (994 KB)

Source

International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents

San Diego, California, United States

Pages: 213 - 222

Year of Publication: 1999

ISBN:1-58113-143-7

Authors

Jef Wijsen	University of Antwerp
Raymond T. Ng	University of British Columbia
Toon Calders	University of Antwerp

Sponsors

SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 27, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/312129.312232 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AIS93	Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
	Cal99	T. Calders. Het ontdekken van roll-up afhankelijkheden in databases. Master's thesis, University of Antwerp, 1999. In Dutch.
	GCB+97	Jim Gray , Surajit Chaudhuri , Adam Bosworth , Andrew Layman , Don Reichart , Murali Venkatrao , Frank Pellow , Hamid Pirahesh, Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals, Data Mining and Knowledge Discovery, v.1 n.1, p.29-53, 1997 [doi>10.1023/A:1009726021843]
	Han97	j. Han. O LAP mining: An integration of O LAP with data mining. In Proceedings of the 7th IFIP 2.6 Working Conference on Database Semantics (D$-7), pages 1-9, 1997.
	HCC93	J. Han , Y. Cai , N. Cercone, Data-Driven Discovery of Quantitative Rules in Relational Databases, IEEE Transactions on Knowledge and Data Engineering, v.5 n.1, p.29-40, February 1993 [doi>10.1109/69.204089]
	HRU96	Venky Harinarayan , Anand Rajaraman , Jeffrey D. Ullman, Implementing data cubes efficiently, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.205-216, June 04-06, 1996, Montreal, Quebec, Canada
	KMRS92	M. Kantola, H. Mannila, K.-J. R/iiha, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. Internat. Journal of Intelligent Systems, 7:591-607, 1992.
	MT97	Heikki Mannila , Hannu Toivonen, Levelwise Search and Borders of Theories in KnowledgeDiscovery, Data Mining and Knowledge Discovery, v.1 n.3, p.241-258, 1997 [doi>10.1023/A:1009796218281]
	SA96	Ramakrishnan Srikant , Rakesh Agrawal, Mining quantitative association rules in large relational tables, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.1-12, June 04-06, 1996, Montreal, Quebec, Canada
	WBBJ97	X. Sean Wang , Claudio Bettini , Alexander Brodsky , Sushil Jajodia, Logical design for temporal databases with multiple granularities, ACM Transactions on Database Systems (TODS), v.22 n.2, p.115-170, June 1997 [doi>10.1145/249978.249979]
	Wij99	Jef Wijsen, Temporal FDs on complex objects, ACM Transactions on Database Systems (TODS), v.24 n.1, p.127-176, March 1999 [doi>10.1145/310701.310715]
	WM98	Jef Wijsen , Robert Meersman, On the Complexity of Mining Quantitative Association Rules, Data Mining and Knowledge Discovery, v.2 n.3, p.263-281, September 1998 [doi>10.1023/A:1009755120593]
	WN98	J. Wijsen and R.T. Ng. Discovering rollup dependencies. Technical report, The University of British Columbia, Dept. of Computer Science, 1998. Also available at http: //www. uia. ua. ac. be/u/j wij sen/.

CITED BY 2

	Toon Calders , Raymond T. Ng , Jef Wijsen, Searching for dependencies at multiple abstraction levels, ACM Transactions on Database Systems (TODS), v.27 n.3, p.229-260, September 2002
	Jef Wijsen, Trends in Databases: Reasoning and Mining, IEEE Transactions on Knowledge and Data Engineering, v.13 n.3, p.426-438, May 2001