lkml.org 
[lkml]   [2012]   [Aug]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [PATCH 0/5] rbtree based interval tree as a prio_tree replacement
From
Date
On Tue, 2012-08-07 at 00:25 -0700, Michel Lespinasse wrote:
> a faster worst-case complexity of O(k+log N) for stabbing queries in a
> well-balanced prio tree, vs O(k*log N) for interval trees (where k=number
> of matches, N=number of intervals). Now this sounds great, but in practice
> prio trees don't realize this theorical benefit. First, the additional
> constraint makes them harder to update, so that the kernel implementation
> has to simplify things by balancing them like a radix tree, which is not
> always ideal.

Not something spending a great deal of time on, but do you have any idea
what the radix like balancing does the the worst case stabbing
complexity?

Anyway, I like the thing, that prio-tree code always made my head hurt.


\
 
 \ /
  Last update: 2012-08-13 11:03    [W:0.611 / U:0.020 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site