ON THE OPTIMAL NESTING ORDER FOR COMPUTING N-RELATIONAL JOINS

被引：92

作者：

IBARAKI, T ^{[1
]}

KAMEDA, T ^{[1
]}

机构：

[1] SIMON FRASER UNIV,DEPT COMP SCI,BURNABY V5A 1S6,BC,CANADA

来源：

ACM TRANSACTIONS ON DATABASE SYSTEMS | 1984年 / 9卷 / 03期

关键词：

D O I：

10.1145/1270.1498

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：482 / 502

页数：21

共 27 条

[1] STRICTLY OPTIMAL SCHEDULES FOR THE CUMULATIVE COST-OPTIMAL SCHEDULING PROBLEM [J].

ABDELWAHAB, HM ;

KAMEDA, T .

COMPUTING, 1980, 24 (01) :61-86

[2]

ADACHI J, 1981, 1981 P NAT C IECE JA

[3]

ADACHI J, 1979, 20TH P NAT C INF SOC, P743

[4]

Astrahan M. M., 1976, ACM Transactions on Database Systems, V1, P97, DOI 10.1145/320455.320457

[5] USING SEMI-JOINS TO SOLVE RELATIONAL QUERIES [J].

BERNSTEIN, PA ;

CHIU, DMW .

JOURNAL OF THE ACM, 1981, 28 (01) :25-40

[6] POWER OF NATURAL SEMIJOINS [J].

BERNSTEIN, PA ;

GOODMAN, N .

SIAM JOURNAL ON COMPUTING, 1981, 10 (04) :751-771

[7] STORAGE AND ACCESS IN RELATIONAL DATA-BASES [J].

BLASGEN, MW ;

ESWARAN, KP .

IBM SYSTEMS JOURNAL, 1977, 16 (04) :363-377

[8] ANALYSIS AND PERFORMANCE OF INVERTED DATA BASE STRUCTURES [J].

CARDENAS, AF .

COMMUNICATIONS OF THE ACM, 1975, 18 (05) :253-263

[9]

CODD EF, 1970, COMMUN ACM, V13, P377, DOI [10.1145/362384.362685, 10.1145/357980.358007]

[10]

Date C.-J., 1975, INTRO DATA BASE SYST

← 1 2 3 →