Document retrieval with one wildcard

Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PublisherSpringer Verlag
Number of pages12
EditionPART 2
ISBN (Print)9783662444641
StatePublished - 2014
Event39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary
Duration: 25 Aug 201429 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume8635 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014

Bibliographical note

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.


Dive into the research topics of 'Document retrieval with one wildcard'. Together they form a unique fingerprint.

Cite this