Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bloom_filter> ?p ?o. }
Showing items 1 to 80 of
80
with 100 items per page.
- Bloom_filter 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; i.e. 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 impracticably large hash area in 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 (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)).".
- Bloom_filter thumbnail Bloom_filter.svg?width=300.
- Bloom_filter wikiPageExternalLink cacheefficientbloomfilters-wea2007.pdf.
- Bloom_filter wikiPageExternalLink books?id=0bAYl6d7hvkC&pg=PA110.
- Bloom_filter wikiPageExternalLink php-bloom-filter.
- Bloom_filter wikiPageExternalLink bloomfilter.
- Bloom_filter wikiPageExternalLink Bloom_filter_(C).
- Bloom_filter wikiPageExternalLink OceanStore.pdf.
- Bloom_filter wikiPageExternalLink dbloom.pdf.
- Bloom_filter wikiPageExternalLink bloomfilter.
- Bloom_filter wikiPageExternalLink bloomfilter.
- Bloom_filter wikiPageExternalLink 000881.html.
- Bloom_filter wikiPageExternalLink a-garden-variety-of-bloom-filters.
- Bloom_filter wikiPageExternalLink 1.0.2.
- Bloom_filter wikiPageExternalLink scalablebloomfilters.
- Bloom_filter wikiPageExternalLink esa2006b.pdf.
- Bloom_filter wikiPageExternalLink bloomers.html.
- Bloom_filter wikiPageExternalLink bloomFilter.ts.
- Bloom_filter wikiPageExternalLink DupDet06Sigmod.pdf.
- Bloom_filter wikiPageExternalLink Infocom12_VICBF.pdf.
- Bloom_filter wikiPageExternalLink CacheDigests.
- Bloom_filter wikiPageExternalLink 13.html.
- Bloom_filter wikiPageExternalLink ancs6819-dharmapurikar.pdf.
- Bloom_filter wikiPageExternalLink bloom-filters-verification.html.
- Bloom_filter wikiPageExternalLink spin-3spin.html.
- Bloom_filter wikiPageExternalLink bloom-filters-in-scala.
- Bloom_filter wikiPageExternalLink lsq.pdf.
- Bloom_filter wikiPageExternalLink node8.html.
- Bloom_filter wikiPageExternalLink itw2006.pdf.
- Bloom_filter wikiPageExternalLink nelson.pdf.
- Bloom_filter wikiPageExternalLink esa06.pdf.
- Bloom_filter wikiPageExternalLink im2005b.pdf.
- Bloom_filter wikiPageExternalLink abs_all.jsp?isnumber=4444031&arnumber=4444089&count=113&index=57.
- Bloom_filter wikiPageExternalLink bloom.pdf.
- Bloom_filter wikiPageExternalLink 61-bloom-filters-in-tcl.html.
- Bloom_filter wikiPageExternalLink why-bloom-filters-work-the-way-they-do.
- Bloom_filter wikiPageExternalLink bloom_filters.html.
- Bloom_filter wikiPageExternalLink bloom-filters-a-powerful-tool-599.html.
- Bloom_filter wikiPageExternalLink r09p02.pdf.
- Bloom_filter wikiPageExternalLink watch?v=947gWqwkhu0.
- Bloom_filter wikiPageExternalLink citation.cfm?doid=362686.362692.
- Bloom_filter wikiPageExternalLink Orestes-Bloomfilter.
- Bloom_filter wikiPageExternalLink libbf.
- Bloom_filter wikiPageExternalLink node-bloem.
- Bloom_filter wikiPageExternalLink Bloom::Filter.
- Bloom_filter wikiPageExternalLink drs-bloom-filter.
- Bloom_filter wikiPageID "602211".
- Bloom_filter wikiPageRevisionID "602326401".
- Bloom_filter hasPhotoCollection Bloom_filter.
- Bloom_filter subject Category:Hashing.
- Bloom_filter subject Category:Lossy_compression_algorithms.
- Bloom_filter subject Category:Probabilistic_data_structures.
- Bloom_filter type Abstraction100002137.
- Bloom_filter type Arrangement105726596.
- Bloom_filter type Cognition100023271.
- Bloom_filter type DataStructure105728493.
- Bloom_filter type ProbabilisticDataStructures.
- Bloom_filter type PsychologicalFeature100023100.
- Bloom_filter type Structure105726345.
- Bloom_filter comment "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; i.e. 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).".
- Bloom_filter label "Bloom filter".
- Bloom_filter label "Bloomfilter".
- Bloom_filter label "Filtr Blooma".
- Bloom_filter label "Filtre de Bloom".
- Bloom_filter label "Фильтр Блума".
- Bloom_filter label "ブルームフィルタ".
- Bloom_filter label "布隆过滤器".
- Bloom_filter sameAs Bloomův_filtr.
- Bloom_filter sameAs Bloomfilter.
- Bloom_filter sameAs Filtre_de_Bloom.
- Bloom_filter sameAs ブルームフィルタ.
- Bloom_filter sameAs 블룸_필터.
- Bloom_filter sameAs Filtr_Blooma.
- Bloom_filter sameAs m.02vfzg.
- Bloom_filter sameAs Q885373.
- Bloom_filter sameAs Q885373.
- Bloom_filter sameAs Bloom_filter.
- Bloom_filter wasDerivedFrom Bloom_filter?oldid=602326401.
- Bloom_filter depiction Bloom_filter.svg.
- Bloom_filter isPrimaryTopicOf Bloom_filter.