Tree structure retrieval processor

Abstract

Abstract PURPOSE:To reduce a mean number of times of access, by converting an unbalanced tree structure to a balanced tree structure, constituting a tree structure storage information storing part, and converting and accessing the code sequence of a code train to be retrieved. CONSTITUTION:In an address AO, information FO containing a key information, a branch information, etc. is stored, and also a left pointer A1 and a right pointer A2 showing a left branch or a right branch in accordance with an upper rank part of a post-conversion code train which has been converted by a code sequence converting circuit part 10, and a branch information in the information F0 are stored. When contents of the address A0 have been read out by a data register 3, the key information in the information F0 is compared with the upper rank part of the code train by a branch deciding circuit part 5. this result is in coincidence, and also a gate or a gate 8 is turned on by the branch information in the information F0. By the pointer, contents of each address in an information storing part 1 are read out by the data register 3, and comparison and branch decision are repeated.

Inventors

• 👤 Akio Shinagawa
• 👤 明雄 品川
• 👤 Hiroshi Hayashi
• 👤 弘 林
• 👤 Akira Hattori
• 👤 彰 服部
• 👤 Takeshi Shinoki
• 👤 剛 篠木

Bibliographic Details