TY - GEN
T1 - Document retrieval with one wildcard
AU - Lewenstein, Moshe
AU - Munro, J. Ian
AU - Nekrich, Yakov
AU - Thankachan, Sharma V.
N1 - Funding Information: Early parts of this work appeared in MFCS 2014 [1] . Work is supported by NSERC of Canada and the Canada Research Chairs program.
PY - 2014
Y1 - 2014
N2 - 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 n + 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.
AB - 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 n + 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.
UR - https://www.scopus.com/pages/publications/84906223264
U2 - 10.1007/978-3-662-44465-8_45
DO - 10.1007/978-3-662-44465-8_45
M3 - Conference contribution
SN - 9783662444641
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 529
EP - 540
BT - Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PB - Springer Verlag
T2 - 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Y2 - 25 August 2014 through 29 August 2014
ER -