| 
|
QuoteRef: gremLL9_1982
topics >
all references >
ThesaHelp:
references g-h
ThesaHelp:
ACM references f-l
Topic:
log-structured rollback-recovery
Topic:
hash filter
Topic:
simulation
Topic:
hash table and hash functions
Reference
Gremillion, L.L., "Designing a Bloom filter for differential file access", Communications of the ACM, 25, 9, pp. 600-604, September 1982. Google
600 ;;Quote: for an online database, recorded update transactions on a differential file and updated at night; better performance, reliability, backup and recovery
601 ;;Quote: used differential file for updating a large administrative database; 30,000 to 60,000 transactions per day
602 ;;Quote: designed Bloom filter for differential file by simulating heavy day and extreme loads
602 ;;Quote: tested several hash functions: division by primes, shifting, folding, and mid-square
603 ;;Quote: found the best Bloom filter for 2,300 unique keys was 3K-4K bytes and three or more transformations; <2% filter error rate
603 ;;Quote: the performance of a Bloom filter depends on its loading factor, the number of set bits
ThesaHelp: references g-h (299 items)
ThesaHelp: ACM references f-l (241 items)
Topic: log-structured rollback-recovery (12 items)
Topic: hash filter (18 items)
Topic: simulation (35 items)
Topic: hash table and hash functions (41 items)