Adding a reference

lemire · Feb 20, 2014 · f77cf69 · f77cf69
1 parent ec6ef9b
commit f77cf69
Show file tree

Hide file tree

Showing 4 changed files with 18 additions and 4 deletions.
diff --git a/src/main/java/com/googlecode/javaewah/EWAHCompressedBitmap.java b/src/main/java/com/googlecode/javaewah/EWAHCompressedBitmap.java
@@ -66,13 +66,15 @@
  *         ewahBitmap1, ewahBitmap2, ewahBitmap3, ewahBitmap4);
  * </pre>
  * <p>
- * For more details, see the following paper:
+ * For more details, see the following papers:
  * </p>
  * 
  * <ul>
  * <li>Daniel Lemire, Owen Kaser, Kamel Aouiche, Sorting improves word-aligned
  * bitmap indexes. Data &amp; Knowledge Engineering 69 (1), pages 3-28, 2010. <a
  * href="http://arxiv.org/abs/0901.3751">http://arxiv.org/abs/0901.3751</a></li>
+ * <li> Owen Kaser and Daniel Lemire, Compressed bitmap indexes: beyond unions and intersections
+ * <a href="http://arxiv.org/abs/1402.4466">http://arxiv.org/abs/1402.4466</a></li>
  * </ul>
  * 
  * <p>

diff --git a/src/main/java/com/googlecode/javaewah/symmetric/ThresholdFuncBitmap.java b/src/main/java/com/googlecode/javaewah/symmetric/ThresholdFuncBitmap.java
@@ -7,8 +7,13 @@
  * A threshold Boolean function returns true if the number of true values exceed
  * a threshold. It is a symmetric Boolean function.
  * 
- * This object is not thread safe: you should use one function per thread.
+ * This class implements an algorithm described in the following paper:
  * 
+ * Owen Kaser and Daniel Lemire, Compressed bitmap indexes: beyond unions and intersections
+ * <a href="http://arxiv.org/abs/1402.4466">http://arxiv.org/abs/1402.4466</a>
+ * 
+ * It is not thread safe: you should use one object per thread.
+ *  
  * @see <a
  *      href="http://en.wikipedia.org/wiki/Symmetric_Boolean_function">http://en.wikipedia.org/wiki/Symmetric_Boolean_function</a>
  * @author Daniel Lemire

diff --git a/src/main/java/com/googlecode/javaewah32/EWAHCompressedBitmap32.java b/src/main/java/com/googlecode/javaewah32/EWAHCompressedBitmap32.java
@@ -63,13 +63,15 @@
  * programs.
  * </p>
  * <p>
- * For more details, see the following paper:
+ * For more details, see the following papers:
  * </p>
  * 
  * <ul>
  * <li>Daniel Lemire, Owen Kaser, Kamel Aouiche, <a
  * href="http://arxiv.org/abs/0901.3751">Sorting improves word-aligned bitmap
  * indexes</a>. Data &amp; Knowledge Engineering 69 (1), pages 3-28, 2010.</li>
+ * <li> Owen Kaser and Daniel Lemire, Compressed bitmap indexes: beyond unions and intersections
+ * <a href="http://arxiv.org/abs/1402.4466">http://arxiv.org/abs/1402.4466</a></li>
  * </ul>
  * 
  * @see com.googlecode.javaewah.EWAHCompressedBitmap EWAHCompressedBitmap

diff --git a/src/main/java/com/googlecode/javaewah32/symmetric/ThresholdFuncBitmap32.java b/src/main/java/com/googlecode/javaewah32/symmetric/ThresholdFuncBitmap32.java
@@ -7,7 +7,12 @@
  * A threshold Boolean function returns true if the number of true values exceed
  * a threshold. It is a symmetric Boolean function.
  * 
- * This object is not thread safe: you should use one function per thread.
+ * This class implements an algorithm described in the following paper:
+ * 
+ * Owen Kaser and Daniel Lemire, Compressed bitmap indexes: beyond unions and intersections
+ * <a href="http://arxiv.org/abs/1402.4466">http://arxiv.org/abs/1402.4466</a>
+ * 
+ * It is not thread safe: you should use one object per thread.
  * 
  * @see <a
  *      href="http://en.wikipedia.org/wiki/Symmetric_Boolean_function">http://en.wikipedia.org/wiki/Symmetric_Boolean_function</a>