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 条
  • [41] An analytic approach to the asymptotic variance of trie statistics and related structures
    Fuchs, Michael
    Hwang, Hsien-Kuei
    Zacharovas, Vytas
    THEORETICAL COMPUTER SCIENCE, 2014, 527 : 1 - 36
  • [42] Binary Search on Trie Levels with a Bloom Filter for Longest Prefix Match
    Lee, Jungwon
    Lim, Hyesook
    2014 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2014, : 38 - 43
  • [43] Perfect Match in Video Retrieval
    Lubos, Sebastian
    Rubino, Massimiliano
    Tautschnig, Christian
    Tautschnig, Markus
    Wen, Boda
    Schoeffmann, Klaus
    Felfernig, Alexander
    MULTIMEDIA MODELING, MMM 2023, PT I, 2023, 13833 : 634 - 639
  • [44] MULTIATTRIBUTE HASHING WITH MULTIPLE FILE COPIES FOR HIGH-PERFORMANCE PARTIAL-MATCH RETRIEVAL
    RAMAMOHANARAO, K
    SHEPHERD, J
    SACKSDAVIS, R
    BIT, 1990, 30 (03): : 404 - 423
  • [45] Index-Trie: Efficient archival and retrieval of network traffic
    Xie, Gaogang
    Su, Jingxiu
    Wang, Xin
    He, Taihua
    Zhang, Guangxing
    Uhlig, Steve
    Salamatian, Kave
    COMPUTER NETWORKS, 2017, 124 : 140 - 156
  • [46] Optimal bucket allocation design of k-ary MKH files for partial match retrieval
    Chen, CY
    Chang, CC
    Lee, RCT
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1997, 9 (01) : 148 - 160
  • [47] Optimal bucket allocation design of k-ary MKH files for partial match retrieval
    Feng Chia Univ, Taichung, Taiwan
    IEEE Trans Knowl Data Eng, 1 (148-160):
  • [48] Testing the myth of the encoding–retrieval match
    Winston D. Goh
    Sharon H. X. Lu
    Memory & Cognition, 2012, 40 : 28 - 39
  • [49] The myth of the encoding-retrieval match
    Nairne, JS
    MEMORY, 2002, 10 (5-6) : 389 - 395
  • [50] Scientific document retrieval using structure encoded string with trie indexing
    Dhar, Sourish
    Roy, Sudipta
    Paul, Arnab
    Information Services and Use, 2022, 42 (02): : 241 - 259