Article View: comp.sys.mac.databases
Article #127"Lazy Litwin" Hashing
From: leaving my dreams
Date: Sun, 09 Aug 1992 20:38
Date: Sun, 09 Aug 1992 20:38
12 lines
830 bytes
830 bytes
Hi,
I'm looking for a hashing algorithim called "Lazy Litwin".
If any one can e-mail me any info (alogorithim, code or where I
can find more info on it in documentation) I will gratefully appriciate
it.
Mayank
mayshah@remus.rutgers.edu
P.S. Is this the same as Trie Hashing by W. Litwin
Technical Details
Message-ID:
<Aug.9.16.38.53.1992.16594@remus.rutgers.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!dtix!darwin.sura.net!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!rutgers!igor.rutgers.edu!remus.rutgers.edu!mayshahShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!dtix!darwin.sura.net!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!rutgers!igor.rutgers.edu!remus.rutgers.edu!mayshah From: mayshah@remus.rutgers.edu (leaving my dreams) Newsgroups: comp.sys.mac.databases Subject: "Lazy Litwin" Hashing Keywords: Litwin, Hashing, Lazy, Indexing, Alogrithims Message-ID: <Aug.9.16.38.53.1992.16594@remus.rutgers.edu> Date: 9 Aug 92 20:38:53 GMT Organization: Rutgers Univ., New Brunswick, N.J. Lines: 12