Pattern Masking for Dictionary Matching

06/29/2020 βˆ™ by Panagiotis Charalampopoulos, et al. βˆ™ 0 βˆ™

In the Pattern Masking for Dictionary Matching (PMDM) problem, we are given a dictionary π’Ÿ of d strings, each of length β„“, a query string q of length β„“, and a positive integer z, and we are asked to compute a smallest set KβŠ†{1,…,β„“}, so that if q[i], for all i∈ K, is replaced by a wildcard, then q matches at least z strings from π’Ÿ. The PMDM problem lies at the heart of two important applications featured in large-scale real-world systems: record linkage of databases that contain sensitive information, and query term dropping. In both applications, solving PMDM allows for providing data utility guarantees as opposed to existing approaches. We first show, through a reduction from the well-known k-Clique problem, that a decision version of the PMDM problem is NP-complete, even for strings over a binary alphabet. We present a data structure for PMDM that answers queries over π’Ÿ in time π’ͺ(2^β„“/2(2^β„“/2+Ο„)β„“) and requires space π’ͺ(2^β„“d^2/Ο„^2+2^β„“/2d), for any parameter Ο„βˆˆ[1,d]. We also approach the problem from a more practical perspective. We show an π’ͺ((dβ„“)^k/3+dβ„“)-time and π’ͺ(dβ„“)-space algorithm for PMDM if k=|K|=π’ͺ(1). We generalize our exact algorithm to mask multiple query strings simultaneously. We complement our results by showing a two-way polynomial-time reduction between PMDM and the Minimum Union problem [ChlamtÑč et al., SODA 2017]. This gives a polynomial-time π’ͺ(d^1/4+Ο΅)-approximation algorithm for PMDM, which is tight under plausible complexity conjectures.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.