RETRIEVAL DEVICE AND DATA TRANSFER SYSTEM USING THE SAME

PROBLEM TO BE SOLVED: To generate a path table and to attain high speed retrieval by storing attribute of first entry data to an attribute storage means as part of the attribute of the first entry data in the case that bits with a specific bit width are included in the first entry data. SOLUTION: In...

Full description

Saved in:
Bibliographic Details
Main Author YONEDA MASAYA
Format Patent
LanguageEnglish
Published 21.05.1999
Edition6
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:PROBLEM TO BE SOLVED: To generate a path table and to attain high speed retrieval by storing attribute of first entry data to an attribute storage means as part of the attribute of the first entry data in the case that bits with a specific bit width are included in the first entry data. SOLUTION: Input data and storage data are retrieved with a binary tree by using a retrieval data storage table 20, finally obtaining results denoting how many of storage data DX (i), pointing address AP (I) and some bits at high-order are coincident with those of the input data. An extended attribute data table 21 is pointed out by a pointing address AP (I) to read 32-bit extension attribute data. In the case that a maximum bit length of the extension attribute data not in excess of coincident bit length is X2, the X2 is selected. Address data are obtained by adding the pointing address AP (I) to a value (X2-1) that is a subtraction of 1 from the selected X2.
Bibliography:Application Number: JP19970330766