Map
Index
Random
Help
th

Quote: found the best Bloom filter for 2,300 unique keys was 3K-4K bytes and three or more transformations; <2% filter error rate

topics > all references > references g-h > QuoteRef: gremLL9_1982 , p. 603



Topic:
hash filter

Quotation Skeleton

[For 50,000 transactions including 2,300 unique keys in differential file:] These results indicate that for most day's … more transformations would be quite effective (a filter …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: hash filter (18 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.