License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2018.8
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8700/
Go to the corresponding LIPIcs Volume Portal


Hooshmand, Sahar ; Abedin, Paniz ; Külekci, M. Oguzhan ; Thankachan, Sharma V.

Non-Overlapping Indexing - Cache Obliviously

pdf-format:
LIPIcs-CPM-2018-8.pdf (0.5 MB)


Abstract

The non-overlapping indexing problem is defined as follows: pre-process a given text T[1,n] of length n into a data structure such that whenever a pattern P[1,p] comes as an input, we can efficiently report the largest set of non-overlapping occurrences of P in T. The best known solution is by Cohen and Porat [ISAAC, 2009]. Their index size is O(n) words and query time is optimal O(p+nocc), where nocc is the output size. We study this problem in the cache-oblivious model and present a new data structure of size O(n log n) words. It can answer queries in optimal O(p/(B)+log_B n+nocc/B) I/Os, where B is the block size.

BibTeX - Entry

@InProceedings{hooshmand_et_al:LIPIcs:2018:8700,
  author =	{Sahar Hooshmand and Paniz Abedin and M. Oguzhan K{\"u}lekci and Sharma V. Thankachan},
  title =	{{Non-Overlapping Indexing - Cache Obliviously}},
  booktitle =	{Annual Symposium on Combinatorial Pattern Matching  (CPM 2018)},
  pages =	{8:1--8:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-074-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{105},
  editor =	{Gonzalo Navarro and David Sankoff and Binhai Zhu},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8700},
  doi =		{10.4230/LIPIcs.CPM.2018.8},
  annote =	{Keywords: Suffix Trees, Cache Oblivious, Data Structure, String Algorithms}
}

Keywords: Suffix Trees, Cache Oblivious, Data Structure, String Algorithms
Seminar: Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Issue Date: 2018
Date of publication: 11.05.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI