-
1
-
-
0003928313
-
-
Addison-Wesley Reading, MA
-
Abiteboul, S., Hull, R., & Vianu, V. (1995). Foundations of databases. Reading, MA: Addison-Wesley.
-
(1995)
Foundations of Databases
-
-
Abiteboul, S.1
Hull, R.2
Vianu, V.3
-
2
-
-
12244313034
-
Approximating a collection of frequent sets
-
ACM Washington, USA
-
Afrati, F. N., Gionis, A., & Mannila H. (2004). Approximating a collection of frequent sets. In W. Kim, R. Kohavi, J. Gehrke, & W. DuMouchel (Eds.), International conference on knowledge discovery and data mining (KDD'04) (pp. 2-19). Washington, USA: ACM.
-
(2004)
International Conference on Knowledge Discovery and Data Mining (KDD'04)
, pp. 2-19
-
-
Afrati, F.N.1
Gionis, A.2
Mannila, H.3
Kim, W.4
Kohavi, R.5
Gehrke, J.6
Dumouchel, W.7
-
3
-
-
0001882616
-
Fast algorithms for mining association rules in large databases
-
Morgan Kaufmann Santiago de Chile, Chile
-
Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), International conference on very large data bases (VLDB'94) (pp. 487-499). Santiago de Chile, Chile: Morgan Kaufmann.
-
(1994)
International Conference on Very Large Data Bases (VLDB'94)
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
Bocca, J.B.3
Jarke, M.4
Zaniolo, C.5
-
4
-
-
35148901629
-
An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing
-
L. Libkin & B. Thalheim (Eds.), Semantics in databases Springer
-
Albrecht, M., Buchholz, E., Düsterhöft, A., & Thalheim, B. (1995). An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. In L. Libkin & B. Thalheim (Eds.), Semantics in databases (Vol. 1358, pp. 1-28). Lecture Notes in Computer Science, Springer.
-
(1995)
Lecture Notes in Computer Science
, vol.1358
, pp. 1-28
-
-
Albrecht, M.1
Buchholz, E.2
Düsterhöft, A.3
Thalheim, B.4
-
5
-
-
34548738941
-
Efficiently detecting inclusion dependencies
-
IEEE Computer Society
-
Bauckmann, J., Leser, U., Naumann, F., & Tietz, V. (2007). Efficiently detecting inclusion dependencies. In International conference on data engineering (ICDE'07) (pp. 1448-1450). IEEE Computer Society.
-
(2007)
International Conference on Data Engineering (ICDE'07)
, pp. 1448-1450
-
-
Bauckmann, J.1
Leser, U.2
Naumann, F.3
Tietz, V.4
-
6
-
-
0003704318
-
-
Irvine,CA:UniversityofCalifornia, DepartmentofInformationandComputerScience
-
Bay, S. D. (1999). The UCI KDD archive [ http://kdd.ics.uci.edu ]. Technical report, Irvine, CA: University of California, Department of Information and Computer Science.
-
(1999)
The UCI KDD Archive
-
-
Bay, S.D.1
-
7
-
-
84948957674
-
Discovery of constraints and data dependencies in databases (extended abstract)
-
N. Lavrac & S. Wrobel (Eds.) European conference on machine learning (ECML'95) Crete, Greece Springer
-
Bell, S., & Brockhausen, P. (1995). Discovery of constraints and data dependencies in databases (extended abstract). In N. Lavrac & S. Wrobel (Eds.), European conference on machine learning (ECML'95) (Vol. 912, pp. 267-270). Crete, Greece: Lecture Notes in Computer Science, Springer.
-
(1995)
Lecture Notes in Computer Science
, vol.912
, pp. 267-270
-
-
Bell, S.1
Brockhausen, P.2
-
8
-
-
33749609778
-
On monotone data mining languages
-
Springer Frascati, Italy
-
Calders, T., & Wijsen, J. (2001). On monotone data mining languages. In G. Ghelli & G. Grahne (Eds.), International workshop on database programming languages (DBPL'01), Frascati, Italy: Springer.
-
(2001)
International Workshop on Database Programming Languages (DBPL'01)
-
-
Calders, T.1
Wijsen, J.2
Ghelli, G.3
Grahne, G.4
-
10
-
-
0008352249
-
Enforcing inclusion dependencies and referencial integrity
-
Los Angeles, CA, USA Morgan Kaufmann
-
Casanova, M. A., Tucherman, L., & Furtado, A. L. (1988). Enforcing inclusion dependencies and referencial integrity. In F. Bancilhon & D. J. DeWitt (Eds.), International conference on very large data bases (VLDB'88) (pp. 38-49). Los Angeles, CA, USA: Morgan Kaufmann.
-
(1988)
International Conference on Very Large Data Bases (VLDB'88)
, pp. 38-49
-
-
Casanova, M.A.1
Tucherman, L.2
Furtado, A.L.3
Bancilhon, F.4
Dewitt, D.J.5
-
11
-
-
0000446742
-
Implementation of two semantic query optimization techniques in DB2 universal database
-
Edinburgh, Scotland, UK Morgan Kaufmann
-
Cheng, Q., Gryz, J., Koo, F., Leung, T. Y. C., Liu, L., Qian, X., et al. (1999). Implementation of two semantic query optimization techniques in DB2 universal database. In M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, & M. L. Brodie (Eds.), International conference on very large data bases (VLDB'99) (pp. 687-698). Edinburgh, Scotland, UK: Morgan Kaufmann.
-
(1999)
International Conference on Very Large Data Bases (VLDB'99)
, pp. 687-698
-
-
Cheng, Q.1
Gryz, J.2
Koo, F.3
Leung, T.Y.C.4
Liu, L.5
Qian, X.6
Atkinson, M.P.7
Orlowska, M.E.8
Valduriez, P.9
Zdonik, S.B.10
Brodie, M.L.11
-
12
-
-
0036366837
-
Mining database structure; Or, how to build a data quality browser
-
Madison, WI, USA
-
Dasu, T., Johnson, T., Muthukrishnan, S., & Shkapenyuk, V. (2002). Mining database structure; or, how to build a data quality browser. In ACM SIGMOD conference 2002 (pp. 240-251). Madison, WI, USA.
-
(2002)
ACM SIGMOD Conference 2002
, pp. 240-251
-
-
Dasu, T.1
Johnson, T.2
Muthukrishnan, S.3
Shkapenyuk, V.4
-
13
-
-
84883798941
-
Efficient algorithms for mining inclusion dependencies
-
C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, et al. (Eds.) International conference on extending database technology (EDBT'02) Prague, Czech Republic Springer
-
De Marchi, F., Lopes, S., & Petit, J.-M. (2002). Efficient algorithms for mining inclusion dependencies. In C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, et al. (Eds.), International conference on extending database technology (EDBT'02) (Vol. 2287, pp. 464-476). Prague, Czech Republic: Lecture Notes in Computer Science, Springer.
-
(2002)
Lecture Notes in Computer Science
, vol.2287
, pp. 464-476
-
-
De Marchi, F.1
Lopes, S.2
Petit, J.-M.3
-
14
-
-
2442427019
-
Analysis of existing databases at the logical level: The DBA companion project
-
1
-
F. De Marchi S. Lopes J.-M. Petit F. Toumani 2003 Analysis of existing databases at the logical level: The DBA companion project ACM Sigmod Record 32 1 47 52
-
(2003)
ACM Sigmod Record
, vol.32
, pp. 47-52
-
-
De Marchi, F.1
Lopes, S.2
Petit, J.-M.3
Toumani, F.4
-
15
-
-
34548579999
-
Zigzag: A new algorithm for discovering large inclusion dependencies in relational databases
-
IEEE Computer Society Melbourne, FL, USA
-
De Marchi, F., & Petit, J.-M. (2003). Zigzag: A new algorithm for discovering large inclusion dependencies in relational databases. In International conference on data mining (ICDM'03) (pp. 27-34). Melbourne, FL, USA: IEEE Computer Society.
-
(2003)
International Conference on Data Mining (ICDM'03)
, pp. 27-34
-
-
De Marchi, F.1
Petit, J.-M.2
-
18
-
-
0031705065
-
Query folding with inclusion dependencies
-
Orlando, FL, USA IEEE Computer Society
-
Gryz, J. (1998). Query folding with inclusion dependencies. In International conference on data engineering (ICDE'98) (pp. 126-133). Orlando, FL, USA: IEEE Computer Society.
-
(1998)
International Conference on Data Engineering (ICDE'98)
, pp. 126-133
-
-
Gryz, J.1
-
20
-
-
0345201769
-
TANE: An efficient algorithm for discovering functional and approximate dependencies
-
2
-
Y. Huhtala J. Karkkainen P. Porkka H. Toivonen 1999 TANE: An efficient algorithm for discovering functional and approximate dependencies The Computer Journal 42 2 100 111
-
(1999)
The Computer Journal
, vol.42
, pp. 100-111
-
-
Huhtala, Y.1
Karkkainen, J.2
Porkka, P.3
Toivonen, H.4
-
22
-
-
0029373303
-
Approximate inference of functional dependencies from relations
-
1
-
J. Kivinen H. Mannila 1995 Approximate inference of functional dependencies from relations Theoretical Computer Science 149 1 129 149
-
(1995)
Theoretical Computer Science
, vol.149
, pp. 129-149
-
-
Kivinen, J.1
Mannila, H.2
-
27
-
-
0036556037
-
Functional and approximate dependencies mining: Databases and FCA point of view
-
2/3
-
S. Lopes J.-M. Petit L. Lakhal 2002 Functional and approximate dependencies mining: Databases and FCA point of view Special issue of JETAI 14 2/3 93 114
-
(2002)
Special Issue of JETAI
, vol.14
, pp. 93-114
-
-
Lopes, S.1
Petit, J.-M.2
Lakhal, L.3
-
28
-
-
0036498516
-
Discovering interesting inclusion dependencies: Application to logical database tuning
-
1
-
S. Lopes J.-M. Petit F. Toumani 2002 Discovering interesting inclusion dependencies: Application to logical database tuning Information System 17 1 1 19
-
(2002)
Information System
, vol.17
, pp. 1-19
-
-
Lopes, S.1
Petit, J.-M.2
Toumani, F.3
-
31
-
-
21944442464
-
Levelwise search and borders of theories in knowledge discovery
-
1
-
H. Mannila H. Toivonen 1997 Levelwise search and borders of theories in knowledge discovery Data Mining and Knowledge Discovery 1 1 241 258
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, pp. 241-258
-
-
Mannila, H.1
Toivonen, H.2
-
33
-
-
0020716825
-
The implication problem for functional and inclusion dependencies
-
3
-
J. C. Mitchell 1983 The implication problem for functional and inclusion dependencies Information and Control 56 3 154 173
-
(1983)
Information and Control
, vol.56
, pp. 154-173
-
-
Mitchell, J.C.1
-
34
-
-
0035501368
-
Functional and embedded dependency inference: A data mining point of view
-
7
-
N. Novelli R. Cicchetti 2001 Functional and embedded dependency inference: A data mining point of view Information System 26 7 477 506
-
(2001)
Information System
, vol.26
, pp. 477-506
-
-
Novelli, N.1
Cicchetti, R.2
-
35
-
-
23044518930
-
Integrating association rule mining with relational database systems: Alternatives and implications
-
2/3
-
S. Sarawagi S. Thomas R. Agrawal 2000 Integrating association rule mining with relational database systems: Alternatives and implications Data Mining and Knowledge Discovery 4 2/3 89 125
-
(2000)
Data Mining and Knowledge Discovery
, vol.4
, pp. 89-125
-
-
Sarawagi, S.1
Thomas, S.2
Agrawal, R.3
-
36
-
-
84958780501
-
FastFDs: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances
-
Y. Kambayashi, W. Winiwarter, & M. Arikawa (Eds.) Data warehousing and knowledge discovery (DaWaK'01) Munich, Germany
-
Wyss, C., Giannella, C., & Robertson, E. (2001). FastFDs: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances. In Y. Kambayashi, W. Winiwarter, & M. Arikawa (Eds.), Data warehousing and knowledge discovery (DaWaK'01) (Vol. 2114, pp. 101-110). Munich, Germany: Lecture Notes in Computer Science.
-
(2001)
Lecture Notes in Computer Science
, vol.2114
, pp. 101-110
-
-
Wyss, C.1
Giannella, C.2
Robertson, E.3
|