[Phoenix-pm] Semi-infinite strings and Patricia trees

[Scott Walters]

Hi all,

Please allow me to elaborate.  I'd like to present on semi-infinite strings
and patricia trees, which is the basic technology that Google uses that
enables them to search for numeric ranges, such as 1000..2000, exact
quotes, and do lots of other neat things.

I won't talk about stemming, scoring, weighting, crawling, or lots of
other things, at least not much, and not without request -- the
presentation is concerned with this algorithm set, storage method, 
and it's data structures.

Hope to see you there!
-scott

PS: updated the Wiki.

I'd like to present on semi-infinite 

On  0, Brock <awwaiid at thelackthereof.org> wrote:
> Actually... sorry for not having earlier notice but I have to change the
> meeting from Wednesday to Thursday. If there are any objections let them
> be heard. Otherwise, here is the announcement:
> 
>      Time: Thursday 16 March 2006 @7:00pm
>  Location: Mill's End
>            http://maps.google.com/maps?q=310+S+Mill+Ave+tempe,+az
>            310 S Mill Ave # A101
>            Tempe, AZ 85281
>            Thats the North-West corner of Mill and 3rd (north of
>            University) in down-town Tempe.
>     Topic: Search Engine (scott)
>            Catalyst (Michael Garfias, unconfirmed)
>            As always, random discussion
>     Other: Wireless internet available. Bring your laptops.
>            Mill's End sells drinks and food
>            Presentations will be given and recorded over VNC
> 
> --Brock
> 
> _______________________________________________
> Phoenix-pm mailing list
> Phoenix-pm at pm.org
> http://mail.pm.org/mailman/listinfo/phoenix-pm