<?xml version="1.0" encoding="windows-1252"?>
<node id="155198" title="Re: Re: (Ovid) Re: Comparing two hash tables" created="2002-03-28 23:43:56" updated="2005-07-19 14:08:11">
<type id="11">
note</type>
<author id="5842">
PrakashK</author>
<data>
<field name="doctext">
&lt;blockquote&gt;&lt;em&gt;The reason why i am trying to delete the similar keys is that gradually the the search for the next similar would become faster owing to lesser number of keys left&lt;/em&gt;&lt;/blockquote&gt;
The time to access a hash member does not depend on the number of keys, but on whether the distribution of the hash keys into the buckets is uniform or not.
&lt;p/&gt;
/prakash</field>
<field name="root_node">
155118</field>
<field name="parent_node">
155131</field>
</data>
</node>
