-
公开(公告)号：US3643226A
公开(公告)日：1972-02-15
申请号：US3643226D
申请日：1969-06-26
Applicant: IBM
Inventor： LOIZIDES EDWARD , LUCAS DONALD J , STEIGERWALT GEORGE F
CPC classification number: G06F17/30949 , Y10S707/99933
Abstract: A method and means for searching a compressed index generated by the method and means disclosed in U.S. Pat. application Ser. No. 836,930 filed the same day as this application. Two types of searches are disclosed, (1) a multilevel search, and (2) a onelevel search. The multilevel search begins at the highest, or apex level of a multilevel compressed index and searches one block at each level. The multilevel search ends after finding a pointer at the lowest level in the index. The pointer found at the lowest level addresses a data block containing the information searched for. The one-level search can enter the multilevel index at any level and serial search plural blocks for the correct pointer to a block at the next lower level.
Abstract translation: 一种用于搜索由美国专利公开公开的方法和装置产生的压缩索引的方法和装置。 应用程序 在本申请的同一天提交的第836,930号。 公开了两种类型的搜索，（1）多级搜索，以及（2）一级搜索。 多级搜索从多级压缩索引的最高或最高级开始，并在每个级别搜索一个块。 在索引中找到最低级别的指针后，多级搜索结束。 在最底层找到的指针寻址包含搜索信息的数据块。 一级搜索可以进入任何级别的多级索引，并串行搜索多个块，以便正确指向下一级别的块。
-
公开(公告)号：US3602895A
公开(公告)日：1971-08-31
申请号：US3602895D
申请日：1969-06-30
Applicant: IBM
Inventor： LOIZIDES EDWARD
CPC classification number: G06F17/30955 , H03M7/30 , Y10S707/99931
Abstract: Electronically controlled method and means for a compressed index in which each key has only a single key byte and a position control field. Each compressed key represents a corresponding uncompressed key of any byte length by means of a pointer associated with the corresponding uncompressed key in the source uncompressed index from which the compressed index is derived. The search reads out the pointer with any specially-selected compressed key having an equal condition between its key byte and a current search-argument byte. After ending conditions are established, the last readout pointer is correct if the search argument is in the source uncompressed index.
-
公开(公告)号：US3613086A
公开(公告)日：1971-10-12
申请号：US3613086D
申请日：1969-01-03
Applicant: IBM
Inventor： LOIZIDES EDWARD , LYON JOHN R
CPC classification number: G06F17/30955 , H03M7/30 , Y10S707/99942
Abstract: Generating and searching a compressed key index (CK index) from a source index. The source index is a sorted sequence of uncompressed key''s (UK''s) in which a UK is a record key, as the term is ordinarily understood. The CK index comprises a plurality of compressed keys (CK''s). Each CK is a shortened representation of a UK. After its generation, the CK index can be searched for any search argument (SA). The format of a CK is generated by this invention to include a single control field (P), and at least one key (K) byte which is a byte taken from a UK. Each CK is generated from a pair of adjacent UK''s taken in their sorted sequence from the source index. The pair of UK''s are compared at corresponding byte positions from their highest-order bytes. The order of a byte position in a UK is determined by its significance in sorting the UK''s. The control field (P) in the CK format is generated to represent the highest-order unequal byte position in the pair of compared UK''s. Field (P) represents the lowest-order byte position in the CK. One key byte (K) is generated by copying a byte from the second UK in the pair at its byte location represented by the field (P). Additional key bytes are copied only when the current P (i.e. Pi) is greater than the prior generated P (i.e. Pi 1), in which case K bytes are copied from the UK byte positions (Pi 1+1) through (Pi). Also a pointer (i.e. address) is provided represented by the first UK in the pair from which the CK was generated. The CK index can be searched for any search argument (SA). The search uses one byte (A) at a time from the SA beginning with its highest-order byte. The setting of an equal-counter (EQU) indicates the position of the current byte A in the SA. While serially searching a CK index for the byte A, the control field (P) of each encountered CK is read. Then a factor value and the number of K bytes are derived for the current CK after determining if its Pi is greater than Pi 1. The factor value indicates the amount of high-order compression for the UK being represented. If Pi is greater than P 1, the prior control field (Pi 1) is the current factor value, and the current number of key bytes (K) is Pi less Pi 1. But if Pi is equal to or less than Pi 1, the current factor value is Pi, and only one K byte exists in the current CK. The current factor value is then compared to the current equal counter setting (EQU). If the factor value is greater than the search argument, the search continues by going to the next CK. But if they are equal, the highest-order K byte in the CK is compared with the current A byte. If A and K are equal, the next A byte and the next K byte (if any) are fetched, and they are compared. Whenever all K bytes in a CK compares equal with A bytes, or whenever any K byte is less than the A byte, the search passes to the next CK. Whenever any Pi is less than the current setting of the equal counter (EQU), or whenever any K byte compares high with the A byte, the search is completed after reading the pointer with the current CK, retrieving the pointer''s record, and comparing the SA to the UK in the record for verification that the correct record has been obtained. The search is then ended in an index having an ascending sequence.
-
公开(公告)号：US3603937A
公开(公告)日：1971-09-07
申请号：US3603937D
申请日：1969-06-26
Applicant: IBM
Inventor： LOIZIDES EDWARD , STEIGERWALT GEORGE F
CPC classification number: G06F17/30949 , Y10S707/99942
Abstract: A method and means for generating a multilevel compressed index. The high-level blocks of the index have an entry format of CK1, CK2, R in which R is a pointer to a next lower level compressed index block, and CK1, and CK2 are each compressed keys generated from uncompressed keys (UK''s) represented by pointers on opposite sides of the end boundaries of select low-level compressed index blocks. The generated multilevel index can be searched using the invention described in U.S. application No. 836,825.
-
公开(公告)号：CA823812A
公开(公告)日：1969-09-23
申请号：CA823812D
Applicant: IBM
Inventor： CARTHEW JOHN R , LOIZIDES EDWARD , MITTA LOUIS A
-
Patent Agency Ranking
公开(公告)号：DE1437708A1
公开(公告)日：1968-10-17
申请号：DE1437708
申请日：1965-06-28
Applicant: IBM
Inventor： ROBERT CARTHEW JOHN , LOIZIDES EDWARD , MACKIE DAVID , ALBERT MITTA LOUIS , THOMAS O'CONNOR JUN LEO , HERBERT RICHARD WILLIAM
Abstract: 1,042,576. Data transmission. INTERNATIONAL BUSINESS MACHINES CORPORATION. June 16, 1965 [June 30, 1964], No. 25364/65. Heading H4P. [Also in Division G4] The description is the same as that of Specification 1,042,574. The claims relate to a system for the transfer of data between a data processor and a plurality of outstations, comprising an interface for each output line, the interfaces being scanned sequentially, and recirculating stores, synchronized with the scanning and containing a control word for each line, each control word having a terminal control identifying field for selecting the one of a number of terminal controls which corresponds to the interface associated with the control word.
-
公开(公告)号：CA944083A
公开(公告)日：1974-03-19
申请号：CA83263
申请日：1970-05-21
Applicant: IBM
Inventor： LOIZIDES EDWARD , LUCAS DONALD J , STEIGERWALT GEORGE F
-
-
公开(公告)号：DE1965507A1
公开(公告)日：1970-07-16
申请号：DE1965507
申请日：1969-12-30
Applicant: IBM
Inventor： LOIZIDES EDWARD , RAYMOND LYON JOHN
Abstract: 1280484 Information retrieval INTERNATIONAL BUSINESS MACHINES CORP 30 Dec 1969 [3 Jan 1969] 63203/69 Heading G4C A compressed key is generated from a sequence of sorted uncompressed keys by counting pairs of equal correspondingly-positioned bytes in two successive uncompressed keys from the highest-order position until an unequal pair is reached and registering a byte from the second of the two keys at the position indicated by the count, and (claimed separately) during searching of compressed keys using a search argument, where each compressed key includes a control field representing the above position of the unequal pair, the control fields of two compressed keys are compared. Generating compressed keys.-Uncompressed keys arranged in ascending order, are taken in pairs in that order (the second key of one pair being the first key of the next) and corresponding bytes are compared starting at high order, the number of byte positions to high order of the first unequal byte pair being counted and stored as a control field in a compressed key produced from the pair of uncompressed keys together with one or more (key) bytes from the second key of the pair. If the "unequal" byte position is at the same position as, or a higher-order position than, the "unequal" byte position from the preceding pair of uncompressed keys, only the byte from this position is included in the compressed key, but otherwise each byte position which is to low order of the "unequal" position of this preceding pair but not to low of the "unequal" position of the current pair, is included. For the first pair of uncompressed keys, the "unequal" byte position of the "preceding" pair is taken as being to high-order of the highest-order position. A pointer address accompanying each uncompressed key (and indicating associated information) is stored after the compressed key generated from the pair of uncompressed keys having the given uncompressed key as its first key. The sequence of uncompressed keys is preceded in buffer memory by bytes specifying the number of bytes allowed in the buffer memory for each uncompressed key and for each pointer, and a byte specifying the level of the indexing viz. whether there is a pointer after every one or two PK fields in the compressed index (P being the control field mentioned above and K the one or more key bytes), these bytes being retained in the buffer memory as the uncompressed index is gradually replaced by the compressed index during generation. Searching compressed keys.-Successive search argument bytes, starting from high-order, are compared with the compressed key bytes to detect equality with key bytes which had corresponding positions in the uncompressed keys, going to the next-lower-order search byte on such equality and to the next compressed key if the search byte is greater than the key byte at such corresponding positions. An "equal" counter indicates the number of search bytes found equal to the corresponding key bytes, being incremented on every equality between key and search bytes which occurs when this counter's content (which indicates the search byte position) is equal to the "uncompressed-key position" of the key byte. The latter position is given by the control field, suitably incremented in a counter. The contents of this counter are also compared with the contents of a register loaded with the next control field to indicate when all key bytes of a given compressed key have been taken, and to control loading of the counter from the register this occurring on entering a new compressed key if the new control field is less than the counter contents. The search is ended on finding a search byte less than the key byte with corresponding "uncompressed-key" position, the corresponding pointer being used to retrieve the information associated with the key. If a comparison of this with the search argument indicates inequality, the search argument was not originally in the uncompressed index. To avoid search ambiguity, the lowest order search argument byte should be followed by a byte less than any possible key byte. Specifications 1,280,483 and 1,280,485 are referred to.
-
公开(公告)号：CA768785A
公开(公告)日：1967-10-03
申请号：CA768785D
Applicant: IBM
Inventor： LOIZIDES EDWARD , CARTHEW JOHN R , MITTA LOUIS A
-
-
-
-
-
-
-
-
-
Search Results
13
records
(took 0.018 seconds)
