diff --git a/src/OpaqueVal.cc b/src/OpaqueVal.cc
index efdd890f70..19a372c005 100644
--- a/src/OpaqueVal.cc
+++ b/src/OpaqueVal.cc
@@ -578,6 +578,11 @@ size_t BloomFilterVal::Count(const Val* val) const
 	return cnt;
 	}
 
+void BloomFilterVal::Clear()
+	{
+	bloom_filter->Clear();
+	}
+
 BloomFilterVal* BloomFilterVal::Merge(const BloomFilterVal* x,
                                       const BloomFilterVal* y)
 	{
diff --git a/src/OpaqueVal.h b/src/OpaqueVal.h
index ea704cb70a..cfb184fc77 100644
--- a/src/OpaqueVal.h
+++ b/src/OpaqueVal.h
@@ -125,6 +125,7 @@ public:
 
 	void Add(const Val* val);
 	size_t Count(const Val* val) const;
+	void Clear();
 
 	static BloomFilterVal* Merge(const BloomFilterVal* x,
 				     const BloomFilterVal* y);
diff --git a/src/probabilistic/BloomFilter.cc b/src/probabilistic/BloomFilter.cc
index 5613dcce05..c78cd4193d 100644
--- a/src/probabilistic/BloomFilter.cc
+++ b/src/probabilistic/BloomFilter.cc
@@ -74,6 +74,11 @@ size_t BasicBloomFilter::K(size_t cells, size_t capacity)
 	return std::ceil(frac * std::log(2));
 	}
 
+void BasicBloomFilter::Clear()
+	{
+	bits->Clear();
+	}
+
 BasicBloomFilter* BasicBloomFilter::Merge(const BasicBloomFilter* x,
                                           const BasicBloomFilter* y)
 	{
@@ -191,3 +196,8 @@ size_t CountingBloomFilter::CountImpl(const Hasher::digest_vector& h) const
 
 	return min;
 	}
+
+void CountingBloomFilter::Clear()
+	{
+	cells->Clear();
+	}
diff --git a/src/probabilistic/BloomFilter.h b/src/probabilistic/BloomFilter.h
index 4a6b01c484..55bc76fca7 100644
--- a/src/probabilistic/BloomFilter.h
+++ b/src/probabilistic/BloomFilter.h
@@ -47,6 +47,11 @@ public:
 		return CountImpl((*hasher)(x));
 		}
 
+	/**
+	 * Removes all elements, i.e., resets all bits in the underlying bit vector.
+	 */
+	virtual void Clear() = 0;
+
 	/**
 	 * Serializes the Bloom filter.
 	 *
@@ -147,6 +152,9 @@ public:
 	 */
 	static size_t K(size_t cells, size_t capacity);
 
+	// Overridden from BloomFilter.
+	virtual void Clear();
+
 	/**
 	 * Merges two basic Bloom filters.
 	 *
@@ -188,6 +196,9 @@ public:
 	 */
 	CountingBloomFilter(const Hasher* hasher, size_t cells, size_t width);
 
+	// Overridden from BloomFilter.
+	virtual void Clear();
+
 	/**
 	 * Merges two counting Bloom filters.
 	 *
diff --git a/src/probabilistic/CounterVector.cc b/src/probabilistic/CounterVector.cc
index 570ed1f8ea..00fa7fb8c0 100644
--- a/src/probabilistic/CounterVector.cc
+++ b/src/probabilistic/CounterVector.cc
@@ -70,6 +70,11 @@ bool CounterVector::Decrement(size_type cell, count_type value)
 	return carry;
 	}
 
+void CounterVector::Clear()
+	{
+	bits->Clear();
+	}
+
 CounterVector::count_type CounterVector::Count(size_type cell) const
 	{
 	assert(cell < Size());
diff --git a/src/probabilistic/CounterVector.h b/src/probabilistic/CounterVector.h
index 178a68e8f2..896f98ef1e 100644
--- a/src/probabilistic/CounterVector.h
+++ b/src/probabilistic/CounterVector.h
@@ -77,6 +77,11 @@ public:
 	 */
 	count_type Count(size_type cell) const;
 
+	/**
+	 * Sets all counters to 0.
+	 */
+	void Clear();
+
 	/**
 	 * Retrieves the number of cells in the storage.
 	 *
diff --git a/src/probabilistic/bloom-filter.bif b/src/probabilistic/bloom-filter.bif
index cbbff85d7d..9df168be0e 100644
--- a/src/probabilistic/bloom-filter.bif
+++ b/src/probabilistic/bloom-filter.bif
@@ -121,6 +121,22 @@ function bloomfilter_lookup%(bf: opaque of bloomfilter, x: any%): count
 	return new Val(0, TYPE_COUNT);
 	%}
 
+## Removes all elements from a Bloom filter. This function sets resets all bits
+## in the underlying bitvector to 0 but does not change the parameterization of
+## the Bloom filter, such as the element type and the hasher seed.
+##
+## bf: The Bloom filter handle.
+function bloomfilter_clear%(bf: opaque of bloomfilter%): any
+	%{
+	BloomFilterVal* bfv = static_cast<BloomFilterVal*>(bf);
+
+	if ( bfv->Type() ) // Untyped Bloom filters are already empty.
+		bfv->Clear();
+
+	return 0;
+	%}
+
+
 ## Merges two Bloom filters.
 ##
 ## bf1: The first Bloom filter handle.