The following message is a courtesy copy of an article that has been posted to bit.listserv.ibm-main as well.
[EMAIL PROTECTED] (Rick Fochtman) writes: > Has anyone every seen any doc on using radix partition trees? I'm > thinking it may have been one of the "rainbow" books. > > I vaguely remember data tree structures and I've got a table search > problem that might be the perfect application for a tree-structured > data repository. The table might have up to 1,000,000 entries, all in > storage, and a balanced n-ary tree has GOT to be faster than using a > binary search. The nature of the data is such that a plain > old-fashioned list, in sorted order, isn't real amenable to a binary > search, either. for the fun of it look at: http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/BOOKS/DZ9ZR003/A.7?SHELF=DZ9ZBK03&DT=20040504121320 ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
