메뉴 건너뛰기




Volumn 110, Issue 21, 2010, Pages 944-949

A new analysis of the false positive rate of a Bloom filter

Author keywords

Analysis of algorithms; Bloom filters; Data structures

Indexed keywords

ANALYSIS OF ALGORITHMS; BLOOM FILTERS; EFFICIENT DATA STRUCTURES; FALSE POSITIVE; FALSE POSITIVE RATES; RELATIVE ERRORS; SET MEMBERSHIP;

EID: 77955214744     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.07.024     Document Type: Article
Times cited : (104)

References (9)
  • 1
    • 0014814325 scopus 로고
    • Space/time tradeoffs in hash coding with allowable errors
    • B. Bloom Space/time tradeoffs in hash coding with allowable errors Communications of the ACM 13 7 1970 422 426
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 3
    • 70450232823 scopus 로고    scopus 로고
    • Network applications of Bloom filters: A survey
    • A. Broder, and M. Mitzenmacher Network applications of Bloom filters: a survey Internet Mathematics 1 4 2004 485 509
    • (2004) Internet Mathematics , vol.1 , Issue.4 , pp. 485-509
    • Broder, A.1    Mitzenmacher, M.2
  • 7
    • 0020805173 scopus 로고
    • A second look at Bloom filters
    • J. Mullin A second look at Bloom filters Communications of the ACM 26 8 1983 570 571
    • (1983) Communications of the ACM , vol.26 , Issue.8 , pp. 570-571
    • Mullin, J.1
  • 8
    • 0023401083 scopus 로고
    • Accessing textual documents using compressed indexes of arrays of small Bloom filters
    • J. Mullin Accessing textual documents using compressed indexes of arrays of small Bloom filters The Computer Journal 30 4 1987 343 348
    • (1987) The Computer Journal , vol.30 , Issue.4 , pp. 343-348
    • Mullin, J.1


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