Re: Data structure behind Google Suggest
- From: Chris F Clark <cfc@xxxxxxxxxxxxxxxxxxxx>
- Date: Wed, 26 Sep 2007 22:39:26 -0400
Can anyone think of an efficient data structure that could handle
Google Suggest?
Take a look at Patricia tries (I believe also called suffix tries).
The technique is explored pretty throughly in compression,
(e.g. Cleary, Bell, and Whitten).
Hope this helps,
-Chris
*****************************************************************************
Chris Clark Internet : compres@xxxxxxxxxxxxx
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
23 Bailey Rd voice : (508) 435-5016
Berlin, MA 01503 USA fax : (978) 838-0263 (24 hours)
------------------------------------------------------------------------------
.
- References:
- Data structure behind Google Suggest
- From: Chris
- Data structure behind Google Suggest
- Prev by Date: Re: Mathematical models for loop calculations
- Next by Date: Re: Generalized Quine-McCluskey
- Previous by thread: Re: Data structure behind Google Suggest
- Next by thread: Generalized Quine-McCluskey
- Index(es):
Relevant Pages
|