| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <JCEPIPKHCJGDMPOHDOIGIELCDFAA.gary@intrepid.com> Date: Mon, 17 Jul 2006 21:27:55 -0700 From: "Gary Funck" <gary@...repid.com> To: "Linux Kernel Mailing List" <linux-kernel@...r.kernel.org> Cc: "Vishal Patil" <vishpat@...il.com> Subject: RE: Generic B-tree implementation Vishal Patil wrote: > > I am attaching source files containing a very generic implementation > of B-trees in C. The implementation corresponds to in memory B-Tree > data structure. The B-tree library consists of two files, btree.h and > btree.c. I am also attaching a sample program main.c which should > hopefully make the use of the library clear. Couple of thoughts: 1. red/black b-trees have superior worst case performance as it relates to rebalancing, and the implementation doesn't add a lot of complexity: http://www.nist.gov/dads/HTML/redblack.html 2. Paul Vixie's b-tree implementation has been around since the mid-80's or so, and simply from an historical perspective is worth a look (comp.sources.unix anyone?): http://www.isc.org/index.pl?/sources/devel/func/avl-subs-2.php 3. GCC uses 'splay trees' to good advantage: http://www.nist.gov/dads/HTML/splaytree.html which have the property that most-recently referenced nodes tend to be higher up in the tree. - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists