Partial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables

Abstract

Consider an m-bit query q to a bitwise trie T . A wildcard ∗ is an unspecified bit in q for which the query asks the membership in both cases ∗ = 0 and ∗ = 1. It is common that such partial-match queries with wildcards are issued in tries. With uniformly random occurrences of w wildcards in q assumed, the obvious upper bound on the average number of traversal steps in T is 2m. We show that the average does not exceed m+ 1 w + 1 ( 2 − 2w − 4 )

Extracted Key Phrases

Cite this paper

@article{Fukuyama2016PartialMatchQW, title={Partial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables}, author={Junichiro Fukuyama}, journal={CoRR}, year={2016}, volume={abs/1601.04213} }