GB1522518A – Data comparison system
– Google Patents
GB1522518A – Data comparison system
– Google Patents
Data comparison system
Info
Publication number
GB1522518A
GB1522518A
GB48840/75A
GB4884075A
GB1522518A
GB 1522518 A
GB1522518 A
GB 1522518A
GB 48840/75 A
GB48840/75 A
GB 48840/75A
GB 4884075 A
GB4884075 A
GB 4884075A
GB 1522518 A
GB1522518 A
GB 1522518A
Authority
GB
United Kingdom
Prior art keywords
store
function
logical entities
data
results
Prior art date
1974-12-04
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
GB48840/75A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bpifrance Financement SA
Original Assignee
Agence National de Valorisation de la Recherche ANVAR
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
1974-12-04
Filing date
1975-11-27
Publication date
1978-08-23
1975-11-27
Application filed by Agence National de Valorisation de la Recherche ANVAR
filed
Critical
Agence National de Valorisation de la Recherche ANVAR
1978-08-23
Publication of GB1522518A
publication
Critical
patent/GB1522518A/en
Status
Expired
legal-status
Critical
Current
Links
Espacenet
Global Dossier
Discuss
Classifications
G—PHYSICS
G06—COMPUTING; CALCULATING OR COUNTING
G06F—ELECTRIC DIGITAL DATA PROCESSING
G06F11/00—Error detection; Error correction; Monitoring
G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
G06F11/14—Error detection or correction of the data by redundancy in operation
G—PHYSICS
G06—COMPUTING; CALCULATING OR COUNTING
G06F—ELECTRIC DIGITAL DATA PROCESSING
G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
G06F16/90—Details of database functions independent of the retrieved data types
G06F16/903—Querying
G06F16/90335—Query processing
G06F16/90344—Query processing by using string matching techniques
G—PHYSICS
G06—COMPUTING; CALCULATING OR COUNTING
G06F—ELECTRIC DIGITAL DATA PROCESSING
G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
G06F16/90—Details of database functions independent of the retrieved data types
G06F16/903—Querying
G06F16/90335—Query processing
G06F16/90348—Query processing by searching ordered data, e.g. alpha-numerically ordered data
Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y10S707/00—Data processing: database and file management or data structures
Y10S707/99931—Database or file accessing
Y10S707/99933—Query processing, i.e. searching
Abstract
1522518 Data comparison systems; data storage systems AGENCE NATIONALE DE VALORISATION DE LA RECHERCHE 27 Nov 1975 [4 Dec 1974] 48840/75 Heading G4A In a data comparison system, a succession of logical entities (e.g. alphanumeric characters) from a source 7 is compared with reference logical entities held in a store 1, the reference logical entities being recorded in store 1 in the form of a two-dimensional table with one entity per column, each row containing data elements of the same order for each reference logical entity, the first data element of a logical entity from source 7 being compared simultaneously and in parallel, according to a first selected function, which first selected function may be the Boolean identity function or the EXCLUSIVE-OR function and by means of an operator unit 2, with all the data elements of the first row of the table, the results of these comparisons being stored in a working register 4, the second data element of the logical entity from source 7 being similarly compared with all the data elements of the second row of the table, the results of these second comparisons being combined in parallel, according to a second selected function and by means of an operator unit 3, which second selected function may be the Boolean AND function or a counting function, with those earlier stored from the first comparisons, the results of this combination being stored in the working register 4. These steps are repeated in an iterative manner for the successive data elements of the logical entity, the results of the final combination held in working register 4 constituting the results of the comparison for the logical entity considered. Various combinations of the operator units 2, 3 and the working register 4 may be combined into a single operator unit, Figs. 7-11 (not shown). The results of successive comparisons effected on logical entities of a sequence of logical entities may be combined, according to a third selected function, which may be the Boolean OR function, to obtain a final comparison result. The logical entities may be of fixed or variable lengths; in the latter case the start and finish of a logical entity are delimited by either special characters (one data element in length) or special logical entities (a number of data elements in length). Those reference logical entites recorded in store 1 which have lengths less than the number of rows of the store may be terminated by special (in this case blank) characters. Comparisons of different logical entities of a sequence may use different tables and/or different first and selected functions, according to the order of a logical entity in the sequence, and the application of a comparison to a particular sequence may be defined and conditioned by the results of comparisons already effected. The results of the comparisons of a sequence may be successively compared with a group of types of such results by a further application of the above method of comparison. The special characters control (1) initialization of the system, e.g. loading of the reference logical entities into the table, (2) start or finish of a comparison, (3) choice of table and/or function, (4) definition of data to be transferred to another part of the system in the course of, or at the end of, a comparison, and (5) temporary stopping of a comparison if a desired special character is recognized. The special logical entities control (1) a comparison for the logical entities of a sequence defined by the recognized special logical entity, and (2) a storage operation for the logical entities of such a sequence. If the first function is selected to be EXCLUSIVE-OR and the second function to be a counting function, the system may be employed for the determination of Hamming distance codes. In a modification, Fig. 12 (not shown) the store 1 comprises a number of store modules (1a-1n), selection of a store module being achieved via address signals from a control unit 19. In Fig. 13 (not shown) a single store 1 is divided into a number of zones, zone selection also being achieved by address signals from control unit 19. In Fig. 15 (not shown), the store 1 is replaced by a store (50), each row of the store (50) containing, apart from data elements of the reference logical entities, the results of comparisons, according to the first function, of these data elements with the received data elements from source 7, the operator unit 2 then being omitted. In Fig. 14 (not shown), the operator unit 2 is constituted by a number of modules (2a-2n) each embodying a different first function. Data stores.-Figure 18 (not shown) shows a modular arrangement of a store suitable for use as the store 1 for character-by-character or bit-by-bit comparisons of reference logical entities stored therein with a logical entity from source 7. The store comprises h identical, preferably integrated circuit, modules (200.1- 200.h) each comprising n locations each of p bits, data and addresses being supplied in parallel to the modules on respective bases (202, 201) and selection of a module for writing being controlled by separate connections (206.1-206.h). The modules are read in parallel via respective buses (203.1-203.h), their outputs being fed to respective multiplexers (204.1-204.h) controlling character-bycharacter or bit-by-bit output selection. Fig. 19 (not shown) shows an embodiment of a data comparison system wherein tables for the special characters, special logical entities, reference logical entities and types of results are held in respective stores (300-303), each such store being preferably of the form shown in Fig. 18 (not shown) except that store (303) may be replaced by a number of recirculating shift registers. Sequences of data which have been compared by the system and the types of results may be held in respective buffer stores (340, 336) which are random access stores having duplicated address registers so that restarts may be made in the event of error by the storage of index pointers in the duplicate address registers. Such duplication of the address registers also permits the suspension of a comparison if an overflow off one of the buffer stores occurs, the contents of that buffer store then being transferred to a utilization device 13, and the modification of the contents of the buffer stores as desired, the location of the data to be modified being determined by the detection of special characters or special logical entities. A number of index pointers may be stored by replacing a duplicate address register with a FIFO or a LIFO register. A number of simultaneous restarts may similarly be made by replacing the single duplicate address register by a number of registers.
GB48840/75A
1974-12-04
1975-11-27
Data comparison system
Expired
GB1522518A
(en)
Applications Claiming Priority (2)
Application Number
Priority Date
Filing Date
Title
FR7439592A
FR2293741A1
(en)
1974-12-04
1974-12-04
METHOD AND SYSTEM FOR ITERATIVE AND SIMULTANEOUS RECONCILIATION OF DATA WITH A SET OF REFERENCE DATA
FR7533426A
FR2330075A2
(en)
1974-12-04
1975-10-31
Iterative process for comparing data with reference data – uses three subsystems for identification of special characters, logic entities and processing
Publications (1)
Publication Number
Publication Date
GB1522518A
true
GB1522518A
(en)
1978-08-23
Family
ID=62495341
Family Applications (1)
Application Number
Title
Priority Date
Filing Date
GB48840/75A
Expired
GB1522518A
(en)
1974-12-04
1975-11-27
Data comparison system
Country Status (10)
Country
Link
US
(1)
US4053871A
(en)
JP
(1)
JPS5921058B2
(en)
CA
(1)
CA1061908A
(en)
CH
(1)
CH616252A5
(en)
DE
(1)
DE2554442C2
(en)
FR
(2)
FR2293741A1
(en)
GB
(1)
GB1522518A
(en)
IL
(1)
IL48604A
(en)
IT
(1)
IT1051618B
(en)
NL
(1)
NL7514175A
(en)
Cited By (2)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
EP0019008A2
(en)
*
1979-05-14
1980-11-26
System Development Corporation
Method of determining the degree of match between a query and an entry of a data base
EP0139817A2
(en)
*
1983-09-23
1985-05-08
Siemens Aktiengesellschaft
Method and device for searching file data corresponding to a given search key in a hybrid associative memory
Families Citing this family (52)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
US4221003A
(en)
*
1978-05-04
1980-09-02
International Business Machines Corporation
Bubble domain relational data base system
GB1588827A
(en)
*
1978-05-31
1981-04-29
System Dev Corp
Data processor method and means for determining degree of match between two data arrays
US4283771A
(en)
*
1978-07-31
1981-08-11
International Business Machines Corporation
On-chip bubble domain relational data base system
US4290105A
(en)
*
1979-04-02
1981-09-15
American Newspaper Publishers Association
Method and apparatus for testing membership in a set through hash coding with allowable errors
FR2459512A1
(en)
*
1979-06-19
1981-01-09
Vidalin Jacques
METHOD FOR CONTROLLING RECONCILIATION TO BE MADE BETWEEN LOGICAL REFERENCE ENTITIES AND LOGICAL ENTITIES OBTAINED FROM A FILE
FR2499732A2
(en)
*
1979-06-19
1982-08-13
Jacques Vidalin
Nested loop processor for sequential computer program – uses memories to hold loop data, loop count, and return addresses to command table to dispatch to loop processing system
US4316177A
(en)
*
1979-12-03
1982-02-16
Rca Corporation
Data classifier
US4404542A
(en)
*
1980-12-05
1983-09-13
Rca Corporation
Digital sequence detector
EP0100801B1
(en)
*
1982-08-06
1987-05-27
L’universite De Bordeaux 1
Method of joining logic reference entities and logic entities from a file
EP0100804A1
(en)
*
1982-08-12
1984-02-22
Universite De Bordeaux I
Method for joining logic reference entities and logic entities from a file
US4525803A
(en)
*
1982-08-12
1985-06-25
L’universite De Bordeaux 1
Method for controlling the comparison to be effected between reference logical entities and logical entities issuing from a file
US4644545A
(en)
*
1983-05-16
1987-02-17
Data General Corporation
Digital encoding and decoding apparatus
JPS60116083A
(en)
*
1983-11-28
1985-06-22
Toshiba Corp
Character-string decision device
US4528660A
(en)
*
1983-12-08
1985-07-09
The United States Of America As Represented By The Secretary Of The Air Force
Multiplexed data stream monitor
US4725812A
(en)
*
1984-06-04
1988-02-16
Siemens Aktiengesellschaft
Circuit arrangement for identifying specific bit patterns, particularly bit patterns forming synchronization signals and check loop signals and appearing as serial binary signals
US4665520A
(en)
*
1985-02-01
1987-05-12
International Business Machines Corporation
Optimistic recovery in a distributed processing system
US4730259A
(en)
*
1985-03-01
1988-03-08
Gallant Stephen I
Matrix controlled expert system producible from examples
US4857882A
(en)
*
1985-07-02
1989-08-15
Vlsi Technology, Inc.
Comparator array logic
US4748439A
(en)
*
1985-08-13
1988-05-31
Fairchild Semiconductor Corporation
Memory apparatus and method for retrieving sequences of symbols including variable elements
JPH0797373B2
(en)
*
1985-08-23
1995-10-18
株式会社日立製作所
Document matching system
US4754420A
(en)
*
1985-11-14
1988-06-28
Hewlett-Packard Company
Digital data filter for local area network
US4805093A
(en)
*
1986-10-14
1989-02-14
Ward Calvin B
Content addressable memory
WO1988006308A1
(en)
*
1987-02-10
1988-08-25
Davin Computer Corporation
Parallel string processor and method for a minicomputer
US4896133A
(en)
*
1987-02-10
1990-01-23
Davin Computer Corporation
Parallel string processor and method for a minicomputer
US5073864A
(en)
*
1987-02-10
1991-12-17
Davin Computer Corporation
Parallel string processor and method for a minicomputer
AU1933788A
(en)
*
1987-08-20
1989-03-09
Davin Computer Corporation
Parallel string processor and method for a minicomputer
JPH01108675A
(en)
*
1987-10-21
1989-04-25
Hitachi Ltd
Electronic slip processing system
US4991134A
(en)
*
1988-03-30
1991-02-05
International Business Machines Corporation
Concurrent sorting apparatus and method using FIFO stacks
KR900702450A
(en)
*
1988-11-04
1990-12-07
원본미기재
Parallel String Processor and Method for Minicomputers
EP0463164A4
(en)
*
1989-03-14
1992-12-16
Kabushiki Kaisha Dainichi
Data retrieval device and data editing apparatus using this device
US5546592A
(en)
*
1989-06-26
1996-08-13
Ncr Corporation
System and method for incrementing memory addresses in a computer system
US6816872B1
(en)
*
1990-04-26
2004-11-09
Timespring Software Corporation
Apparatus and method for reconstructing a file from a difference signature and an original file
US5475833A
(en)
*
1991-09-04
1995-12-12
International Business Machines Corporation
Database system for facilitating comparison of related information stored in a distributed resource
US5442778A
(en)
*
1991-11-12
1995-08-15
Xerox Corporation
Scatter-gather: a cluster-based method and apparatus for browsing large document collections
JP2502023B2
(en)
*
1992-04-13
1996-05-29
インターナショナル・ビジネス・マシーンズ・コーポレイション
Data file comparison method and system
US5586288A
(en)
*
1993-09-22
1996-12-17
Hilevel Technology, Inc.
Memory interface chip with rapid search capability
FR2715486B1
(en)
*
1994-01-21
1996-03-29
Alain Nicolas Piaton
Method for comparing computer files.
US5787422A
(en)
*
1996-01-11
1998-07-28
Xerox Corporation
Method and apparatus for information accesss employing overlapping clusters
US6185559B1
(en)
1997-05-09
2001-02-06
Hitachi America, Ltd.
Method and apparatus for dynamically counting large itemsets
US6226640B1
(en)
*
1997-11-17
2001-05-01
Telecordia Technologies, Inc.
Method for determining approximate hamming distance and approximate nearest neighbors of a query
US5996073A
(en)
*
1997-12-18
1999-11-30
Tioga Systems, Inc.
System and method for determining computer application state
JP2000315198A
(en)
*
1999-05-06
2000-11-14
Hitachi Ltd
Distributed processing system and its performance monitoring method
US20020143735A1
(en)
*
2001-03-30
2002-10-03
Akin Ayi
User scope-based data organization system
US8073893B1
(en)
*
2005-08-25
2011-12-06
Robert T. Jenkins
Method and/or system for comparing character expressions
US8484236B1
(en)
2006-06-30
2013-07-09
Robert T. Jenkins and Virginia T. Jenkins
Method and/or system for processing data streams
US7899819B2
(en)
*
2007-03-02
2011-03-01
Ehud Ben-Reuven
Financial line data-base
US20120330778A1
(en)
*
2011-05-23
2012-12-27
Garrett Eastham
Product comparison and feature discovery
US9477473B2
(en)
*
2012-12-31
2016-10-25
Cadence Design Systems, Inc.
Bit-level register file updates in extensible processor architecture
US9448801B2
(en)
2012-12-31
2016-09-20
Cadence Design Systems, Inc.
Automatic register port selection in extensible processor architecture
US10489159B2
(en)
2016-12-21
2019-11-26
Microsoft Technology Licensing, Llc
Pipelined decompression of sliding window compressed data
US10483981B2
(en)
*
2016-12-30
2019-11-19
Microsoft Technology Licensing, Llc
Highspeed/low power symbol compare
US10691361B2
(en)
2017-02-24
2020-06-23
Microsoft Technology Licensing, Llc
Multi-format pipelined hardware decompressor
Family Cites Families (6)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
US3402394A
(en)
*
1964-08-31
1968-09-17
Bunker Ramo
Content addressable memory
US3391390A
(en)
*
1964-09-09
1968-07-02
Bell Telephone Labor Inc
Information storage and processing system utilizing associative memory
US3588845A
(en)
*
1968-09-09
1971-06-28
Cii
Associative memory
US3771139A
(en)
*
1971-05-03
1973-11-06
D Digby
Associative memory method of performing simultaneous content searches
FR2140321B1
(en)
*
1971-06-10
1974-03-22
Dassault Electronique
GB1424535A
(en)
*
1972-04-28
1976-02-11
Ici Ltd
Signal correlators
1974
1974-12-04
FR
FR7439592A
patent/FR2293741A1/en
active
Granted
1975
1975-10-31
FR
FR7533426A
patent/FR2330075A2/en
active
Granted
1975-11-27
GB
GB48840/75A
patent/GB1522518A/en
not_active
Expired
1975-12-02
CA
CA240,905A
patent/CA1061908A/en
not_active
Expired
1975-12-03
JP
JP50144548A
patent/JPS5921058B2/en
not_active
Expired
1975-12-03
IT
IT7569975A
patent/IT1051618B/en
active
1975-12-03
CH
CH1575275A
patent/CH616252A5/fr
not_active
IP Right Cessation
1975-12-03
DE
DE2554442A
patent/DE2554442C2/en
not_active
Expired
1975-12-04
IL
IL48604A
patent/IL48604A/en
unknown
1975-12-04
US
US05/637,659
patent/US4053871A/en
not_active
Expired – Lifetime
1975-12-04
NL
NL7514175A
patent/NL7514175A/en
not_active
Application Discontinuation
Cited By (4)
* Cited by examiner, † Cited by third party
Publication number
Priority date
Publication date
Assignee
Title
EP0019008A2
(en)
*
1979-05-14
1980-11-26
System Development Corporation
Method of determining the degree of match between a query and an entry of a data base
EP0019008A3
(en)
*
1979-05-14
1981-07-15
System Development Corporation
Method and means utilizing multiple processing means for determining degree of match between two data arrays
EP0139817A2
(en)
*
1983-09-23
1985-05-08
Siemens Aktiengesellschaft
Method and device for searching file data corresponding to a given search key in a hybrid associative memory
EP0139817B1
(en)
*
1983-09-23
1987-11-11
Siemens Aktiengesellschaft
Method and device for searching file data corresponding to a given search key in a hybrid associative memory
Also Published As
Publication number
Publication date
FR2330075B2
(en)
1981-12-24
NL7514175A
(en)
1976-06-09
IL48604A0
(en)
1976-02-29
JPS5921058B2
(en)
1984-05-17
CH616252A5
(en)
1980-03-14
FR2293741A1
(en)
1976-07-02
IL48604A
(en)
1979-01-31
CA1061908A
(en)
1979-09-04
JPS5182536A
(en)
1976-07-20
FR2293741B1
(en)
1981-11-06
FR2330075A2
(en)
1977-05-27
US4053871A
(en)
1977-10-11
DE2554442C2
(en)
1985-10-03
IT1051618B
(en)
1981-05-20
DE2554442A1
(en)
1976-06-10
Similar Documents
Publication
Publication Date
Title
GB1522518A
(en)
1978-08-23
Data comparison system
US3648254A
(en)
1972-03-07
High-speed associative memory
US3402398A
(en)
1968-09-17
Plural content addressed memories with a common sensing circuit
US4314356A
(en)
1982-02-02
High-speed term searcher
US4611310A
(en)
1986-09-09
Method and system for rearranging data records in accordance with keyfield values
US4483001A
(en)
1984-11-13
Online realignment of memory faults
US3936806A
(en)
1976-02-03
Solid state associative processor organization
US2935732A
(en)
1960-05-03
Sorting apparatus
GB1390400A
(en)
1975-04-09
Data stores
US3242466A
(en)
1966-03-22
Method and apparatus for sorting of recorded digital data
US4103334A
(en)
1978-07-25
Data handling system involving memory-to-memory transfer
US4101968A
(en)
1978-07-18
Sorter with overlap operation
EP0007001A1
(en)
1980-01-23
Constrained paging data processing apparatus
WO1990009640A1
(en)
1990-08-23
Apparatus for high speed image rotation
GB1178429A
(en)
1970-01-21
Data Processing System.
US3733589A
(en)
1973-05-15
Data locating device
US3824562A
(en)
1974-07-16
High speed random access memory shift register
US3238510A
(en)
1966-03-01
Memory organization for data processors
US3976980A
(en)
1976-08-24
Data reordering system
EP0132314A2
(en)
1985-01-30
Window-addressable memory circuit
US3508220A
(en)
1970-04-21
Fast access content-organized destructive readout memory
EP0367995A2
(en)
1990-05-16
Vector data transfer controller
US3609703A
(en)
1971-09-28
Comparison matrix
US3387272A
(en)
1968-06-04
Content addressable memory system using address transformation circuits
EP0321493A4
(en)
1991-11-21
A content-addressable memory system
Legal Events
Date
Code
Title
Description
1978-12-20
PS
Patent sealed [section 19, patents act 1949]
1992-07-22
PCNP
Patent ceased through non-payment of renewal fee
