Pierre Weis <pierre.weis@inria.fr> writes:

>   As far as I know the best (and simpler) way to do this for reasonable
>   number of URLs bindings (say thousands but not millions) is to create
>   a Hashtlbl.t or Map.t and dump it to file using output_value (then
>   read it back with input_value).

Is there a recommended data structure in case one needs tables for
reasonably fast access to millions or tens of millions of values?
Probably hash tables are no longer providing nearly-constant access
time at those sizes.  Is there something better in the standard
library?   

Thanks --

        Joshua 


-- 
	Joshua D. Guttman		<guttman@mitre.org> 
	MITRE, Mail Stop S119		Office:	+1 781 271 2654
	202 Burlington Rd.		Cell:	+1 781 526 5713
	Bedford, MA 01730-1420 USA	Fax:	+1 781 271 8953


-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners