Slide 1

Slide 1 text

Вероятностные структуры данных Сергей Архипов, 2017

Slide 2

Slide 2 text

No content

Slide 3

Slide 3 text

No content

Slide 4

Slide 4 text

curl http://site.com

Slide 5

Slide 5 text

curl -x myproxy.ru:3128 http://site.com

Slide 6

Slide 6 text

curl -x proxy.crawlera.com:8010 http://site.com

Slide 7

Slide 7 text

No content

Slide 8

Slide 8 text

evt evt evt evt evt

Slide 9

Slide 9 text

{ "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "" }

Slide 10

Slide 10 text

{ "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "" }

Slide 11

Slide 11 text

No content

Slide 12

Slide 12 text

collector collector collector

Slide 13

Slide 13 text

{ "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "" } { "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "" } { "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "" } { "user": "sarkhipov", "hostname": "rannts.ru", "ok": 234, "banned": 12, "errors": 3, }

Slide 14

Slide 14 text

Consumer 1 { "user": "sarkhipov", "hostname": "rannts.ru", "ok": 234, "banned": 12, "errors": 3, } Consumer 2 { "user": "sarkhipov", "hostname": "rannts.ru", "ok": 250, "banned": 3, "errors": 0, } Consumer 3 { "user": "sarkhipov", "hostname": "rannts.ru", "ok": 0, "banned": 124, "errors": 84, }

Slide 15

Slide 15 text

INSERT INTO stats ( date, user, hostname, ok, ban, error ) VALUES ( :date, :user, :hostname, :ok, :ban, :error ) ON DUPLICATE KEY UPDATE ok = ok + VALUES(ok), ban = ban + VALUES(ban), error = error + VALUES(error);

Slide 16

Slide 16 text

{ "user": "sarkhipov", "hostname": "rannts.ru", "status": "ok", "status_description": "", "response_time": 2861, }

Slide 17

Slide 17 text

(20 + 10) + 11 = (20 + 11) + 10

Slide 18

Slide 18 text

F(x)=P{σ

Slide 19

Slide 19 text

Ω(N 1 p )

Slide 20

Slide 20 text

collector collector collector pworker pworker pworker

Slide 21

Slide 21 text

No content

Slide 22

Slide 22 text

No content

Slide 23

Slide 23 text

var memCount = 75604275; var memPerSec = 1.38176367782; function updateCount() { next = -(1000 / memPerSec) * Math.log(Math.random()); memCountString = ''+memCount; len = memCountString.length; memCountString = memCountString.substr(0, len - 6) + ’ < span style = ”font - size: 8 px” > < /span>’+memCountString.substr(len-6,3)+‘ < span style = ”font - size: 8 px” > < /span>’+memCountString.substr(len-3,3); ge(‘memCount’).innerHTML = memCountString; memCount = memCount + 1; setTimeout(updateCount, next); } addEvent(window, ‘load’, updateCount);

Slide 24

Slide 24 text

3500 3671 3400 3502 3463 3371 3607 6012 6168 6211 6017

Slide 25

Slide 25 text

3500 3507 3671 3667 3400 3410 3502 3502 3463 3466 3371 3330 3607 3599 6012 6009 6168 6152 6211 6215 6017 6016

Slide 26

Slide 26 text

Count-Min Sketch 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Slide 27

Slide 27 text

Count-Min Sketch 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Slide 28

Slide 28 text

Count-Min Sketch 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1

Slide 29

Slide 29 text

Count-Min Sketch 32 11 1 18 200 126 184 78 1 0 91 59 30 24 8 82 76 34 48 72 11 200 129 136 14

Slide 30

Slide 30 text

Count-Min Sketch 32 11 1 18 200 126 184 78 1 0 91 59 30 24 8 82 76 34 48 72 11 200 129 136 14

Slide 31

Slide 31 text

MinHash J (A , B)= |A∩B| |A∪B| k=[ 1 ε2 ]

Slide 32

Slide 32 text

HyperLogLog 010010000110010101101100011011000110111100100001 b 26 = 64 1001 b = 9 100001 b = 33 σ= 1.04 √2k E= α(k)4k ∑ j 2−M j

Slide 33

Slide 33 text

t-digest

Slide 34

Slide 34 text

t-digest

Slide 35

Slide 35 text

t-digest

Slide 36

Slide 36 text

t-digest X=x 1 , x 2 ,…, x n X={s 1 ,s 2 ,…,s m } s i ={x l e f t(i) ,…, x r i ght(i) }

Slide 37

Slide 37 text

t-digest k(q,δ)≝δ (sin−1 (2q−1) π + 1 2 ) K(i)≝k( r i ght(i) n ,δ)−k( le f t(i)−1 n ,δ) K (i)⩽1 K(i)+K (i+1)>1

Slide 38

Slide 38 text

t-digest

Slide 39

Slide 39 text

t-digest

Slide 40

Slide 40 text

collector collector collector pworker pworker pworker

Slide 41

Slide 41 text

No content

Slide 42

Slide 42 text

Q/A