Dergi makalesi Açık Erişim
Hooshmand, Sahar; Abedin, Paniz; Kulekci, M. Oguzhan; Thankachan, Sharma V.
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd"> <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/237248</identifier> <creators> <creator> <creatorName>Hooshmand, Sahar</creatorName> <givenName>Sahar</givenName> <familyName>Hooshmand</familyName> <affiliation>Univ Cent Florida, Dept Comp Sci, Orlando, FL 32816 USA</affiliation> </creator> <creator> <creatorName>Abedin, Paniz</creatorName> <givenName>Paniz</givenName> <familyName>Abedin</familyName> <affiliation>Univ Cent Florida, Dept Comp Sci, Orlando, FL 32816 USA</affiliation> </creator> <creator> <creatorName>Kulekci, M. Oguzhan</creatorName> <givenName>M. Oguzhan</givenName> <familyName>Kulekci</familyName> <affiliation>Istanbul Tech Univ, Informat Inst, Istanbul, Turkey</affiliation> </creator> <creator> <creatorName>Thankachan, Sharma V.</creatorName> <givenName>Sharma V.</givenName> <familyName>Thankachan</familyName> <affiliation>Univ Cent Florida, Dept Comp Sci, Orlando, FL 32816 USA</affiliation> </creator> </creators> <titles> <title>I/O-Efficient Data Structures For Non-Overlapping Indexing</title> </titles> <publisher>Aperta</publisher> <publicationYear>2021</publicationYear> <dates> <date dateType="Issued">2021-01-01</date> </dates> <resourceType resourceTypeGeneral="Text">Journal article</resourceType> <alternateIdentifiers> <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/237248</alternateIdentifier> </alternateIdentifiers> <relatedIdentifiers> <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.tcs.2020.12.006</relatedIdentifier> </relatedIdentifiers> <rightsList> <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights> <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights> </rightsList> <descriptions> <description descriptionType="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, m] 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]. The size of their structure is O (n) words and the query time is optimal O (m + nocc), where nocc is the output size. Later, Ganguly et al. [CPM 2015 and Algorithmica 2020] proposed a compressed space solution. 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 (m/B + log(B) n + nocc/B) I/O operations, where B is the block size. The space can be improved to O (n log(M/B) n) in the cache-aware model, where M is the size of main memory. Additionally, we study a generalization of this problem with an additional range [s, e] constraint. Here the task is to report the largest set of non-overlapping occurrences of P in T, that are within the range [s, e]. We present an O (n log(2) n) space data structure in the cache-aware model that can answer queries in optimal O (m/B + log(B) n + nocc([s,e]) B ) I/O operations, where nocc([s,e]) is the output size.</description> </descriptions> </resource>
Görüntülenme | 14 |
İndirme | 3 |
Veri hacmi | 507 Bytes |
Tekil görüntülenme | 14 |
Tekil indirme | 3 |