2 research outputs found

    A partition-based efficient algorithm for large scale multiple-strings matching

    No full text
    Abstract. Filtering plays an important role in the Internet security and information retrieval fields, and usually employs multiple-strings matching algorithm as its key part. All the classical matching algorithms, however, perform badly when the number of the keywords exceeds a critical point, which made large scale multiple-strings matching problem a great challenge. Based on the observation that the speed of the classical algorithm
    corecore