Rick, The instructions used for sorting, UPT and CFC, are implemented over radix partition trees, and the doc is in the Principles of Operation. They are extremely fast, since both of these instructions are implemented in millicode. However, using these instructions is not for the faint of heart.
I have given a SHARE session on using them for sorting (their intended use) and will be giving another at the summer SHARE this year, along with Michael Stack (a double session). There is additional documentation if you search with Google, and as I recall Lynn Wheeler knew the person who was the definitive expert of radix partition trees. I've not seen them used for a binary search, but it might just work if you're very clever. Tom Harper IMS Utilities Development Team NEON Enterprise Software, Inc. -----Original Message----- From: IBM Mainframe Discussion List [mailto:[EMAIL PROTECTED] On Behalf Of Rick Fochtman Sent: Thursday, January 10, 2008 8:39 PM To: [email protected] Subject: Radix Partition Trees 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 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
