메뉴 건너뛰기




Volumn , Issue , 2006, Pages 156-162

i-DBF: An improved bloom filter representation method on dynamic set

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM PROCESSES;

EID: 38649124348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GCCW.2006.53     Document Type: Conference Paper
Times cited : (5)

References (8)
  • 1
    • 39049092006 scopus 로고    scopus 로고
    • Theory and Network Application of Dynamic Bloom Filters
    • Deke Guo, Honghui Chen, Xueshan Luo, "Theory and Network Application of Dynamic Bloom Filters", IEEE INFOCOM, 2006.
    • (2006) IEEE INFOCOM
    • Guo, D.1    Chen, H.2    Luo, X.3
  • 3
    • 38649131196 scopus 로고    scopus 로고
    • Bloom Filter Survey, Computer
    • Mingzhong Xiao, Yafei Dai, Xiaoming Li, "Bloom Filter Survey", Computer Science, 31(4)2004,pp180-184
    • (2004) Science , vol.31 , Issue.4 , pp. 180-184
    • Xiao, M.1    Dai, Y.2    Li, X.3
  • 4
    • 0014814325 scopus 로고
    • Space/time tradeoffs in hash coding with allowable errors
    • July
    • B. Bloom, "Space/time tradeoffs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
    • (1970) Commun. ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 5
    • 0034206002 scopus 로고    scopus 로고
    • Summary cache: A scalable widearea web cache sharing protocol
    • Fan L, Cao P, Almeida J, Broder A, "Summary cache: a scalable widearea web cache sharing protocol", IEEE/ACM Trans. on Networking, vol.8,no.3,pp.281-293,2000.
    • (2000) IEEE/ACM Trans. on Networking , vol.8 , Issue.3 , pp. 281-293
    • Fan, L.1    Cao, P.2    Almeida, J.3    Broder, A.4
  • 6
  • 7
    • 8344263038 scopus 로고    scopus 로고
    • Kumar A, Xu J, Wang J, Spatschek O, Li L, Space-Code bloom filter for efficient per-flow traffic measurement,in: Proc. of the Conference on Computer Communications (IEEE INFOCOM), 2004, pp. 1762-1773.
    • Kumar A, Xu J, Wang J, Spatschek O, Li L, "Space-Code bloom filter for efficient per-flow traffic measurement",in: Proc. of the Conference on Computer Communications (IEEE INFOCOM), 2004, pp. 1762-1773.


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