US6061503A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for resolving conflicts among time-based data
Assignee: Zenith Electronics LLC
•
Filing: 1996-11-06
•
Granted: 2000-05-09
•
Expires: 2016-11-06
Abstract
Abstract A method for assembling data by sorting and filtering new data records and old data records, such as data records that an Electronic Program Guide data provider typically transmits to a head end of a cable television system. New incoming data records are combined with existing stored data records to form combined data records. Each of the data records is assigned an array index value. The combined data records are then sorted into one field of multiple fields. Within each field, each sorted data record is compared with other sorted data records and any conflicting data record is removed. The remaining non-conflicting data records are compared within each field and exact duplicate data records are removed from each corresponding field. The remaining processed data records are compared within each field and any older difference duplicate data record is removed. The filtered data records are then transmitted to a database. Because the filtered data records are purified and contain only current information, theoretically, the database will consume all data records. Reducing the number of data records transmitted to the database also reduces the time necessary to process the data records transmitted to the database.
Inventors
- 👤 Robert Adam Chamberlain
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:16
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/40; H04N21/43; H04N21/433; H04N21/4332; H04N7/00; H04N7/10; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
254 words
A method for resolving conflicts among a combination of at least one incoming data record, based upon time, of each data window transmitted to a head end and any existing stored data record and thereby transmitting current information only to a database, the method comprising: (a) receiving from a data provider and combining said at least one incoming data record and any existing stored data record to form at least one combined data record; (b) assigning an array index value to at least one of said at least one incoming data record and any existing stored data record; (c) sorting each said combined data record into one of a plurality of fields to form at least one sorted data record; (d) within each of said fields comparing each said sorted data record and removing any conflicting sorted data record leaving at least one non-conflicting data record; (e) within each of said fields comparing each said non-conflicting data record and removing any exact duplicate data record leaving at least one non-conflicting unique data record; (f) within each of said fields comparing each said non-conflicting unique data record and removing any difference duplicate non-conflicting unique data record leaving any remaining non-conflicting unique data record or records; (g) within each of said fields removing any of said remaining non-conflicting unique data record with an array index value less than a lowest array index value of said at least one incoming data record; and (h) transmitting said at least one current non-conflicting unique data record to the database.
Claim 2
Independent Claim
254 words
A method for resolving conflicts among a combination of at least one incoming data record, based upon time, of each data window transmitted to a head end and any existing stored data record and thereby transmitting current information only to a database, the method comprising: (a) receiving from a data provider and combining said at least one incoming data record and any existing stored data record to form at least one combined data record; (b) assigning an array index value to at least one of said at least one incoming data record and any existing stored data record; (c) sorting each said combined data record into one of a plurality of fields to form at least one sorted data record; (d) within each of said fields comparing each said sorted data record and removing any conflicting sorted data record leaving at least one non-conflicting data record; (e) within each of said fields comparing each said non-conflicting data record and removing any exact duplicate data record leaving at least one non-conflicting unique data record; (f) within each of said fields comparing each said non-conflicting unique data record and removing any difference duplicate non-conflicting unique data record leaving any remaining non-conflicting unique data record or records; (g) within each of said fields removing any of said remaining non-conflicting unique data record with an array index value less than a lowest array index value of said at least one incoming data record; and (h) transmitting said at least one current non-conflicting unique data record to the database.
Claim 3
Dependent Claim
30 words
A method according to claim 1 wherein a relational field of each said sorted data record is compared to resolve a conflict between a plurality of said sorted data records.
Claim 4
Dependent Claim
27 words
A method according to claim 1 wherein at least one said stored data record exists in an old data storage following a first iteration of the method.
Claim 5
Dependent Claim
23 words
A method according to claim 1 wherein said array index value is embedded as a field in a corresponding said combined data record.
Claim 6
Dependent Claim
31 words
A method according to claim 1 wherein said fields comprise at least one selected from the group of: a service identifier field, a start time field and a sequence number field.
Claim 7
Dependent Claim
16 words
A method according to claim 5 wherein said service identifier field is a primary sorting field.
Claim 8
Dependent Claim
16 words
A method according to claim 6 wherein said start time field is a secondary sorting field.
Claim 9
Dependent Claim
22 words
A method according to claim 5 wherein said at least one combined data record is compared within one said service identifier field.
Claim 10
Dependent Claim
27 words
A method according to claim 1 wherein a duration time is added to a start time to identify a stop time of each said combined data record.
Claim 11
Dependent Claim
36 words
A method according to claim 9 wherein said conflicting data record is identified if said stop time of one said combined data record is later than said start time of a subsequent said combined data record.
Claim 12
Dependent Claim
31 words
A method according to claim 1 wherein in each of said fields each said conflicting data record except one said conflicting data record having a highest array index value is removed.
Claim 13
Dependent Claim
21 words
A method according to claim 1 wherein said non-conflicting data record is compared within a service identifier field of said fields.
Claim 14
Dependent Claim
33 words
A method according to claim 12 wherein said exact duplicate data record is identified as one said combined data record having all said fields the same as a subsequent said combined data record.
Claim 15
Dependent Claim
34 words
A method according to claim 1 wherein in each of said fields each said exact duplicate data record except one said exact duplicate data record having a lowest said array index value is removed.
Claim 16
Dependent Claim
34 words
A method according to claim 1 wherein in each of said fields each said non-conflicting unique data record except one said non-conflicting unique data record having a highest said array index value is removed.
Claim 17
Dependent Claim
25 words
A method according to claim 1 wherein each said combined data record is sorted by a start time as a primary field of said fields.
Claim 18
Dependent Claim
26 words
A method according to claim 16 wherein each said combined data record is sorted by a service identifier field as a secondary field of said fields.
Claim 19
Dependent Claim
24 words
A method according to claim 1 wherein an Electronic Program Guide service provider transmits said at least one incoming data record based upon time.
Claim 20
Dependent Claim
38 words
A method according to claim 1 wherein any said conflicting sorted data record that is removed from within each of said fields is older than any remaining said non-conflicting data record within a same field of said fields.
Claim 21
Dependent Claim
39 words
A method according to claim 1 wherein any said exact duplicate data record that is removed from within each of said fields is newer than any remaining said non-conflicting unique data record within a same field of said fields.
Claim 22
Dependent Claim
43 words
A method according to claim 1 wherein any said difference duplicate non-conflicting unique data record that is removed from within each of said fields is older than any remaining said difference duplicate non-conflicting unique data record within a same field of said fields.
Claim 23
Independent Claim
203 words
A method for assembling data for a database, the method comprising: (a) receiving and combining at least one incoming data record and any existing stored data record to form at least one combined data record; (b) assigning an array index value to each said data record; (c) sorting each said combined data record into one of a plurality of fields to form at least one sorted data record; (d) within each of said fields comparing each said sorted data record and removing any conflicting sorted data record leaving at least one non-conflicting data record; (e) within each of said fields comparing each said non-conflicting data record and removing any exact duplicate data record leaving at least one non-conflicting unique data record; (f) within each of said fields comparing each said non-conflicting unique data record and removing any difference duplicate non-conflicting unique data record leaving any remaining said non-conflicting unique data record or records; (g) within each of said fields removing any of said remaining non-conflicting unique data record with an array index value less than a lowest array index value of said at least one incoming data record; and (h) transmitting said at least one current non-conflicting unique data record to the database.
Claim 24
Independent Claim
203 words
A method for assembling data for a database, the method comprising: (a) receiving and combining at least one incoming data record and any existing stored data record to form at least one combined data record; (b) assigning an array index value to each said data record; (c) sorting each said combined data record into one of a plurality of fields to form at least one sorted data record; (d) within each of said fields comparing each said sorted data record and removing any conflicting sorted data record leaving at least one non-conflicting data record; (e) within each of said fields comparing each said non-conflicting data record and removing any exact duplicate data record leaving at least one non-conflicting unique data record; (f) within each of said fields comparing each said non-conflicting unique data record and removing any difference duplicate non-conflicting unique data record leaving any remaining said non-conflicting unique data record or records; (g) within each of said fields removing any of said remaining non-conflicting unique data record with an array index value less than a lowest array index value of said at least one incoming data record; and (h) transmitting said at least one current non-conflicting unique data record to the database.
References Cited (Backward Citations)
US5550576A
Cited
US5666645A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-05-09 | 2003-11-08 | 2004-05-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-05-09 | 2007-11-08 | 2008-05-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-05-09 | 2011-11-08 | 2012-05-09 | $7700.00 | Window Closed / Lapsed |