THE VARIANCE OF A PARTIAL MATCH RETRIEVAL IN A MULTIDIMENSIONAL SYMMETRICAL TRIE

被引:6
|
作者
SCHACHINGER, W
机构
[1] Department of Statistics, OR and Computer Science, University of Vienna, Wien
关键词
D O I
10.1002/rsa.3240070106
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Let N records be stored in an M-dimensional trie (M-d trie). It is shown that under the symmetric Bernoulli model the variance of the cost C-N(omega) of a partial match retrieval is Var C-N(omega) = N-u/M.tau(omega)(log(2M) N) + O(N-2u/M-1) with continuous periodic function tau(omega), where u is the number of unspecified components in a query omega of size M. This confirms in quantitative manner a conjecture by Kirschenhofer, Prodinger, and Szpankowski [Int. J. Found. Comput. Sci., 4, 69-84 (1993)], who presented a detailed analysis of Var C-N(omega) in the M = 2, u = 1-case, but used in their proof a transformation formula of Ramanujan, which does not seem to have an analogue for M>2. Our analysis is based on exponential approximations and Mellin inversion. (C) 1995 John Wiley and Sons, Inc.
引用
收藏
页码:81 / 95
页数:15
相关论文
共 50 条
  • [31] Skip Suffix Array: A Partial Match Retrieval Method on Structured Overlay Networks
    Banno, Ryohei
    Shudo, Kazuyuki
    2020 34TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2020), 2020, : 487 - 492
  • [32] Freestyle vs. Boolean: A comparison of partial and exact match retrieval systems
    Paris, LAH
    Tibbo, HR
    INFORMATION PROCESSING & MANAGEMENT, 1998, 34 (2-3) : 175 - 190
  • [33] Load balanced and optimal disk allocation strategy for partial match queries on multidimensional files
    Das, SK
    Pinotti, CM
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (12) : 1211 - 1219
  • [34] A DICTIONARY RETRIEVAL ALGORITHM USING 2 TRIE STRUCTURES
    MORIMOTO, K
    IRIGUCHI, H
    AOE, J
    SYSTEMS AND COMPUTERS IN JAPAN, 1995, 26 (02) : 85 - 97
  • [35] DYNAMIC FILE STRUCTURE FOR PARTIAL MATCH RETRIEVAL BASED ON OVERFLOW BUCKET SHARING.
    Yuen, Tak-Sun
    Du, David Hung-Chang
    IEEE Transactions on Software Engineering, 1986, SE-12 (08) : 801 - 810
  • [36] ON THE VARIANCE OF THE EXTERNAL PATH-LENGTH IN A SYMMETRIC DIGITAL TRIE
    KIRSCHENHOFER, P
    PRODINGER, H
    SZPANKOWSKI, W
    DISCRETE APPLIED MATHEMATICS, 1989, 25 (1-2) : 129 - 143
  • [37] Efficient evaluation of partial match queries for XML documents using information retrieval techniques
    Park, YH
    Whang, KY
    Lee, LS
    Han, WS
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2005, 3453 : 95 - 112
  • [38] An efficient retrieval algorithm for case structures using TRIE
    Koyama, M
    Morta, K
    Mizobuchi, S
    Aoe, J
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 4572 - 4577
  • [39] Data mining of generalized association rules using a method of partial-match retrieval
    Matsumoto, K
    Hayase, T
    Ikeda, N
    DISCOVERY SCIENCE, PROCEEDINGS, 1999, 1721 : 160 - 171
  • [40] Redundant MKH files design among multiple disks for concurrent partial match retrieval
    Chen, CY
    Lin, HF
    Lee, RCT
    Chang, CC
    JOURNAL OF SYSTEMS AND SOFTWARE, 1996, 35 (03) : 199 - 207