In this paper we extend several well-known document listing problems to the case when documents contain a substring that approximately matches the query pattern. We study the scenario when the query string can contain a wildcard symbol that matches any alphabet symbol; all documents that match a query pattern with one wildcard must be enumerated. We describe a linear space data structure that reports all documents containing a substring P in O(∣P∣ + σ (log log log)~(1/2)+docc) time, where σ is the alphabet size and docc is the number of listed documents. We also describe a succinct solution for this problem. Furthermore our approach enables us to obtain an O(nσ)-space data structure that enumerates all documents containing both a pattern P_1 and a pattern P_2 in the special case when P_1 and P_2 differ in one symbol.
展开▼
