ESTIMATING ACCESSES IN PARTITIONED SIGNATURE FILE ORGANIZATIONS

被引：9

作者：

CIACCIA, P ^{[1
]}

ZEZULA, P ^{[1
]}

机构：

[1] TECH UNIV BRNO,CS-60200 BRNO,CZECHOSLOVAKIA

来源：

ACM TRANSACTIONS ON INFORMATION SYSTEMS | 1993年 / 11卷 / 02期

关键词：

ACCESS METHOD; INFORMATION RETRIEVAL; PERFORMANCE EVALUATION; SUPERIMPOSED CODING;

D O I：

10.1145/130226.145014

中图分类号：

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

学科分类号：

0812 ;

摘要：

We show that performance of some basic methods for the partitioning of signature files, namely Quick Filter and Fixed Prefix, can be easily evaluated by means of a closed formula. The approximation is based on well-known results from probability theory, and, as shown by simulations, introduces no appreciable errors when compared with the exact, cumbersome formulas used so far. Furthermore, we prove that the exact formulas for the two methods coincide. Although this does not imply that the two methods behave in the same way, it sheds light on the way they could be compared.

引用

页码：133 / 142

页数：10

共 9 条

[1]

[Anonymous], 1968, INTRO PROBABILITY TH

[2] DESCRIPTION AND PERFORMANCE ANALYSIS OF SIGNATURE FILE METHODS FOR OFFICE FILING [J].