Sufficient conditions for efficient indexing under different matchings

Amihood Amir, Eitan Kondratovsky

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

5 Scopus citations


The most important task derived from the massive digital data accumulation in the world, is efficient access to this data, hence the importance of indexing. In the last decade, many different types of matching relations were defined, each requiring an efficient indexing scheme. Cole and Hariharan in a ground breaking paper [Cole and Hariharan, SIAM J. Comput., 33(1):26–42, 2003], formulate sufficient conditions for building an efficient indexing for quasi-suffix collections, collections that behave as suffixes. It was shown that known matchings, including parameterized, 2-D array and order preserving matchings, fit their indexing settings. In this paper, we formulate more basic sufficient conditions based on the order relation derived from the matching relation itself, our conditions are more general than the previously known conditions.

Original languageEnglish
Title of host publication30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
EditorsNadia Pisanti, Solon P. Pissis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771030
StatePublished - 1 Jun 2019
Event30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, Italy
Duration: 18 Jun 201920 Jun 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019

Bibliographical note

Publisher Copyright:
© Amihood Amir and Eitan Kondratovsky.


  • General matching relations
  • Off-the-shelf indexing algorithms
  • Weaker sufficient conditions for indexing


Dive into the research topics of 'Sufficient conditions for efficient indexing under different matchings'. Together they form a unique fingerprint.

Cite this