Document retrieval with one wildcard

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

doi:10.1007/978-3-662-44465-8_45

Document retrieval with one wildcard

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

Department of Computer Science and Artificial Intelligence

University of Waterloo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

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 ₁ and a pattern P ₂ in the special case when P ₁ and P ₂ differ in one symbol.

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
Publisher	Springer Verlag
Pages	529-540
Number of pages	12
Edition	PART 2
ISBN (Print)	9783662444641
DOIs	https://doi.org/10.1007/978-3-662-44465-8_45
State	Published - 2014
Event	39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary Duration: 25 Aug 2014 → 29 Aug 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	8635 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Country/Territory	Hungary
City	Budapest
Period	25/08/14 → 29/08/14

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.

Funding

Early parts of this work appeared in MFCS 2014 [1] . Work is supported by NSERC of Canada and the Canada Research Chairs program.

Funders
Natural Sciences and Engineering Research Council of Canada
Canada Research Chairs

Access to Document

10.1007/978-3-662-44465-8_45

Cite this

Lewenstein, M., Munro, J. I., Nekrich, Y., & Thankachan, S. V. (2014). Document retrieval with one wildcard. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings (PART 2 ed., pp. 529-540). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8635 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_45

Lewenstein, Moshe ; Munro, J. Ian ; Nekrich, Yakov et al. / Document retrieval with one wildcard. Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. pp. 529-540 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{1da09000d44f48d3a0372b3c0b72f1be,

title = "Document retrieval with one wildcard",

abstract = "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.",

author = "Moshe Lewenstein and Munro, \{J. Ian\} and Yakov Nekrich and Thankachan, \{Sharma V.\}",

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. ; 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 ; Conference date: 25-08-2014 Through 29-08-2014",

year = "2014",

doi = "10.1007/978-3-662-44465-8\_45",

language = "אנגלית",

isbn = "9783662444641",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 2",

pages = "529--540",

booktitle = "Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings",

address = "גרמניה",

edition = "PART 2",

}

Lewenstein, M, Munro, JI, Nekrich, Y & Thankachan, SV 2014, Document retrieval with one wildcard. in Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8635 LNCS, Springer Verlag, pp. 529-540, 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary, 25/08/14. https://doi.org/10.1007/978-3-662-44465-8_45

Document retrieval with one wildcard. / Lewenstein, Moshe; Munro, J. Ian; Nekrich, Yakov et al.
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. p. 529-540 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8635 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84906223264

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 -

Lewenstein M, Munro JI, Nekrich Y, Thankachan SV. Document retrieval with one wildcard. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer Verlag. 2014. p. 529-540. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-662-44465-8_45

Document retrieval with one wildcard

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this