해시함수를 여러 개 사용해서 블룸 필터를 구성하면 비트 필드의 길이를 상당히 줄일 수 있습
니다.
32
비트의 비트 필드에서
5
개의 해시함수를 사용하면
32
!/(
27
!
5
!)~
200
,
000
개의 그룹
을 만들 수 있습니다.
3
1
백만 개의 원소 중에서 평균
5
개의 원소가 동일한
5
비트 조합을 갖게
됩니다. 이런 식으로
25K
바이트를 전송하는 대신
4
바이트(
32
비트)만 전송할 수 있습니다.
이를 구현하는 코드는 다음과 같습니다. 간단히 하기 위해 이전 예와 동일한
10
비트 필드를 사
용하지만 관심 원소는 두 가지로 가정했습니다.
>>>fromhelperimport hash256, hash160
>>> bit_field_size =10
>>> bit_field =[0]* bit_field_size ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.