2026-07-26T11:03:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11871 2024-03-06T10:48:53Z ddc:004 open_access

String Indexing with Compressed Patterns Bille, Philip Gørtz, Inge Li Steiner, Teresa Anna string indexing compression pattern matching Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries. In this paper we consider the basic variant where the pattern is given in compressed form and the goal is to achieve query time that is fast in terms of the compressed size of the pattern. This captures the common client-server scenario, where a client submits a query and communicates it in compressed form to a server. Instead of the server decompressing the query before processing it, we consider how to efficiently process the compressed query directly. Our main result is a novel linear space data structure that achieves near-optimal query time for patterns compressed with the classic Lempel-Ziv 1977 (LZ77) compression scheme. Along the way we develop several data structural techniques of independent interest, including a novel data structure that compactly encodes all LZ77 compressed suffixes of a string in linear space and a general decomposition of tries that reduces the search time from logarithmic in the size of the trie to logarithmic in the length of the pattern. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Philip Bille and Inge Li Gørtz and Teresa Anna Steiner 2020 Is Part Of LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2020.10 urn:nbn:de:0030-drops-118716 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.10 eng https://creativecommons.org/licenses/by/3.0/legalcode