Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] intersecting huge integer sets
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2002-08-27 (12:13)
From: Diego Olivier Fernandez Pons <Diego-Olivier.FERNANDEZ-PONS@c...>
Subject: Re: [Caml-list] intersecting huge integer sets
Markus Mottle a écrit :

> Yes, you'll probably want Patricia trees. You can get them from
> Jean-Christophe Filliatre's page:
> They support very fast set operations (union, difference, intersection).

Patricia Trees are tries in dimension 2.

In fact, one could try tries in dimension 30 with the leafs being
integers (a kind of mix between bitvectors and tries).

I have been doing a few test, a very simple implementation should be
avaible in the pre-release of the data structure library. But I don't
know yet if it is faster than Patricia trees or not. At least it
should save some space

        Diego Olivier

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: