Document listing for queries with excluded pattern
Document Type
Conference Proceeding
Publication Date
7-4-2012
Abstract
Let = {d 1,d 2,...,d D } be a given collection of D string documents of total length n. We consider the problem of indexing such that, whenever two patterns P + and P - comes as an online query, we can list all those documents containing P + but not P -. Let t represent the number of such documents. An index proposed by Fischer et al. (LATIN, 2012) can answer this query in time. However, its space requirement is O(n 3/2) bits. We propose the first linear-space index for this problem with a worst case query time of . © 2012 Springer-Verlag.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
185
Last Page
195
Recommended Citation
Hon, W., Shah, R., Thankachan, S., & Vitter, J. (2012). Document listing for queries with excluded pattern. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354 LNCS, 185-195. https://doi.org/10.1007/978-3-642-31265-6_15
