ON THE DESIRABILITY OF ACYCLIC DATABASE SCHEMES

被引：447

作者：

BEERI, C

FAGIN, R

MAIER, D

YANNAKAKIS, M

机构：

[1] IBM CORP,RES LAB K51-281,SAN JOSE,CA 95193

[2] SUNY STONY BROOK,STONY BROOK,NY 11794

[3] BELL TEL LABS INC,MURRAY HILL,NJ 07974

来源：

JOURNAL OF THE ACM | 1983年 / 30卷 / 03期

关键词：

D O I：

10.1145/2402.322389

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：479 / 513

页数：35

共 45 条

[1]

Aho A. V., 1979, ACM Transactions on Database Systems, V4, P297, DOI 10.1145/320083.320091

[2]

Armstrong W., 1974, INFORM PROCESSING, P580

[3]

Bachman CW., 1969, DATA BASE, V1, P4, DOI 10.1145/1017466.1017467

[4]

BATINI C, 1981, 7TH P INT C GRAPH TH

[5] EQUIVALENCE OF RELATIONAL DATABASE SCHEMES [J].

BEERI, C ;

MENDELZON, AO ;

SAGIV, Y ;

ULLMAN, JD .

SIAM JOURNAL ON COMPUTING, 1981, 10 (02) :352-370

[6]

BEERI C, 1981, 13TH P ANN ACM S THE, P355

[7]

BEERI C, 1977, 1977 P ACM SIGMOD IN, P47

[8]

BEERI C, 1981, ADV DATABASE THEORY, P25

[9]

BEERI C, 1980, RJ2722 IBM RES LAB R

[10]

Berge C., 1976, GRAPHS HYPERGRAPHS

← 1 2 3 4 5 →