Computational Properties of Metaquerying Problems.

@inproceedings{DBLP:conf/pods/AngiulliBIP00,
  author    = {Fabrizio Angiulli and
               Rachel Ben-Eliyahu-Zohary and
               Giovambattista Ianni and
               Luigi Palopoli},
  title     = {Computational Properties of Metaquerying Problems},
  booktitle = {Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium
               on Principles of Database Systems, May 15-17, 2000, Dallas, Texas,
               USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-214-X},
  pages     = {237-244},
  ee        = {http://doi.acm.org/10.1145/335168.335227, db/conf/pods/AngiulliBIP00.html},
  crossref  = {DBLP:conf/pods/00},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Printed Edition

Online Edition: ACM Digital Library

References

[1]

Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216 BibTeX

[2]

Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX

[3]

David A. Mix Barrington, Neil Immerman, Howard Straubing: On Uniformity within NC¹. J. Comput. Syst. Sci. 41(3): 274-306(1990) BibTeX

[4]

Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis: On the Desirability of Acyclic Database Schemes. J. ACM 30(3): 479-513(1983) BibTeX

[5]

Rachel Ben-Eliyahu-Zohary, Ehud Gudes: Towards Efficient Metaquerying. IJCAI 1999: 800-805 BibTeX

[6]

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 BibTeX

[7]

Carmel Domshlak, D. Gershkovich, Ehud Gudes, N. Liusternik, Amnon Meisels, Tzachi Rosen, Solomon Eyal Shimony: FlexiMine - A Flexible Platform for KDD Research and Application Construction. KDD 1998: 184-188 BibTeX

[8]

Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, Ramasamy Uthurusamy (Eds.): Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press 1996, ISBN 0-262-56097-6
Contents BibTeX

[9]

...

[10]

Yongjian Fu, Jiawei Han: Meta-Rule-Guided Mining of Association Rules in Relational Databases. KDOOD/TDOOD 1995: 39-46 BibTeX

[11]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[12]

Georg Gottlob, Nicola Leone, Francesco Scarcello: The Complexity of Acyclic Conjunctive Queries. FOCS 1998: 706-715 BibTeX

[13]

Bob Kero, Lucian Russell, Shalom Tsur, Wei-Min Shen: An Overview of Database Mining Techniques. KDOOD/TDOOD 1995: 1-8 BibTeX

[14]

Wei-Min Shen, KayLiang Ong, Bharat G. Mitbander, Carlo Zaniolo: Metaqueries for Data Mining. Advances in Knowledge Discovery and Data Mining 1996: 375-398 BibTeX

[15]

Walter L. Ruzzo: On Uniform Circuit Complexity. J. Comput. Syst. Sci. 22(3): 365-383(1981) BibTeX

[16]

...

[17]

Wei-Min Shen, Bing Leng: A Metapattern-Based Automated Discovery Loop for Integrated Data Mining - Unsupervised Learning of Relational Patterns. IEEE Trans. Knowl. Data Eng. 8(6): 898-910(1996) BibTeX

[18]

Larry J. Stockmeyer: The Polynomial-Time Hierarchy. Theor. Comput. Sci. 3(1): 1-22(1976) BibTeX

[19]

Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146 BibTeX