-
1
-
-
84883724777
-
-
Microsoft research, database group
-
Autoadmin Project, Microsoft research, database group, http://www.research.microsoft.com/db.
-
Autoadmin Project
-
-
-
2
-
-
85017218169
-
-
WWW page
-
WWW page http://www.cs.helsinki.fi/research/fdk/datamining/tane.
-
-
-
-
6
-
-
0001768775
-
On the structure of Armstrong relations for functional dependencies
-
Catriel Beeri, Martin Dowd, Ronald Fagin, and Richard Statman. On the structure of Armstrong relations for functional dependencies. Journal of the ACM, 31(1):30-46, 1984.
-
(1984)
Journal of the ACM
, vol.31
, Issue.1
, pp. 30-46
-
-
Beeri, C.1
Dowd, M.2
Fagin, R.3
Statman, R.4
-
7
-
-
0022733977
-
An integrated approach to logical design of relational database schemes
-
Catriel Beeri and Michael Kifer. An integrated approach to logical design of relational database schemes. ACM Transaction on Database Systems, 11(2):134-158, 1986.
-
(1986)
ACM Transaction on Database Systems
, vol.11
, Issue.2
, pp. 134-158
-
-
Beeri, C.1
Kifer, M.2
-
8
-
-
0004249508
-
-
North-Holland Mathematical Library 6. American Elsevie 1976, 2d rev. ed. edition
-
Claude Berge. Graphs and Hypergraphs. North-Holland Mathematical Library 6. American Elsevie 1976, 2d rev. ed. edition, 1976.
-
(1976)
Graphs and Hypergraphs
-
-
Berge, C.1
-
9
-
-
85017237088
-
The Asilomar report on database research
-
Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, and Jeffrey D. Ullman. The Asilomar report on database research. SIGMOD Record, 27(4):74-80, 1998.
-
(1998)
SIGMOD Record
, vol.27
, Issue.4
, pp. 74-80
-
-
Bernstein, P.A.1
Brodie, M.L.2
Ceri, S.3
Dewitt, D.J.4
Franklin, M.J.5
Garcia-Molina, H.6
Gray, J.7
Held, G.8
Hellerstein, J.M.9
Jagadish, H.V.10
Lesk, M.11
Maier, D.12
Naughton, J.F.13
Pirahesh, H.14
Stonebraker, M.15
Ullman, J.D.16
-
10
-
-
0032094083
-
Autoadmin 'what-if' index analysis utility
-
Seattle, Washington, USA
-
Surajit Chaudhuri and Vivek R. Narasayya. Autoadmin 'what-if' index analysis utility. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, pages 367-378, 1998.
-
(1998)
Proceedings of the ACM SIGMOD International Conference on Management of Data
, pp. 367-378
-
-
Chaudhuri, S.1
Narasayya, V.R.2
-
13
-
-
0022136032
-
Partition semantics for relations
-
Stavros S. Cosmadakis, Paris C. Kanellakis, and Nicolas Spyratos. Partition semantics for relations. Journal of Computer and System Sciences, 33(2):203-233, 1986.
-
(1986)
Journal of Computer and System Sciences
, vol.33
, Issue.2
, pp. 203-233
-
-
Cosmadakis, S.S.1
Kanellakis, P.C.2
Spyratos, N.3
-
14
-
-
38249007910
-
Muchnik. Functional dependencies in relational databases: A lattice point of view
-
Janos Demetrovics, Leonid Libkin, and Ilya B. Muchnik. Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics, 40:155-185, 1992.
-
(1992)
Discrete Applied Mathematics
, vol.40
, pp. 155-185
-
-
Demetrovics, J.1
Libkin, L.2
Ilya, B.3
-
15
-
-
0009003412
-
-
Technical Report 5, IBM Research Laboratory
-
Ronald Fagin. Armstrong databases. Technical Report 5, IBM Research Laboratory, 1982.
-
(1982)
Armstrong Databases
-
-
Fagin, R.1
-
16
-
-
84976676650
-
Horn clauses and database dependencies
-
Ronald Fagin. Horn clauses and database dependencies. Journal of the ACM, 29(4):952-985, 1982.
-
(1982)
Journal of the ACM
, vol.29
, Issue.4
, pp. 952-985
-
-
Fagin, R.1
-
17
-
-
0025523279
-
Investigations on Armstrong relations, dependency inference, and excluded functional dependencies
-
Georg Gottlob and Leonid Libkin. Investigations on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybernetica, 9(4):385-402, 1990.
-
(1990)
Acta Cybernetica
, vol.9
, Issue.4
, pp. 385-402
-
-
Gottlob, G.1
Libkin, L.2
-
18
-
-
0031649138
-
Efficient discovery of functional and approximate dependencies using partitions
-
Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, and Hannu Toivonen. Efficient discovery of functional and approximate dependencies using partitions. In Proceedings of the Fourteenth IEEE International Conference on Data Engineering, pages 392-401, 1998.
-
(1998)
Proceedings of the Fourteenth IEEE International Conference on Data Engineering
, pp. 392-401
-
-
Huhtala, Y.1
Kärkkäinen, J.2
Porkka, P.3
Toivonen, H.4
-
19
-
-
0026916854
-
Discovering functional and inclusion dependencies in relational databases
-
Martti Kantola, Heikki Mannila, Kari-Jouko Räihä, and Harri Siirtola. Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 7:591-607, 1992.
-
(1992)
International Journal of Intelligent Systems
, vol.7
, pp. 591-607
-
-
Kantola, M.1
Mannila, H.2
Kari-Jouko, R.3
Siirtola, H.4
-
20
-
-
0003113325
-
Finding interesting rules from large sets of discovered association rules
-
Gaithersburg, Maryland
-
Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen, and A. Inkeri Verkamo. Finding interesting rules from large sets of discovered association rules. In Proceedings of the Third International Conference on Information and Knowledge Management, Gaithersburg, Maryland, pages 401-407, 1994.
-
(1994)
Proceedings of the Third International Conference on Information and Knowledge Management
, pp. 401-407
-
-
Klemettinen, M.1
Mannila, H.2
Ronkainen, P.3
Toivonen, H.4
Inkeri Verkamo, A.5
-
23
-
-
84956858187
-
Discovery of \interesting data dependencies from a workload of SQL statements (Poster)
-
Jan M. Zytkow and Jan Rauch, editors, Prague, Czech Republic
-
Stephane Lopes, Jean-Marc Petit, and Farouk Toumani. Discovery of \interesting data dependencies from a workload of SQL statements (poster). In Jan M. Zytkow and Jan Rauch, editors, Proceedings of the Principles of Data Mining and Knowledge Discovery, Prague, Czech Republic, volume 1704, pages 430-435, 1999.
-
(1999)
Proceedings of the Principles of Data Mining and Knowledge Discovery
, vol.1704
, pp. 430-435
-
-
Lopes, S.1
Petit, J.-M.2
Toumani, F.3
-
24
-
-
0022132362
-
Design by example: An application of Armstrong relations
-
Heikki Mannila and Kari-Jouko Räihä. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences, 33(2):126-141, 1986.
-
(1986)
Journal of Computer and System Sciences
, vol.33
, Issue.2
, pp. 126-141
-
-
Mannila, H.1
Räihä, K.-J.2
-
25
-
-
0028377853
-
Algorithms for inferring functional dependencies from relations
-
Heikki Mannila and Kari-Jouko R¨aih¨a. Algorithms for inferring functional dependencies from relations. Data and Knowledge Engineering, 12(1):83-99, 1994.
-
(1994)
Data and Knowledge Engineering
, vol.12
, Issue.1
, pp. 83-99
-
-
Mannila, H.1
Kari-Jouko, R.2
-
27
-
-
21944442464
-
Levelwise search and borders of theories in knowledge discovery
-
Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 241-258
-
-
Mannila, H.1
Toivonen, H.2
-
28
-
-
0025471358
-
Identifying extended entity-relationship object structures in relational schemas
-
V.M. Markowitz and J.A. Makowsky. Identifying extended entity-relationship object structures in relational schemas. IEEE Transactions on Software Engineering, 16(8):777-790, 1990.
-
(1990)
IEEE Transactions on Software Engineering
, vol.16
, Issue.8
, pp. 777-790
-
-
Markowitz, V.M.1
Makowsky, J.A.2
-
29
-
-
84911977993
-
Discovering frequent closed itemsets for association rules
-
Jerusalem, Isräel
-
Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of the Seventh International Conference on Database Theory, Jerusalem, Isräel, pages 398-416, 1999.
-
(1999)
Proceedings of the Seventh International Conference on Database Theory
, pp. 398-416
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
30
-
-
85017199428
-
Mining bases for association rules using galois closed sets (Poster)
-
February 29 - March 3, San Diego, CA, USA. IEEE Computer Society
-
Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Mining bases for association rules using galois closed sets (poster). In Proceedings of the Sixteenth IEEE International Conference on Data Engineering, February 29 - March 3, San Diego, CA, USA. IEEE Computer Society, 2000.
-
(2000)
Proceedings of the Sixteenth IEEE International Conference on Data Engineering
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
32
-
-
0023310620
-
The partition model: A deductive database model
-
Nicolas Spyratos. The partition model: A deductive database model. ACM Transaction on Database Systems, 12(1):1-37, 1987.
-
(1987)
ACM Transaction on Database Systems
, vol.12
, Issue.1
, pp. 1-37
-
-
Spyratos, N.1
|