Bug#472099: ITP: libcoveb -- cache oblivious van Emde Boas stratified tree optimized for 32-bit integers

[Rudi Cilibrasi <cilibrar@debian.org>]

Package: wnpp
Severity: wishlist
Owner: Rudi Cilibrasi <cilibrar@debian.org>


* Package name    : libcoveb
  Version         : 1.0.3
  Upstream Author : Rudi Cilibrasi <cilibrar@cilibrar.com>
* URL             : http://www.complearn.org/
* License         : BSD
  Programming Lang: C
  Description     : cache oblivious van Emde Boas stratified tree optimized for 32-bit integers

Sometimes, O(log n)  performance is just not fast enough for very large
sorted queues.  When dealing with millions of elements, a theoretically
ideal choice is implemented in this library and tuned for high speed
throughput of at least a millions operations per second at all queue
sizes from one up to four billion entries.  Using a sophisticated
overlapping key tree representation, O(log(log n)) performance is
achieved in this priority queue implementation.  In practice, this means
it uses less time and memory than typical range finding data structures
like binary trees or B-Trees.

-- System Information:
Debian Release: testing/unstable
  APT prefers stable
  APT policy: (500, 'stable')
Architecture: i386 (i686)
Shell:  /bin/sh linked to /bin/bash
Kernel: Linux 2.6.8-2-686
Locale: LANG=en_US, LC_CTYPE=en_US (charmap=ISO-8859-1)