메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1-12

Exact pattern matching with feed-forward Bloom filters

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; PATTERN MATCHING;

EID: 84875615876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972917.1     Document Type: Conference Paper
Times cited : (8)

References (22)
  • 3
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. V. Aho and M. J. Corasick, Efficient string matching: An aid to bibliographic search, Communications of the ACM, 18 (1975), pp. 333-340.
    • (1975) Communications of the ACM , vol.18 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 5
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, 13 (1970), pp. 422-426.
    • (1970) Communications of the ACM , vol.13 , pp. 422-426
    • Bloom, B.H.1
  • 6
  • 17
    • 52349121903 scopus 로고    scopus 로고
    • Same performance: Building a better bloom filter
    • Less hashing, same performance: Building a better bloom filter, Random Structures & Algorithms, 33 (2008), pp. 187-218.
    • (2008) Random Structures & AlgoRithms , vol.33 , pp. 187-218
    • Hashing, L.1
  • 18
    • 77955099121 scopus 로고    scopus 로고
    • Profiling and accelerating string matching algorithms in three network content security applications
    • P.-c. Lin, Z.-x. Li, Y.-d. Lin, and Y.-c. Lai, Profiling and accelerating string matching algorithms in three network content security applications, IEEE Communications Surveys & Tutorials, 8 (2006).
    • (2006) IEEE Communications Surveys & Tutorials , vol.8
    • Lin, P.-C.1    Li, Z.-X.2    Lin, Y.-D.3    Lai, Y.-C.4
  • 19
  • 20
    • 84957686939 scopus 로고    scopus 로고
    • Approximate multiple string search
    • Springer-Verlag
    • R. Muth and U. Manber, Approximate multiple string search, in Proceedings CPM'96, LNCS 1075, Springer-Verlag, 1996, pp. 75-86.
    • (1996) Proceedings CPM'96, LNCS 1075 , pp. 75-86
    • Muth, R.1    Manber, U.2
  • 21
    • 37149047145 scopus 로고    scopus 로고
    • Cache-, hashand space-eficient bloom filters
    • Springer Berlin/Heidelberg
    • F. Putze, P. Sanders, and S. Johannes, Cache-, hashand space-eficient bloom filters, in Experimental Algorithms, Springer Berlin/Heidelberg, 2007, pp. 108-121.
    • (2007) Experimental Algorithms , pp. 108-121
    • Putze, F.1    Sanders, P.2    Johannes, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.