Examples of BloomFilter

com.aelitis.azureus.core.util.bloom.BloomFilter
com.bitsofproof.supernode.common.BloomFilter
com.codecademy.eventhub.base.BloomFilter
com.foundationdb.util.BloomFilter
com.jme3.post.filters.BloomFilter
engine.org/wiki/doku.php/jme3:advanced:bloom_and_glow">advanced:bloom_and_glow for more details @author Rémy Bouquet aka Nehon
it.unimi.dsi.util.BloomFilter
joshua.decoder.ff.lm.bloomfilter_lm.BloomFilter
A Bloom filter: a lossy data structure for set representation. A Bloom filter consists of a bit set and a set of hash functions. A Bloom filter has two operations: add and query. We can add an object to a Bloom filter to indicate that it should be considered part of the set that the Bloom filter represents. We can query the Bloom filter to see if a given object is considered part of its set.
An object is added by sending it through a number of hash functions, each of which returns an index into the bit set. The bit at each of the indices is flipped on. We can query for an abject by sending it through the same hash functions. Then we look the bit at each index that was returned by a hash function. If any of the bits is unset, we know that the object is not in the Bloom filter (for otherwise all the bits should have already been set). If all the bits are set, we assume that the object is present in the Bloom filter.
We cannot know for sure that an object is in the bloom filter just because all its bits were set. There may be many collisions in the hash space, and all the bits for some object might be set by chance, rather than by adding that particular object.
The advantage of a Bloom filter is that its set representation can be stored in a significantly smaller space than information-theoretic lossless lower bounds. The price we pay for this is a certain amount of error in the query function. One nice feature of the Bloom filter is that its error is one-sided. This means that while the query function may return false positives (saying an object is present when it really isn't), it can never return false negatives (saying that an object is not present when it was already added.
org.apache.cassandra.utils.BloomFilter
org.apache.hadoop.hbase.migration.nineteen.onelab.filter.BloomFilter
ne-lab.org">European Commission One-Lab Project 034819. @version 1.0 - 2 Feb. 07
org.apache.hadoop.hbase.util.BloomFilter
ne-lab.org">European Commission One-Lab Project 034819.
It must be extended in order to define the real behavior.
org.apache.hadoop.util.bloom.BloomFilter
ne-lab.org">European Commission One-Lab Project 034819. @see Filter The general behavior of a filter @see Space/Time Trade-Offs in Hash Coding with Allowable Errors
org.deuce.transaction.tl2.BloomFilter
Implements Bloom filter map @author Guy Korland @since 1.0
org.elasticsearch.common.bloom.BloomFilter
org.elasticsearch.common.util.BloomFilter
A bloom filter. Inspired by Guava bloom filter implementation though with some optimizations.
org.onelab.filter.BloomFilter
ne-lab.org">European Commission One-Lab Project 034819. @version 1.0 - 2 Feb. 07 @see org.onelab.filter.Filter The general behavior of a filter @see Space/Time Trade-Offs in Hash Coding with Allowable Errors
org.pathways.openciss.rest.impl.BloomFilter

Examples of com.aelitis.azureus.core.util.bloom.BloomFilter

    
    public void
    sentTo(
      DHTTransportContact  contact )
    {
      BloomFilter  filter = sent_to_bloom;
      
      if ( filter == null || filter.getEntryCount() > 100 ){
        
        filter = BloomFilterFactory.createAddOnly(500);
        
        sent_to_bloom  = filter;
      }
    
      filter.add( contact.getID());
    }

View Full Code Here

Examples of com.aelitis.azureus.core.util.bloom.BloomFilter

    
    for (int j=0;j<1000;j++){
      
      long  start = System.currentTimeMillis();
      
      BloomFilter b = new BloomFilterAddRemove8Bit(10000);
      //BloomFilter b = new BloomFilterAddOnly(10000);
      
      int  fp = 0;
      
      for (int i=0;i<1000;i++){
        
        //String  key = "" + rand.nextInt();
        
        byte[]  key = new byte[6];
        
        rand.nextBytes( key );
        
        //key  = getSerialization( key, 6881 );
        
        if ( i%2 == 0 ){
          
          b.add( key  );
        
          if ( !b.contains( key )){
            
            System.out.println( "false negative on add!!!!" );
          }
        }else{
          
          if ( b.contains( key )){
            
            fp++;
          }
        }

View Full Code Here

Examples of com.aelitis.azureus.core.util.bloom.BloomFilter

  {
    int  res = 0;
    
    for (int i=0;i<filters.length;i++){
      
      BloomFilter  filter = filters[i];
      
      int r = filter.remove( value );
      
      if ( filter == current_filter ){
        
        res = r;
      }

View Full Code Here

Examples of com.aelitis.azureus.core.util.bloom.BloomFilter

              new_size = OK_BLOOM_MAX;
            }
            
            log( "Expanding ok bloom to " + new_size + " entries" );
            
            BloomFilter new_ok_bloom   = BloomFilterFactory.createAddOnly( new_size );
  
            PeerManager pm = download.getPeerManager();
            
            if ( pm != null ){
              
              Peer[] peers = pm.getPeers();
              
              for (int i=0;i<peers.length;i++){
                
                byte[]  peer_key = getKey( peers[i] );
                
                if ( peer_key != null && ok_bloom.contains( peer_key )){
                  
                  new_ok_bloom.add( peer_key );
                }
              }
            }
            
            ok_bloom = new_ok_bloom;

View Full Code Here

Examples of com.bitsofproof.supernode.common.BloomFilter

  @Test
  public void bloomTest ()
  {
    int n = 500;
    double falsepositiveTarget = 0.01;
    BloomFilter filter = BloomFilter.createOptimalFilter (n, falsepositiveTarget, UpdateMode.all);
    assertTrue (filter.getFalsePositiveProbability (n) < 0.02);


    List<byte[]> mustHave = new ArrayList<byte[]> ();
    SecureRandom rnd = new SecureRandom ();
    for ( int i = 0; i < n; ++i )
    {
      byte[] data = new byte[32];
      rnd.nextBytes (data);
      mustHave.add (data);
      filter.add (data);
    }
    for ( byte[] data : mustHave )
    {
      assertTrue (filter.contains (data));
    }
    int falsePositive = 0;
    for ( int i = 0; i < n * 100; ++i )
    {
      byte[] data = new byte[32];
      rnd.nextBytes (data);
      if ( filter.contains (data) )
      {
        ++falsePositive;
      }
    }
    assertTrue (falsePositive < 2 * n * 100 * filter.getFalsePositiveProbability (n));
  }

View Full Code Here

Examples of com.codecademy.eventhub.base.BloomFilter

    int id = getId(externalUserId);
    if (id != UserStorage.USER_NOT_FOUND) {
      return id;
    }
    id = super.ensureUser(externalUserId);
    final BloomFilter bloomFilter = bloomFilterProvider.get();
    User user = new User.Builder(externalUserId, Maps.<String, String>newHashMap()).build();
    user.enumerate(new KeyValueCallback() {
      @Override
      public void callback(String key, String value) {
        bloomFilter.add(getBloomFilterKey(key, value));
      }
    });
    bloomFilterDmaList.add(bloomFilter);
    return id;
  }

View Full Code Here

Examples of com.foundationdb.util.BloomFilter

            TAP_OPEN.in();
            try {
                // Usually super.open called first, but needs to be done
                // opposite order here to allow Select_BloomFilter access
                // to the filled BloomFilter in the bindings. 
                BloomFilter filter = loadBloomFilter();
                bindings.setBloomFilter(filterBindingPosition, filter);
                super.open();
            } finally {
                TAP_OPEN.out();
            }

View Full Code Here

Examples of com.jme3.post.filters.BloomFilter

    this.enqueue(new Callable<Integer>(){


      public Integer call() throws Exception {
        if (bloomFilter == null) {
          bloomFilter = new FilterPostProcessor(assetManager);
          BloomFilter bf = new BloomFilter(BloomFilter.GlowMode.Objects);
          bf.setBloomIntensity(2.0f);
          bf.setExposurePower(1.3f);
          bloomFilter.addFilter(bf);
          @SuppressWarnings("unused")
          BloomUI bui = new BloomUI(inputManager, bf);
        }
        viewPort.addProcessor(bloomFilter);

View Full Code Here

Examples of it.unimi.dsi.util.BloomFilter

    for ( int i = 0; i < numIndices; i++ ) {
      tempFile[ i ] = new File( localBasename[ i ] + ".temp" );
      temp[ i ] = new CachingOutputBitStream( tempFile[ i ], bufferSize );
      direct[ i ] = new InputBitStream( temp[ i ].buffer() );
      indirect[ i ] = new InputBitStream( tempFile[ i ] );
      if ( bloomFilterPrecision != 0 ) bloomFilter[ i ] = new BloomFilter( globalIndex.numberOfTerms, bloomFilterPrecision );
    }
    int usedIndices;
    MutableString currentTerm = new MutableString();
    Payload payload = null;
    int frequency, globalPointer, localIndex, localPointer, count = -1;

View Full Code Here

Examples of it.unimi.dsi.util.BloomFilter

    final String resolverName = jsapResult.getString( "resolver" );
    //final Class<?> tableClass = jsapResult.getClass( "class" );
    final boolean iso = jsapResult.getBoolean( "iso" );
    String termFile = jsapResult.getString( "termFile" );
    
    BloomFilter filter = null;
    final boolean uniqueURIs = jsapResult.userSpecified( "uniqueUris" ); 
    if ( uniqueURIs ) filter = new BloomFilter( jsapResult.getInt( "uniqueUris" ) );
    
    final Collection<? extends CharSequence> collection;
    if ( termFile == null ) {
      ArrayList<MutableString> termList = new ArrayList<MutableString>();
      final ProgressLogger pl = new ProgressLogger();

View Full Code Here

0 1 2 3 4 5 6

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.