A 2 LEVEL SUPERIMPOSED CODING SCHEME FOR PARTIAL MATCH RETRIEVAL

被引：42

作者：

SACKSDAVIS, R ^{[1
]}

RAMAMOHANARAO, K ^{[1
]}

机构：

[1] UNIV MELBOURNE,DEPT COMP SCI,PARKVILLE,VIC 3052,AUSTRALIA

来源：

关键词：

D O I：

10.1016/0306-4379(83)90013-3

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：273 / 280

页数：8

共 7 条

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

CARDENAS, AF .

[2]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[3] PARTIAL-MATCH RETRIEVAL USING INDEXED DESCRIPTOR FILES [J].

PFALTZ, JL ;

BERMAN, WJ ;

CAGLEY, EM .

[4]

Rivest R. L., 1976, SIAM Journal on Computing, V5, P19, DOI 10.1137/0205003

[5] PARTIAL-MATCH RETRIEVAL VIA THE METHOD OF SUPERIMPOSED CODES [J].

ROBERTS, CS .

[6] APPROXIMATING BLOCK ACCESSES IN DATABASE ORGANIZATIONS [J].

YAO, SB .

[7]

[No title captured]