Allowing inconsistency in a distributed client-server applicatio

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

39520031, 707 8, H04L 1200

Patent

active

057519587

ABSTRACT:
The invention enables multiple users to simultaneously access and change the contents of a database in a flexible manner. Each user interacts with a working copy of a master copy of the database. The contents of each of the working copies of the database can be accessed and manipulated so that the contents of the working copy of the database can be revised. Each user has control over whether to the "publish" revisions made to the contents of that user's working copy of the database, i.e., write the revisions to the master copy and present other users with the option of including the revisions in the working copies of those other users. Each user has the option to reject revisions published by other users so that the contents of each user's working copy of the database may or may not be maintained consistent with other working copies of the database operated on by other users. However, in order to ensure data integrity of the master database, each user that rejects the inclusion of revisions published by another user is prospectively prevented from publishing revisions to other users, until the user accepts the previously rejected published revisions. The invention employs a distributed architecture that allows each user to interact with that user's working copy of the database in a way that is controlled by that user without impairing the functionality of the database for other users. The database inconsistency allowed by the invention facilitates the performance by users of "what-if" analyses.

REFERENCES:
patent: 4495559 (1985-01-01), Gelatt, Jr. et al.
patent: 4864507 (1989-09-01), Ebling et al.
patent: 4874963 (1989-10-01), Alspector
patent: 4931944 (1990-06-01), Richter et al.
patent: 5237497 (1993-08-01), Sitarski
patent: 5255345 (1993-10-01), Shaefer
patent: 5261069 (1993-11-01), Wilkinson et al.
patent: 5303328 (1994-04-01), Masui et al.
patent: 5434994 (1995-07-01), Shaheen et al.
patent: 5490270 (1996-02-01), Devarakonda et al.
patent: 5577240 (1996-11-01), Demers et al.
patent: 5581753 (1996-12-01), Terry et al.
patent: 5581754 (1996-12-01), Terry et al.
patent: 5603026 (1997-02-01), Demers et al.
patent: 5623655 (1997-04-01), Chisaka
patent: 5623659 (1997-04-01), Shi et al.
M. Zweben et al., "Learning to improve constraint-based scheduling", Artificial Intelligence 58, Elsevier Science Publishers B.V.,1992, pp. 271-296.
M. Zweben et al., "Scheduling and Rescheduling with Iterative Repair", IEEE Transactions on Systems, Man. and Cybernetics. vol. 23, No. 6, Nov./Dec. 1993, pp. 1588-1595.
M. Zweben et al., "Heuristics versus Lookahead in Iterative Repair Scheduling", The Proceedings of the 13th International Joint Conference on Artificial Intelligence, 1993, pp. 1416-1422.
M. Zweben et al., "Scheduling and Rescheduling With Iterative Repair", Intelligent Scheduling, Chapter 8, Morgan Kaufmann Publishers, 1994, pp. 241-255.
M. Zweben et al., "The Space Shuttle Ground Processing Scheduling System", Intelligent Scheduling, Chapter 15, Morgan Kaufmann Publishers, 1994, pp. 423-449.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Allowing inconsistency in a distributed client-server applicatio does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Allowing inconsistency in a distributed client-server applicatio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Allowing inconsistency in a distributed client-server applicatio will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-993002

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.