Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q885373> ?p ?o }
- Q885373 subject Q13288825.
- Q885373 subject Q6467387.
- Q885373 subject Q7445688.
- Q885373 abstract "A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not, thus a Bloom filter has a 100% recall rate. In other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addressed with a "counting" filter). The more elements that are added to the set, the larger the probability of false positives.Bloom proposed the technique for applications where the amount of source data would require an impractically large amount of memory if "conventional" error-free hashing techniques were applied. He gave the example of a hyphenation algorithm for a dictionary of 500,000 words, out of which 90% follow simple hyphenation rules, but the remaining 10% require expensive disk accesses to retrieve specific hyphenation patterns. With sufficient core memory, an error-free hash could be used to eliminate all unnecessary disk accesses; on the other hand, with limited core memory, Bloom's technique uses a smaller hash area but still eliminates most unnecessary accesses. For example, a hash area only 15% of the size needed by an ideal error-free hash still eliminates 85% of the disk accesses, an 85–15 form of the Pareto principle (Bloom (1970)).More generally, fewer than 10 bits per element are required for a 1% false positive probability, independent of the size or number of elements in the set (Bonomi et al. (2006)).".
- Q885373 thumbnail Bloom_filter.svg?width=300.
- Q885373 wikiPageExternalLink OceanStore.pdf.
- Q885373 wikiPageExternalLink bigtable.html.
- Q885373 wikiPageExternalLink DupDet06Sigmod.pdf.
- Q885373 wikiPageExternalLink 13.html.
- Q885373 wikiPageExternalLink bloom-filters-verification.html.
- Q885373 wikiPageExternalLink spin-3spin.html.
- Q885373 wikiPageExternalLink nelson.pdf.
- Q885373 wikiPageExternalLink bloom.pdf.
- Q885373 wikiPageExternalLink cs-2002-10.
- Q885373 wikiPageExternalLink cacheefficientbloomfilters-wea2007.pdf.
- Q885373 wikiPageExternalLink books?id=0bAYl6d7hvkC&pg=PA110.
- Q885373 wikiPageExternalLink dbloom.pdf.
- Q885373 wikiPageExternalLink bloom-filters-fast-and-simple.html.
- Q885373 wikiPageExternalLink a-garden-variety-of-bloom-filters.
- Q885373 wikiPageExternalLink esa2006b.pdf.
- Q885373 wikiPageExternalLink bloomers.html.
- Q885373 wikiPageExternalLink Infocom12_VICBF.pdf.
- Q885373 wikiPageExternalLink CacheDigests.
- Q885373 wikiPageExternalLink ancs6819-dharmapurikar.pdf.
- Q885373 wikiPageExternalLink lsq.pdf.
- Q885373 wikiPageExternalLink node8.html.
- Q885373 wikiPageExternalLink itw2006.pdf.
- Q885373 wikiPageExternalLink esa06.pdf.
- Q885373 wikiPageExternalLink im2005b.pdf.
- Q885373 wikiPageExternalLink abs_all.jsp?isnumber=4444031&arnumber=4444089&count=113&index=57.
- Q885373 wikiPageExternalLink why-bloom-filters-work-the-way-they-do.
- Q885373 wikiPageExternalLink bloom_filters.html.
- Q885373 wikiPageExternalLink r09p02.pdf.
- Q885373 wikiPageExternalLink watch?v=947gWqwkhu0.
- Q885373 wikiPageExternalLink citation.cfm?doid=362686.362692.
- Q885373 wikiPageWikiLink Q11091745.
- Q885373 wikiPageWikiLink Q1120519.
- Q885373 wikiPageWikiLink Q1172333.
- Q885373 wikiPageWikiLink Q131723.
- Q885373 wikiPageWikiLink Q13288825.
- Q885373 wikiPageWikiLink Q1514741.
- Q885373 wikiPageWikiLink Q1584911.
- Q885373 wikiPageWikiLink Q16186120.
- Q885373 wikiPageWikiLink Q1623338.
- Q885373 wikiPageWikiLink Q165596.
- Q885373 wikiPageWikiLink Q175263.
- Q885373 wikiPageWikiLink Q18207010.
- Q885373 wikiPageWikiLink Q182667.
- Q885373 wikiPageWikiLink Q183427.
- Q885373 wikiPageWikiLink Q185359.
- Q885373 wikiPageWikiLink Q185837.
- Q885373 wikiPageWikiLink Q186152.
- Q885373 wikiPageWikiLink Q1992074.
- Q885373 wikiPageWikiLink Q2005893.
- Q885373 wikiPageWikiLink Q207440.
- Q885373 wikiPageWikiLink Q2272153.
- Q885373 wikiPageWikiLink Q2359161.
- Q885373 wikiPageWikiLink Q2410467.
- Q885373 wikiPageWikiLink Q245955.
- Q885373 wikiPageWikiLink Q2512983.
- Q885373 wikiPageWikiLink Q2528185.
- Q885373 wikiPageWikiLink Q2538066.
- Q885373 wikiPageWikiLink Q2638.
- Q885373 wikiPageWikiLink Q2987425.
- Q885373 wikiPageWikiLink Q330079.
- Q885373 wikiPageWikiLink Q3574901.
- Q885373 wikiPageWikiLink Q370502.
- Q885373 wikiPageWikiLink Q379825.
- Q885373 wikiPageWikiLink Q387015.
- Q885373 wikiPageWikiLink Q4115063.
- Q885373 wikiPageWikiLink Q415598.
- Q885373 wikiPageWikiLink Q42478.
- Q885373 wikiPageWikiLink Q466.
- Q885373 wikiPageWikiLink Q478351.
- Q885373 wikiPageWikiLink Q5048219.
- Q885373 wikiPageWikiLink Q5176629.
- Q885373 wikiPageWikiLink Q5337636.
- Q885373 wikiPageWikiLink Q5439682.
- Q885373 wikiPageWikiLink Q595364.
- Q885373 wikiPageWikiLink Q5958887.
- Q885373 wikiPageWikiLink Q5970243.
- Q885373 wikiPageWikiLink Q616639.
- Q885373 wikiPageWikiLink Q6467387.
- Q885373 wikiPageWikiLink Q669163.
- Q885373 wikiPageWikiLink Q7003418.
- Q885373 wikiPageWikiLink Q72237.
- Q885373 wikiPageWikiLink Q72588.
- Q885373 wikiPageWikiLink Q7272897.
- Q885373 wikiPageWikiLink Q735075.
- Q885373 wikiPageWikiLink Q7395156.
- Q885373 wikiPageWikiLink Q7445688.
- Q885373 wikiPageWikiLink Q777.
- Q885373 wikiPageWikiLink Q80585.
- Q885373 wikiPageWikiLink Q8366.
- Q885373 wikiPageWikiLink Q838330.
- Q885373 wikiPageWikiLink Q841783.
- Q885373 wikiPageWikiLink Q865360.
- Q885373 wikiPageWikiLink Q866.
- Q885373 wikiPageWikiLink Q879126.
- Q885373 wikiPageWikiLink Q924044.