FAQ
Looks interesting, I was only annoyed when I saw "new Vector<Integer>()",
which is synchronized, in the iterator code - which is the thing that is
most important for DocIdSets.... Looks like stone ages.

Else I would simply give it a try by rewriting the class to also implement
DocIdSet and return the optimized iterator (not the one in this class). You
can then try to replace some OpenBitSets in any filters and perf test?

Uwe

-----
Uwe Schindler
H.-H.-Meier-Allee 63, D-28213 Bremen
http://www.thetaphi.de
eMail: uwe@thetaphi.de

-----Original Message-----
From: Peter Karich
Sent: Friday, November 05, 2010 3:38 PM
To: dev@lucene.apache.org
Subject: fast bitset

Hi,

would this compressed and fast(?) bitset be interesting for solr/lucene or is
openbitset already done this way?
quoting from github:

The goal of word-aligned compression is not to achieve the best
compression,
but rather to improve query processing time.

License is GPL version 3 and ASL2.0.

http://code.google.com/p/javaewah
https://github.com/lemire/javaewah

I just saw it on twitter ...

Regards,
Peter.

--
http://jetwick.com twitter search prototype


---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org

Search Discussions

Discussion Posts

Previous

Follow ups

Related Discussions

Discussion Navigation
viewthread | post
posts ‹ prev | 2 of 5 | next ›
Discussion Overview
groupdev @
categorieslucene
postedNov 5, '10 at 2:37p
activeNov 5, '10 at 9:52p
posts5
users3
websitelucene.apache.org

People

Translate

site design / logo © 2021 Grokbase