US5948057A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for computer-supported matching of a number of data copies of a stored data file wherein changes in the data copies are also stored in protocol files respectively allocated to the data copies
Assignee: Siemens AG
•
Filing: 1997-02-25
•
Granted: 1999-09-07
•
Expires: 2017-02-25
Abstract
Abstract In a method for the computer-supported matching of a number of data copies of a stored data file stored in at least one computer, in the reintegration of a number of data copies that were changed during decoupled work phases by users of a shared work environment, and thus exhibit inconsistencies, the reintegration is conducted so that the number of matchings is reduced on the basis of protocol data files.
Inventors
- 👤 Michael Berger
- 👤 Alexander Jarczyk
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 17:25
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10; G06F; G06F16/00; G06F16/10; G06F16/18; G06F16/182; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953
Claims Analysis
Total Claims: 40
Claim 1
Independent Claim
192 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (c) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (d) determining proposals for matching said copies to each other on the basis of the respective protocol data files and beginning matching of said copies by initially comparing only operations selected from the group of operations consisting of delete operations and create operations, made in the data file or in respective copies, as stored in said protocol data files and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (e) converting said proposals into a change of said data file and said copies dependent on user decision summaries to resolve said conflicts.
Claim 2
Independent Claim
192 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (c) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (d) determining proposals for matching said copies to each other on the basis of the respective protocol data files and beginning matching of said copies by initially comparing only operations selected from the group of operations consisting of delete operations and create operations, made in the data file or in respective copies, as stored in said protocol data files and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (e) converting said proposals into a change of said data file and said copies dependent on user decision summaries to resolve said conflicts.
Claim 3
Dependent Claim
34 words
A method as claimed in claim 1 wherein step (d) is further defined by: after matching by comparison of said operations, conducting further matching of structure change operations stored in said protocol data files.
Claim 4
Dependent Claim
32 words
A method as claimed in claim 1 wherein step (a) is further defined by linking said datasets with one another to form a stored data file having a hierarchic data bank structure.
Claim 5
Dependent Claim
82 words
A method as claimed in claim 3, wherein step (d) is further defined by: after matching by comparing said operations, conducting a matching of structure change operations, stored in said protocol data files, dependent on a position of the respective datasets in the hierarchic data bank structure, by beginning matching with change operations to a root dataset of said data file and proceeding to change operations to datasets which are respectively dependent on datasets which have already been processed in the matching.
Claim 6
Dependent Claim
80 words
A method as claimed in claim 1 comprising the additional steps of: conducting steps (a) through (e) in a computer supportive cooperative work (CSCW) system operating in a session having a composition of users; and if said composition of users in said session changes, identifying a new session sequence with an unambiguous identifier and attaching said identifier in each protocol data file, to changes made to said data file or said copies by users in said changed composition of users.
Claim 7
Dependent Claim
37 words
A method as claimed in claim 1 comprising the additional step of placing selected operations in brackets and, during matching of said operations in step (d), making no comparison of the operations in brackets to other operations.
Claim 8
Dependent Claim
31 words
A method as claimed in claim 1 wherein said operations have semantics associated therewith, and wherein step (d) is further defined by taking said semantics into consideration in comparing said operations.
Claim 9
Dependent Claim
38 words
A method as claimed in claim 7 wherein the step of taking said semantics into consideration in comparing said operation comprises giving chronological priority in comparing said operations to operations which were executed during a predetermined time span.
Claim 10
Dependent Claim
37 words
A method as claimed in claim 7 wherein the step of taking said semantics into consideration in comparing said operations comprises giving time priority in comparing said operations to operations made to at least one predetermined dataset.
Claim 11
Independent Claim
223 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (c) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (d) determining proposals for matching said copies to each other on the basis of the respective protocol data files and beginning matching of said copies by comparing operations selected from the group of operations consisting of delete operations and create operations, made in the data file or in respective copies, as stored in said protocol data files and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (e) selecting at least one of said protocol data files as a reference protocol data files for use as a comparison standard in comparing said operations in step (d); and (f) converting said proposals into changes of said data file and said copies dependent on changes in said reference protocol data file to resolve said conflicts.
Claim 12
Independent Claim
223 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (c) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (d) determining proposals for matching said copies to each other on the basis of the respective protocol data files and beginning matching of said copies by comparing operations selected from the group of operations consisting of delete operations and create operations, made in the data file or in respective copies, as stored in said protocol data files and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (e) selecting at least one of said protocol data files as a reference protocol data files for use as a comparison standard in comparing said operations in step (d); and (f) converting said proposals into changes of said data file and said copies dependent on changes in said reference protocol data file to resolve said conflicts.
Claim 13
Dependent Claim
34 words
A method as claimed in claim 10 wherein step (d) is further defined by: after matching by comparison of said operations, conducting further matching of structure change operations stored in said protocol data files.
Claim 14
Dependent Claim
32 words
A method as claimed in claim 10 wherein step (a) is further defined by linking said datasets with one another to form a stored data file having a hierarchic data bank structure.
Claim 15
Dependent Claim
82 words
A method as claimed in claim 12, wherein step (d) is further defined by: after matching by comparing said operations, conducting a matching of structure change operations, stored in said protocol data files, dependent on a position of the respective datasets in the hierarchic data bank structure, by beginning matching with change operations to a root dataset of said data file and proceeding to change operations to datasets which are respectively dependent on datasets which have already been processed in the matching.
Claim 16
Dependent Claim
80 words
A method as claimed in claim 10 comprising the additional steps of: conducting steps (a) through (f) in a computer supportive cooperative work (CSCW) system operating in a session having a composition of users; and if said composition of users in said session changes, identifying a new session sequence with an unambiguous identifier and attaching said identifier in each protocol data file, to changes made to said data file or said copies by users in said changed composition of users.
Claim 17
Dependent Claim
37 words
A method as claimed in claim 10 comprising the additional step of placing selected operations in brackets and, during matching of said operations in step (d), making no comparison of the operations in brackets to other operations.
Claim 18
Dependent Claim
31 words
A method as claimed in claim 10 wherein said operations have semantics associated therewith, and wherein step (d) is further defined by taking said semantics into consideration in comparing said operations.
Claim 19
Dependent Claim
38 words
A method as claimed in claim 16 wherein the step of taking said semantics into consideration in comparing said operation comprises giving chronological priority in comparing said operations to operations which were executed during a predetermined time span.
Claim 20
Dependent Claim
37 words
A method as claimed in claim 16 wherein the step of taking said semantics into consideration in comparing said operations comprises giving time priority in comparing said operations to operations made to at least one predetermined dataset.
Claim 21
Independent Claim
168 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) allocating said datasets to at least one information space; (c) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (d) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (e) determining proposals for matching of said copies on the basis of said protocol data files, and beginning matching by comparing entire information spaces to each other and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (f) converting said proposals into changes of said data file and said copies dependent on user decisions to resolve said conflicts.
Claim 22
Independent Claim
168 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another; (b) allocating said datasets to at least one information space; (c) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (d) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (e) determining proposals for matching of said copies on the basis of said protocol data files, and beginning matching by comparing entire information spaces to each other and thereby identifying any conflicts among said changes stored in the respective protocol data files; and (f) converting said proposals into changes of said data file and said copies dependent on user decisions to resolve said conflicts.
Claim 23
Dependent Claim
75 words
A method as claimed in claim 19 wherein step (d) is further defined by: determining a sequence of said operations within each information space of a data file by determining a position of the datasets in the hierarchic data bank structure, and conducting said matching beginning with operations made to a root dataset of said data file and proceeding to operations made to datasets which are respectively dependent on datasets already processed in said matching.
Claim 24
Dependent Claim
34 words
A method as claimed in claim 20 comprising beginning said matching by matching operations made to datasets of the data file or copies stored in the protocol data files in a respective information space.
Claim 25
Dependent Claim
40 words
A method as claimed in claim 21 comprising matching structure change operations in said respective information space stored in the protocol data file after comparing operations of datasets of the data file or copies stored in the protocol data files.
Claim 26
Dependent Claim
80 words
A method as claimed in claim 19 comprising the additional steps of: conducting steps (a) through (f) in a computer supportive cooperative work (CSCW) system operating in a session having a composition of users; and if said composition of users in said session changes, identifying a new session sequence with an unambiguous identifier and attaching said identifier in each protocol data file, to changes made to said data file or said copies by users in said changed composition of users.
Claim 27
Dependent Claim
37 words
A method as claimed in claim 19 comprising the additional step of placing selected operations in brackets and, during matching of said operations in step (d), making no comparison of the operations in brackets to other operations.
Claim 28
Dependent Claim
31 words
A method as claimed in claim 19 wherein said operations have semantics associated therewith, and wherein step (d) is further defined by taking said semantics into consideration in comparing said operations.
Claim 29
Dependent Claim
38 words
A method as claimed in claim 25 wherein the step of taking said semantics into consideration in comparing said operation comprises giving chronological priority in comparing said operations to operations which were executed during a predetermined time span.
Claim 30
Dependent Claim
37 words
A method as claimed in claim 25 wherein the step of taking said semantics into consideration in comparing said operations comprises giving time priority in comparing said operations to operations made to at least one predetermined dataset.
Claim 31
Independent Claim
209 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another to form a hierarchic data bank structure; (b) allocating said datasets to at least one information space; (c) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (d) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (e) determining proposals for matching of said copies on the basis of said protocol data files, and beginning matching by comparing entire information spaces to each other and thereby identifying any conflicts among said changes stored in the respective protocol data files; (f) selecting at least one of said protocol data files as a reference protocol data files for use as a comparison standard in comparing said operations in step (d); and (g) converting said proposals into changes of said data file and said copies dependent on changes in said reference protocol data file to resolve said conflicts.
Claim 32
Independent Claim
209 words
A method for computer supportive matching of a plurality of data copies of a data file stored in at least one computer, comprising the steps of: (a) forming a stored data file by linking a plurality of datasets with one another to form a hierarchic data bank structure; (b) allocating said datasets to at least one information space; (c) making a plurality of copies of said data file and allocating a respective protocol data file to each copy; (d) making changes in the respective copies and, for each copy, storing the changes, if any, in the protocol data files respectively allocated to the respective copies in which said changes were made; (e) determining proposals for matching of said copies on the basis of said protocol data files, and beginning matching by comparing entire information spaces to each other and thereby identifying any conflicts among said changes stored in the respective protocol data files; (f) selecting at least one of said protocol data files as a reference protocol data files for use as a comparison standard in comparing said operations in step (d); and (g) converting said proposals into changes of said data file and said copies dependent on changes in said reference protocol data file to resolve said conflicts.
Claim 33
Dependent Claim
75 words
A method as claimed in claim 28 wherein step (d) is further defined by: determining a sequence of said operations within each information space of a data file by determining a position of the datasets in the hierarchic data bank structure, and conducting said matching beginning with operations made to a root dataset of said data file and proceeding to operations made to datasets which are respectively dependent on datasets already processed in said matching.
Claim 34
Dependent Claim
34 words
A method as claimed in claim 29 comprising beginning said matching by matching operations made to datasets of the data file or copies stored in the protocol data files in a respective information space.
Claim 35
Dependent Claim
40 words
A method as claimed in claim 30 comprising matching structure change operations in said respective information space stored in the protocol data file after comparing operations of datasets of the data file or copies stored in the protocol data files.
Claim 36
Dependent Claim
80 words
A method as claimed in claim 28 comprising the additional steps of: conducting steps (a) through (g) in a computer supportive cooperative work (CSCW) system operating in a session having a composition of users; and if said composition of users in said session changes, identifying a new session sequence with an unambiguous identifier and attaching said identifier in each protocol data file, to changes made to said data file or said copies by users in said changed composition of users.
Claim 37
Dependent Claim
37 words
A method as claimed in claim 28 comprising the additional step of placing selected operations in brackets and, during matching of said operations in step (d), making no comparison of the operations in brackets to other operations.
Claim 38
Dependent Claim
31 words
A method as claimed in claim 28 wherein said operations have semantics associated therewith, and wherein step (d) is further defined by taking said semantics into consideration in comparing said operations.
Claim 39
Dependent Claim
38 words
A method as claimed in claim 34 wherein the step of taking said semantics into consideration in comparing said operation comprises giving chronological priority in comparing said operations to operations which were executed during a predetermined time span.
Claim 40
Dependent Claim
37 words
A method as claimed in claim 34 wherein the step of taking said semantics into consideration in comparing said operations comprises giving time priority in comparing said operations to operations made to at least one predetermined dataset.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-09-06 | 2003-03-08 | 2003-09-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-09-06 | 2007-03-08 | 2007-09-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-09-06 | 2011-03-08 | 2011-09-07 | $7700.00 | Window Closed / Lapsed |