This paper studies the 1-error dictionary search problem in external memory. The input is a set D of strings whose characters are drawn from a constant-size alphabet. Given a string q, a query reports the ids of all strings in D that are within 1 edit distance from q. We give a structure occupying O(n/B) blocks that answers a query in O(1 + m/wB + k/B) I/Os, where n is the total length of all strings in D, m is the length of q, k is the number of ids reported, w is the size of a machine word, and B is the number of words in a block
We consider the following spelling variants clustering problem: Given a list of distinct words, call...
DOI: 10.1109/DCC.2011.18Given a set D of d patterns of total length n, the dictionary matching probl...
Approximate dictionary matching (checking if a pattern occurs in a collection of strings) is a class...
AbstractIn thedynamic dictionary matchingproblem, a dictionaryDcontains a set of patterns that can c...
Given a dictionary S of n binary strings each of length m,we consider the problem of designing a dat...
Abstract. LetW be a dictionary consisting of n binary strings of length m each, represented as a tri...
In this paper we present different solutions for the problem of indexing a dictionary of strings in ...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
Data warehouses are increasingly storing and managing large scale string data, and dealing with larg...
We introduce a new paradigm for querying strings in external memory, suited to the execution of sequ...
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the s...
A prefix search returns the strings out of a given collection S that start with a given prefix. Trad...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
A gap is a sequence of don’t care characters. In this paper, we study two variants of the dictionary...
We consider the following spelling variants clustering problem: Given a list of distinct words, call...
DOI: 10.1109/DCC.2011.18Given a set D of d patterns of total length n, the dictionary matching probl...
Approximate dictionary matching (checking if a pattern occurs in a collection of strings) is a class...
AbstractIn thedynamic dictionary matchingproblem, a dictionaryDcontains a set of patterns that can c...
Given a dictionary S of n binary strings each of length m,we consider the problem of designing a dat...
Abstract. LetW be a dictionary consisting of n binary strings of length m each, represented as a tri...
In this paper we present different solutions for the problem of indexing a dictionary of strings in ...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
Data warehouses are increasingly storing and managing large scale string data, and dealing with larg...
We introduce a new paradigm for querying strings in external memory, suited to the execution of sequ...
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the s...
A prefix search returns the strings out of a given collection S that start with a given prefix. Trad...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
A gap is a sequence of don’t care characters. In this paper, we study two variants of the dictionary...
We consider the following spelling variants clustering problem: Given a list of distinct words, call...
DOI: 10.1109/DCC.2011.18Given a set D of d patterns of total length n, the dictionary matching probl...
Approximate dictionary matching (checking if a pattern occurs in a collection of strings) is a class...