ESTIMATING ACCESSES IN PARTITIONED SIGNATURE FILE ORGANIZATIONS

被引:9
作者
CIACCIA, P [1 ]
ZEZULA, P [1 ]
机构
[1] TECH UNIV BRNO,CS-60200 BRNO,CZECHOSLOVAKIA
关键词
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].
FALOUTSOS, C ;
CHRISTODOULAKIS, S .
ACM TRANSACTIONS ON OFFICE INFORMATION SYSTEMS, 1987, 5 (03) :237-257
[3]  
GRANDI F, 1992, P 15 ACM SIGIR INT C, P286
[4]  
Lee D. L., 1990, Sixth International Conference on Data Engineering (Cat. No.90CH2840-7), P389, DOI 10.1109/ICDE.1990.113492
[5]   PARTITIONED SIGNATURE FILES - DESIGN ISSUES AND PERFORMANCE EVALUATION [J].
LEE, DL ;
LENG, CW .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1989, 7 (02) :158-180
[6]  
LITWIN W, 1980, 6TH P INT C VER LARG, P212
[7]  
RABITTI F, 1990, P 13 INT C RES DEV I, P193
[8]   DYNAMIC PARTITIONING OF SIGNATURE FILES [J].
ZEZULA, P ;
RABITTI, F ;
TIBERIO, P .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1991, 9 (04) :336-369
[9]  
Zezula P., 1989, Network Information Processing Systems. Proceedings of the IFIP TC6/TC8 Open Symposium, P243