Re: What is best searching algorithm for URL
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Mon, 05 Jun 2006 10:21:26 -0400
sandeep wrote:
Our team is developing proxy server(in VC++)which can handle 5000
clients. I have to implement cache part so when ever a new request com
from client I have to check the request URL content is in cache of
proxy and send to client if it is cache, if it is not there then it
have to get data from web server and store in proxy server cache.
so i am thinking to use binary tree search(or AVL tree) to search
request URL content in cache if it is not there to insert in it
is it a good idea so that insertion and searching is faster
I also used hash table and key I has chosen according to first
character in URL
So now in that bucket it contain double linked list now I have search
in it, for that I am thinking to use binary tree
If you GPL your end product, you could use hashlib for the purpose,
which would be very fast, keying on the URL string. If you don't
intend to release your end source, you could negotiate a license
for hashlib. At any rate, you can try it out for the purpose:
<http://cbfalconer.home.att.net/download/>
--
"Our enemies are innovative and resourceful, and so are we.
They never stop thinking about new ways to harm our country
and our people, and neither do we." -- G. W. Bush.
"The people can always be brought to the bidding of the
leaders. All you have to do is tell them they are being
attacked and denounce the pacifists for lack of patriotism
and exposing the country to danger. It works the same way
in any country." --Hermann Goering.
.
- References:
- What is best searching algorithm for URL
- From: sandeep
- What is best searching algorithm for URL
- Prev by Date: Re: What is best searching algorithm for URL
- Next by Date: Re: linux to windows porting help
- Previous by thread: Re: What is best searching algorithm for URL
- Next by thread: Re: What is best searching algorithm for URL
- Index(es):
Relevant Pages
|
