Computational properties of metaquerying problems

ACM Transactions on Computational Logic

Volumn 4, Issue 2, 2003, Pages 149-180

  Angiulli, Fabrizio ^a   Ben Eliyahu Zohary, Rachel ^b   Ianni, Giovambattista ^c   Palopoli, Luigi ^d  

^a CNR   (Italy)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c UNIVERSITY OF CALABRIA   (Italy)

^d UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

Author keywords

Computational complexity; Data mining

Indexed keywords

COMPUTATIONAL PROPERTIES; DATA COMPLEXITY; DATA RESOURCES; METAQUERYING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA REDUCTION; RESEARCH;

QUERY LANGUAGES;

EID: 0042410625     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/635499.635501     Document Type: Article

References (33)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of databases. Addison-Wesley, Reading Mass.
2. 0 and arithmetic circuits. J. Comput. Syst. Sci. 60, 2, 395-421.
3. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (Washington, D.C.). P. Buneman and S. Jajodia, Eds. ACM, New York, 207-216.
4. 0 circuits with negative constants. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (Brno, Czech Republic). 409-417.
5. ANGLUTN, D. 1980. On counting problems and the polynomial-time hierarchy. Theoret. Comput. Sci. 12, 161-173.
6. 1. J. Comput. Syst. Sci. 41, 3, 274-306.
7. BEERI, C., FAGIN, R., YANNAKAKIS, M., AND MAIER, D. 1983. On the desirability of acyclic database schemas. J. ACM 30, 3, 479-513.
8. BEN-ELIYAHU-ZOHARY, R. AND GUDES, E. 1999. Towards efficient metaquerying. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (Stockholm, Sweden). 800-805.
9. BERNSTEIN, P. AND GOODMAN, N. 1981. The power of natural semijoins. SIAM J. Comput. 10, 4, 751-771.
10. CHANDRA, A. K. AND MERLIN, P. M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Conference Record of the 9th Annual ACM Symposium on Theory of Computing (Boulder, Col.). ACM, New York, 77-90.
11. DOMSHLAK, C., GERSHKOVICH, D., GUDES, E., LTUSTERNIK, N., MEISELS, A., ROSEN, T., AND SHIMONY, S. E. 1998a. FlexiMine-homepage. Ben-Gurion University, Mathematics and Computer Science. Tel-Aviv, Israel, URL: www.cs.bgu.ac.il/~kdd.
12. DOMSHLAK, C., GERSHKOVICH, D., GUDES, E., LIUSTERNIK, N., MEISELS, A., ROSEN, T., AND SHIMONY, S. E. 1998b. FlexiMine - A flexible platform for KDD research and application construction. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98) (New York City, New York).
13. DYER, M. E. AND FRIEZE, A. M. 1988. On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17, 5, 967-974.
14. FAYYAD, U., PIATETSKY-SHAPIRO, G., SMYTH, P., AND UTHURUSAMY, R. 1996. Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press.
15. FU, Y. AND HAN, J. 1995. Meta-rule-guided mining of association rules in relational databases. In DOOD95 Workshop on Integration of Knowledge Discovery with Deductive and Object Oriented Databases (Singapore). 1-8.
16. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman.
17. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 3, 579-627.
18. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2001. The complexity of acyclic conjunctive queries. J. ACM 48, 3.
19. JOHNSON, D. S. 1990. A Catalog of Complexity Classes, Chap. 2. In Handbook of Theoretical Computer Science, J. van Leenwen, Ed. Elsevier and MIT Press. 69-161.
20. KERO, B., RUSSELL, L., TSUR, S., AND SHEN, W. M. 1995. An overview of data mining technologies. In Workshop on Integration of Knowledge Discovery with Deductive and Object Oriented Databases (DOOO95). (Singapore).
21. LENG, B. AND SHEN, W. 1996. A metapattern-based automated discovery loop for integrated data mining-Unsupervised learning of relational patterns. IEEE Trans. Knowl. Data Eng. 8, 6, 898-910.
22. MITBANDER, B. G., ONG, K., SHEN, W., AND ZANIOLO, C. 1996. Metaqueries for data mining, Chap. 15. In Advances in Knowledge Discovery and Data Mining, V. Fayyad, G. Piatetsky-Shapiro P. Smyth, and R. Uthurusamy, Eds., 375-398.
23. RUZZO, W. L. 1981. On uniform circuit complexity. J. Comput. Syst. Sci. 22, 3, 365-383.
24. SHEN, W. M. 1992. Discovering regularities from knowledge bases. Int. Syst. 7, 7, 623-636.
25. SIMON, J. 1975. On some central problems in computational complexity. Ph.D. dissertation. Dept. of Computer Science, Cornell University, Ithaca, NY.
26. STOCKMEYER, L. J. 1976. The polynomial-time hierarchy. Theoret. Comput. Sci. 3, 1, 1-22.
27. TORÁN, J. 1988. An oracle characterization of the counting hierarchy. In Proceedings of the 3rd conference on Structure in Complexity Theory (Washington D.C.). 213-223.
28. ULLMAN, J. D. 1988. Principle of database and knowledge-base systems. Principle of computer science series. Computer Science Press, Inc.
29. VALIANT, L. G. 1979a. The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201.
30. VALIANT, L. G. 1979b. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3, 410-421.
31. VAN LEEUWEN (ED.), J. 1990. Handbook of Theoretical Computer Science. Elsevier and MIT Press.
32. VARDI, M. Y. 1982. The complexity of relational query languages. In. Proceedings of the 14th ACM SIGACT Symposium on Theory of Computing (San Francisco, Calif). ACM, New York, 137-146.
33. WAGNER, K. 1986. The complexity of combinatorial problems with succinct input representation. Acta Inf. 23, 325-356.