US20020042910A1 - Method of detecting write conflicts in replicated databases without memory overhead - Google Patents

Method of detecting write conflicts in replicated databases without memory overhead Download PDF

Info

Publication number
US20020042910A1
US20020042910A1 US09/961,956 US96195601A US2002042910A1 US 20020042910 A1 US20020042910 A1 US 20020042910A1 US 96195601 A US96195601 A US 96195601A US 2002042910 A1 US2002042910 A1 US 2002042910A1
Authority
US
United States
Prior art keywords
client
management system
database management
data object
characterizing
Prior art date
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.)
Abandoned
Application number
US09/961,956
Inventor
Markus Baumeister
Steffen Hauptmann
Karin Klabunde
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.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
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.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Assigned to KONINKLIJKE PHILIPS ELECTRONICS N.V. reassignment KONINKLIJKE PHILIPS ELECTRONICS N.V. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KLABUNDE, KARIN, HAUPTMANN, STEFFEN, MAUMEISTER, MARKUS
Publication of US20020042910A1 publication Critical patent/US20020042910A1/en
Assigned to KONINKLIJKE PHILIPS ELECTRONICS N.V. reassignment KONINKLIJKE PHILIPS ELECTRONICS N.V. TO CORRECT INVENTOR'S NAME FROM "MAUMEISTER" TO BAUMEISTER-PREVIOUSLY RECORDED ON R012398 FRAME 0986. Assignors: KLABUNDE, KARIN, HAUPTMANN, STEFFEN, BAUMEISTER, MARKUS
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1095Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2308Concurrency control

Definitions

  • the invention relates to a network comprising network nodes and to a software system comprising a database management system, which software system is distributed over all the network nodes.
  • the software system comprises a database management system which is provided for calculating a characterizing unit of the data object when a user referred to as a client accesses a data object of the database management system, and the characterizing unit is provided for being transferred to the client and the client is provided for storing the characterizing unit.
  • a database management system takes care of the data transfer as an interface between program (for application) and data.
  • problems may arise from two contending read/write accesses of two clients, which problems often result in data loss and are referred to as so-called lost update problems in the literature. Data losses are caused by the fact that data that were written by a first writing client, are overwritten by a second writing client, without the latter having read the data written by the first client.
  • a client For example, a client behind whom there is an application receives the actual data object together with a characterizing unit calculated by the database management system, which characterizing unit characterizes the data object, for example, in the form of a CRC checksum (Cyclic Redundancy Check) or a hash value, and needs a considerably smaller amount of memory space than this data object.
  • CRC checksum Cyclic Redundancy Check
  • the client If the client intends to make a change of the data object, he will briefly store the characterizing unit to deliver this characterizing unit to the database management system together with the changed data object when the write access is there.
  • the database management system compares the characterizing unit delivered to it by the client with the current characterizing unit calculated by the database management system. If the two characterizing units match, the write access of the client is carried out. If the comparison has a negative result and the characterizing units do not match, the database management system executes alternative actions, for example, the write access is refused or a merge of the data is attempted.
  • the client changes the data object during a processing and in the case of a distributed write operation sends a change indication together with the characterizing unit in a message to the database management system.
  • FIG. 1 shows a network comprising a plurality of network nodes
  • FIG. 2 shows a signaling flow chart to represent the order of the actions during a client's write access to a data object.
  • FIG. 1 shows a network in which a plurality of network nodes 1 to 3 are coupled to each other by a bus system 4 .
  • the bus system 4 may also be any type of network topology or communication system.
  • the network nodes 1 to 3 may also be coupled to the bus system 4 via a wireless connection 5 and a transceiver station 6 .
  • a wireless connection 5 for example, infrared, ultrashell or radio links may be used.
  • Such network nodes may be PCs and apparatus of entertainment electronics such as, for example, a television set, set top box, tuner, camera, digital video recorder, CD player and so on.
  • each of the three network nodes 1 to 3 there are a distributed database management system 7 to 9 and at least one client 10 to 12 .
  • FIG. 2 clarifies the actions during a client's write access to a data object.
  • the client (K 1 ) 10 of the network node 1 and client (K 2 ) 11 of the network node 2 both access a data (data element) stored under a cipher key S 1 .
  • a data object in the database can be identified by means of the cipher key.
  • Both client 10 and client 11 would like to read the data object, locally change it at the respective network node and then overwrite the read data object with the changed data object, so that the change is retained throughout the system.
  • the client 11 asks the distributed database management system (VDBMS 2 ) 8 for the data object stored under the cipher key S 1 via a request 16 which includes the cipher key S 1 .
  • the database management system 8 transfers the request 16 , for example, to its local database (DB 2 ) 14 , which returns the data object to the database management system 8 via a reply 17 .
  • the database management system 8 conveys the reply 17 with the data object and a characterizing unit calculated from the data object to the client 11 .
  • the characterizing unit in this example consists of a checksum CRC 1 .
  • the client 10 reads the data object from the local database (DB 1 ) 13 with a request 18 via the database management system (VDBMS 1 ) 7 . Together with the data object coming from the local database 13 , also a checksum CRC 1 in a reply 19 given by the database management system 7 is delivered to this client 10 . Since the data in the two local databases 13 and 14 were equal, both clients 10 and 11 receive the same characterizing unit CRC 1 .
  • the client 10 changes the data object during a processing 20 and then sends the changed data object together with the cipher key S 1 and the original checksum CRC 1 in a request 21 to the database management system 7 , so that the changed data object can be stored under the cipher key S 1 .
  • the database management system 7 asks, via a request 22 , for the data object stored under the cipher key S 1 from its local database 13 .
  • the database management system 7 receives the desired data object from the local database 13 and calculates its checksum CRC 1 in a self-interrogation 24 .
  • the check of the characterizing unit is to be made in the framework of a two-phase commit protocol.
  • the two-phase commit protocol is used with so-called transactions (a matching sequence of operations accessing a database) which work with distributed databases.
  • the change and also the characterizing unit is then transmitted to all the replica locations and processed there similarly to the non-replicated case.
  • the database management system 7 therefore sends a change request 25 to the database management system 8 .
  • the latter reads the data concerned from the local database 14 by means of a request 26 and a return 27 of the database 14 . Subsequently, the database management system 8 calculates the characterizing unit via a self-interrogation 28 . If this characterizing unit matches the transmitted characterizing unit, the database management system 8 prepares the write operation and commits to the effectuation of the transaction, otherwise it aborts the effectuation of the transaction. If all the replica locations commit, the write operations 30 are actually carried out and confirmed by the respective databases 13 and 14 via a confirmation 31 . The client 10 receives the new value CRC 2 of the checksum of the written data object by means of a return 32 .
  • the client 11 has locally changed the original data object read by him and sends a request 34 containing the checksum CRC 1 originally sent to him to the database management system 8 , to overwrite the data object with the new contents.
  • the database management system 8 asks for the data object stored under cipher key S 1 of the local database 14 via a call 35 .
  • the local database 14 returns the data object overwritten by the client to the database management system 8 in a reply 36 .
  • the database management system 8 calculates the checksum CRC 2 of this data object.
  • the self-interrogation 37 compares the calculated checksum CRC 2 with the checksum CRC 1 transferred to it by the client 11 in the request 34 and establishes that the checksums do not match. For this reason the client 11 is informed via an error message 38 that his write operation has gone wrong.
  • the database management system 8 has detected that the client 11 has not read the data object having the contents changed by the client 10 , but only knows the originally stored data object.
  • the client 11 or the application behind the client 11 may now decide either to dispense with the writing or to read the object anew, change it and write it again. Since the checksums would match after the second reading, the write access could be performed successfully.
  • the distributed database management system 8 can manage methods of merging various changes and implement them after lost update problems have been discovered and thus enable the writing nevertheless.

Abstract

The invention relates to a network comprising network nodes (1 to 3) and to a software system distributed over all the network nodes which comprises a database management system (7 to 9) which is provided for calculating a characterizing unit of the data object when a user, referred to as a client (10 to 12), of the database management system (7 to 9) accesses a data object, and the characterizing unit is provided for being transferred to the client (10 to 12) and the client (10 to 12) is provided for storing the characterizing unit.

Description

  • The invention relates to a network comprising network nodes and to a software system comprising a database management system, which software system is distributed over all the network nodes. [0001]
  • Such a network is known from Ralf Steinmetz (publishers): “Kommunikation in verteilten Systemen (KiVS)”, 11[0002] th ITG/GI Symposium, Darmstadt, Mar. 2-5, 1999, Stephan Abramowski, Heribert Baldus, Tobias Helbig: “Digitale Netze in Wohnungen—Unterhaltungselektronik im Umbruch”, pp. 340 to 351. In this publication requirements are described for a future network in the home area with the software used therein. How write conflicts in databases are detected in such a network with a distributed software system is not further discussed.
  • It is an object of the invention to provide a network comprising a software system which avoids a data loss and thus solves the so-called lost update problem if different users, the so-called clients, of the distributed software system simultaneously have write access to the database. [0003]
  • The object is achieved by a network of the type defined in the opening paragraph in that the software system comprises a database management system which is provided for calculating a characterizing unit of the data object when a user referred to as a client accesses a data object of the database management system, and the characterizing unit is provided for being transferred to the client and the client is provided for storing the characterizing unit. [0004]
  • In a network comprising network nodes and a software system distributed over all the network nodes, a database management system takes care of the data transfer as an interface between program (for application) and data. In databases, whose task is, for example, the management of user and administration data as well as the presetting of apparatus in digital home networks, problems may arise from two contending read/write accesses of two clients, which problems often result in data loss and are referred to as so-called lost update problems in the literature. Data losses are caused by the fact that data that were written by a first writing client, are overwritten by a second writing client, without the latter having read the data written by the first client. [0005]
  • With each read access to a data object a client (for example, a client behind whom there is an application) receives the actual data object together with a characterizing unit calculated by the database management system, which characterizing unit characterizes the data object, for example, in the form of a CRC checksum (Cyclic Redundancy Check) or a hash value, and needs a considerably smaller amount of memory space than this data object. If the client intends to make a change of the data object, he will briefly store the characterizing unit to deliver this characterizing unit to the database management system together with the changed data object when the write access is there. [0006]
  • Before this write access takes place, the database management system compares the characterizing unit delivered to it by the client with the current characterizing unit calculated by the database management system. If the two characterizing units match, the write access of the client is carried out. If the comparison has a negative result and the characterizing units do not match, the database management system executes alternative actions, for example, the write access is refused or a merge of the data is attempted. [0007]
  • The client changes the data object during a processing and in the case of a distributed write operation sends a change indication together with the characterizing unit in a message to the database management system. [0008]
  • In a network comprising data objects identified by characterizing units, it is not necessary to have a central co-ordination unit for the write accesses to data. The detection of conflicts takes place during the write request and the additional information necessary for this can be transmitted via the change data; no additional communication is necessary therefor. Since the characterizing unit can always be calculated from the data stored in the database, no information for detecting write conflicts need be stored in the database either. In consequence, the database management system need not store the status data for securing data in the case of a failure of the network nodes, nor store time data about recently stored data for the detection of conflicts. [0009]
  • These and other aspects of the invention are apparent from and will be elucidated with reference to the embodiments described hereinafter.[0010]
  • In the drawings: [0011]
  • FIG. 1 shows a network comprising a plurality of network nodes, [0012]
  • FIG. 2 shows a signaling flow chart to represent the order of the actions during a client's write access to a data object. [0013]
  • FIG. 1 shows a network in which a plurality of [0014] network nodes 1 to 3 are coupled to each other by a bus system 4. The bus system 4 may also be any type of network topology or communication system. The network nodes 1 to 3 may also be coupled to the bus system 4 via a wireless connection 5 and a transceiver station 6. For this purpose, for example, infrared, ultrashell or radio links may be used. Such network nodes may be PCs and apparatus of entertainment electronics such as, for example, a television set, set top box, tuner, camera, digital video recorder, CD player and so on.
  • At each of the three [0015] network nodes 1 to 3 there are a distributed database management system 7 to 9 and at least one client 10 to 12. In addition, there may be a distributed database 13 to 15 at the network nodes 1 to 3.
  • FIG. 2 clarifies the actions during a client's write access to a data object. In this example, the client (K[0016] 1) 10 of the network node 1 and client (K2) 11 of the network node 2 both access a data (data element) stored under a cipher key S1. A data object in the database can be identified by means of the cipher key. Both client 10 and client 11 would like to read the data object, locally change it at the respective network node and then overwrite the read data object with the changed data object, so that the change is retained throughout the system.
  • The [0017] client 11 asks the distributed database management system (VDBMS2) 8 for the data object stored under the cipher key S1 via a request 16 which includes the cipher key S1. The database management system 8 transfers the request 16, for example, to its local database (DB2) 14, which returns the data object to the database management system 8 via a reply 17. The database management system 8 conveys the reply 17 with the data object and a characterizing unit calculated from the data object to the client 11. The characterizing unit in this example consists of a checksum CRC 1.
  • Similarly, the [0018] client 10 reads the data object from the local database (DB1) 13 with a request 18 via the database management system (VDBMS1) 7. Together with the data object coming from the local database 13, also a checksum CRC1 in a reply 19 given by the database management system 7 is delivered to this client 10. Since the data in the two local databases 13 and 14 were equal, both clients 10 and 11 receive the same characterizing unit CRC1.
  • The [0019] client 10 changes the data object during a processing 20 and then sends the changed data object together with the cipher key S1 and the original checksum CRC1 in a request 21 to the database management system 7, so that the changed data object can be stored under the cipher key S1. Subsequently, the database management system 7 asks, via a request 22, for the data object stored under the cipher key S1 from its local database 13. In a reply 23 the database management system 7 receives the desired data object from the local database 13 and calculates its checksum CRC1 in a self-interrogation 24.
  • If the most recently calculated checksum CRC[0020] 1 matches the checksum CRC1 sent to the database management system 7 by the client 10 in the request 21, the data has meanwhile not been changed and the data object can be overwritten throughout the system without a so-called lost update problem arising. If a replica of the data is present, the check of the characterizing unit is to be made in the framework of a two-phase commit protocol. The two-phase commit protocol is used with so-called transactions (a matching sequence of operations accessing a database) which work with distributed databases. The change and also the characterizing unit is then transmitted to all the replica locations and processed there similarly to the non-replicated case. In the example the database management system 7 therefore sends a change request 25 to the database management system 8. The latter reads the data concerned from the local database 14 by means of a request 26 and a return 27 of the database 14. Subsequently, the database management system 8 calculates the characterizing unit via a self-interrogation 28. If this characterizing unit matches the transmitted characterizing unit, the database management system 8 prepares the write operation and commits to the effectuation of the transaction, otherwise it aborts the effectuation of the transaction. If all the replica locations commit, the write operations 30 are actually carried out and confirmed by the respective databases 13 and 14 via a confirmation 31. The client 10 receives the new value CRC2 of the checksum of the written data object by means of a return 32.
  • Meanwhile, during a [0021] processing 33, the client 11 has locally changed the original data object read by him and sends a request 34 containing the checksum CRC1 originally sent to him to the database management system 8, to overwrite the data object with the new contents. The database management system 8 asks for the data object stored under cipher key S1 of the local database 14 via a call 35. The local database 14 returns the data object overwritten by the client to the database management system 8 in a reply 36. In a self-interrogation 37 the database management system 8 calculates the checksum CRC2 of this data object. The self-interrogation 37 compares the calculated checksum CRC2 with the checksum CRC1 transferred to it by the client 11 in the request 34 and establishes that the checksums do not match. For this reason the client 11 is informed via an error message 38 that his write operation has gone wrong. The database management system 8 has detected that the client 11 has not read the data object having the contents changed by the client 10, but only knows the originally stored data object.
  • The [0022] client 11 or the application behind the client 11 may now decide either to dispense with the writing or to read the object anew, change it and write it again. Since the checksums would match after the second reading, the write access could be performed successfully.
  • Alternatively, the distributed [0023] database management system 8 can manage methods of merging various changes and implement them after lost update problems have been discovered and thus enable the writing nevertheless.

Claims (3)

1. A network comprising network nodes (1 to 3) and a software system distributed over all the network nodes, which software system comprises a database management system (7 to 9) which is provided for calculating a characterizing unit of the data object when a user referred to as a client (10 to 12) accesses a data object of the database management system (7 to 9), and the characterizing unit is provided for being transferred to the client (10 to 12) and the client (10 to 12) is provided for storing the characterizing unit.
2. A network as claimed in claim 1, characterized in that the database management system (7 to 9) is provided for comparing the characterizing unit stored at the client (10 to 12) with the actual characterizing unit, in that the database management system (7 to 9) is provided for executing the write access if the characterizing units match, and in that the database management system (7 to 9) is provided for executing alternative actions if the characterizing units do not match.
3. A network as claimed in claim 2, characterized in that the remote database management system (7 to 9) receives a change indication and a characterizing unit in a respective joint message when there is a distributed write operation.
US09/961,956 2000-09-23 2001-09-24 Method of detecting write conflicts in replicated databases without memory overhead Abandoned US20020042910A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE10047216A DE10047216A1 (en) 2000-09-23 2000-09-23 A method of detecting write conflicts in replicated databases without memory overhead
DE10047216.8 2000-09-23

Publications (1)

Publication Number Publication Date
US20020042910A1 true US20020042910A1 (en) 2002-04-11

Family

ID=7657385

Family Applications (1)

Application Number Title Priority Date Filing Date
US09/961,956 Abandoned US20020042910A1 (en) 2000-09-23 2001-09-24 Method of detecting write conflicts in replicated databases without memory overhead

Country Status (6)

Country Link
US (1) US20020042910A1 (en)
EP (1) EP1204035A3 (en)
JP (1) JP2002149467A (en)
KR (1) KR20020023663A (en)
CN (1) CN1346094A (en)
DE (1) DE10047216A1 (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020194185A1 (en) * 2001-01-16 2002-12-19 Eric Coates Consensus protected database
US20040122869A1 (en) * 2002-12-23 2004-06-24 Gordon Muehl Conflict detection in a distributed system landscape
US20050203911A1 (en) * 2004-03-12 2005-09-15 Knut Heusermann Management of inbound conflicts when merging data of distributed systems
US20100145916A1 (en) * 2008-12-10 2010-06-10 Sap Ag Monitoring updates involving data structures accessed in parallel transactions
US20100257230A1 (en) * 2009-04-03 2010-10-07 Kroeger Robert J Architectural pattern for persistent web application design
US20100257148A1 (en) * 2009-04-03 2010-10-07 Kroeger Robert J Reduced bandwidth cache coherency via checksum exchange
US20100257229A1 (en) * 2009-04-03 2010-10-07 Bolohan Matthew J System and method for reducing startup cost of a software application
US20110173326A1 (en) * 2010-01-14 2011-07-14 Dell Products L.P. System and Method for Accessing Storage Resources
US8407590B1 (en) 2009-02-15 2013-03-26 Google Inc. On-screen user-interface graphic

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100969619B1 (en) * 2009-11-10 2010-07-14 주식회사 쇼텍라인 System of operating moving stage devices and method thereof

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5551023A (en) * 1994-08-05 1996-08-27 Panasonic Technologies, Inc. System of database concurrency control based on transaction types and prior access to a data set
US5574906A (en) * 1994-10-24 1996-11-12 International Business Machines Corporation System and method for reducing storage requirement in backup subsystems utilizing segmented compression and differencing
US5623659A (en) * 1993-04-30 1997-04-22 International Business Machines Corporation Parent/child subset locking scheme for versioned objects
US5758151A (en) * 1994-12-09 1998-05-26 Storage Technology Corporation Serial data storage for multiple access demand
US5778395A (en) * 1995-10-23 1998-07-07 Stac, Inc. System for backing up files from disk volumes on multiple nodes of a computer network
US5894485A (en) * 1997-03-31 1999-04-13 Emc Corporation Disk array write protection at the sub-unit level
US5897642A (en) * 1997-07-14 1999-04-27 Microsoft Corporation Method and system for integrating an object-based application with a version control system
US5941947A (en) * 1995-08-18 1999-08-24 Microsoft Corporation System and method for controlling access to data entities in a computer network
US6008737A (en) * 1995-05-30 1999-12-28 Motorola, Inc. Apparatus for controlling utilization of software added to a portable communication device
US6014730A (en) * 1996-12-26 2000-01-11 Nec Corporation Dynamic adding system for memory files shared among hosts, dynamic adding method for memory files shared among hosts, and computer-readable medium recording dynamic adding program for memory files shared among hosts
US6151708A (en) * 1997-12-19 2000-11-21 Microsoft Corporation Determining program update availability via set intersection over a sub-optical pathway
US6240413B1 (en) * 1997-12-22 2001-05-29 Sun Microsystems, Inc. Fine-grained consistency mechanism for optimistic concurrency control using lock groups
US6401239B1 (en) * 1999-03-22 2002-06-04 B.I.S. Advanced Software Systems Ltd. System and method for quick downloading of electronic files
US6405315B1 (en) * 1997-09-11 2002-06-11 International Business Machines Corporation Decentralized remotely encrypted file system
US6449695B1 (en) * 1999-05-27 2002-09-10 Microsoft Corporation Data cache using plural lists to indicate sequence of data storage
US20020170052A1 (en) * 2001-03-06 2002-11-14 Radatti Peter V. Apparatus, methods and articles of manufacture for data transmission
US6553388B1 (en) * 2000-07-20 2003-04-22 International Business Machines Corporation Database deltas using Cyclic Redundancy Checks

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5202982A (en) * 1990-03-27 1993-04-13 Sun Microsystems, Inc. Method and apparatus for the naming of database component files to avoid duplication of files
AU5386796A (en) * 1995-04-11 1996-10-30 Kinetech, Inc. Identifying data in a data processing system
US6233585B1 (en) * 1998-03-12 2001-05-15 Crossworlds Software, Inc. Isolation levels and compensating transactions in an information system
US6098079A (en) * 1998-04-02 2000-08-01 Mitsubishi Electric Information Technology Center America, Inc. (Ita) File version reconciliation using hash codes

Patent Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5623659A (en) * 1993-04-30 1997-04-22 International Business Machines Corporation Parent/child subset locking scheme for versioned objects
US5551023A (en) * 1994-08-05 1996-08-27 Panasonic Technologies, Inc. System of database concurrency control based on transaction types and prior access to a data set
US5574906A (en) * 1994-10-24 1996-11-12 International Business Machines Corporation System and method for reducing storage requirement in backup subsystems utilizing segmented compression and differencing
US5758151A (en) * 1994-12-09 1998-05-26 Storage Technology Corporation Serial data storage for multiple access demand
US6008737A (en) * 1995-05-30 1999-12-28 Motorola, Inc. Apparatus for controlling utilization of software added to a portable communication device
US5941947A (en) * 1995-08-18 1999-08-24 Microsoft Corporation System and method for controlling access to data entities in a computer network
US5778395A (en) * 1995-10-23 1998-07-07 Stac, Inc. System for backing up files from disk volumes on multiple nodes of a computer network
US6014730A (en) * 1996-12-26 2000-01-11 Nec Corporation Dynamic adding system for memory files shared among hosts, dynamic adding method for memory files shared among hosts, and computer-readable medium recording dynamic adding program for memory files shared among hosts
US5894485A (en) * 1997-03-31 1999-04-13 Emc Corporation Disk array write protection at the sub-unit level
US5897642A (en) * 1997-07-14 1999-04-27 Microsoft Corporation Method and system for integrating an object-based application with a version control system
US6405315B1 (en) * 1997-09-11 2002-06-11 International Business Machines Corporation Decentralized remotely encrypted file system
US6151708A (en) * 1997-12-19 2000-11-21 Microsoft Corporation Determining program update availability via set intersection over a sub-optical pathway
US6240413B1 (en) * 1997-12-22 2001-05-29 Sun Microsystems, Inc. Fine-grained consistency mechanism for optimistic concurrency control using lock groups
US6401239B1 (en) * 1999-03-22 2002-06-04 B.I.S. Advanced Software Systems Ltd. System and method for quick downloading of electronic files
US6449695B1 (en) * 1999-05-27 2002-09-10 Microsoft Corporation Data cache using plural lists to indicate sequence of data storage
US6553388B1 (en) * 2000-07-20 2003-04-22 International Business Machines Corporation Database deltas using Cyclic Redundancy Checks
US20020170052A1 (en) * 2001-03-06 2002-11-14 Radatti Peter V. Apparatus, methods and articles of manufacture for data transmission

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020194185A1 (en) * 2001-01-16 2002-12-19 Eric Coates Consensus protected database
US20040122869A1 (en) * 2002-12-23 2004-06-24 Gordon Muehl Conflict detection in a distributed system landscape
US7092973B2 (en) * 2002-12-23 2006-08-15 Sap Aktiengesellschaft Conflict detection in a distributed system landscape
US20050203911A1 (en) * 2004-03-12 2005-09-15 Knut Heusermann Management of inbound conflicts when merging data of distributed systems
US7366727B2 (en) 2004-03-12 2008-04-29 Sap Aktiengesellschaft Management of inbound conflicts when merging data of distributed systems
US20100145916A1 (en) * 2008-12-10 2010-06-10 Sap Ag Monitoring updates involving data structures accessed in parallel transactions
US8781918B2 (en) * 2008-12-10 2014-07-15 Sap Ag Monitoring updates involving data structures accessed in parallel transactions
US8407590B1 (en) 2009-02-15 2013-03-26 Google Inc. On-screen user-interface graphic
US20100257229A1 (en) * 2009-04-03 2010-10-07 Bolohan Matthew J System and method for reducing startup cost of a software application
US8260876B2 (en) 2009-04-03 2012-09-04 Google Inc. System and method for reducing startup cost of a software application
US20100257148A1 (en) * 2009-04-03 2010-10-07 Kroeger Robert J Reduced bandwidth cache coherency via checksum exchange
US8666954B2 (en) * 2009-04-03 2014-03-04 Google Inc. Reduced bandwidth cache coherency via checksum exchange
US8725793B2 (en) 2009-04-03 2014-05-13 Google Inc. Architectural pattern for persistent web application design
US20100257230A1 (en) * 2009-04-03 2010-10-07 Kroeger Robert J Architectural pattern for persistent web application design
US9086914B2 (en) 2009-04-03 2015-07-21 Google Inc. System and method for reducing startup cost of a software application
US20110173326A1 (en) * 2010-01-14 2011-07-14 Dell Products L.P. System and Method for Accessing Storage Resources
US9189286B2 (en) * 2010-01-14 2015-11-17 Dell Products L.P. System and method for accessing storage resources

Also Published As

Publication number Publication date
EP1204035A2 (en) 2002-05-08
KR20020023663A (en) 2002-03-29
JP2002149467A (en) 2002-05-24
CN1346094A (en) 2002-04-24
EP1204035A3 (en) 2006-03-29
DE10047216A1 (en) 2002-04-11

Similar Documents

Publication Publication Date Title
US6643669B1 (en) Method for optimization of synchronization between a client's database and a server database
US6996583B2 (en) Real-time database update transaction with disconnected relational database clients
CA2205725C (en) Preventing conflicts in distributed systems
EP2200222A1 (en) A data synchronization method, system and device
US10831612B2 (en) Primary node-standby node data transmission method, control node, and database system
US8291101B1 (en) Synchronization of mutually shared data stored on network devices
US20020059279A1 (en) Apparatus and method for database synchronization in a duplex system
US20050240564A1 (en) System and method for state preservation in a stretch cluster
US20020042910A1 (en) Method of detecting write conflicts in replicated databases without memory overhead
US20060101082A1 (en) System and method for integrating continuous synchronization on a host handheld device
CN105162879A (en) Method, device and system for realizing data consistency among plurality of machine rooms
US6836793B1 (en) Method of distributing data packets of system software where the receiving units acknowledge only proper reception
JPH113368A (en) Schedule data managing method in distributed environment, its system and storing medium housing schedule data managing program
US7454402B2 (en) Method for replication tracing
JP2005534099A (en) Database synchronization
JPH11249943A (en) Method and system for synchronous management of distributed data base
EP1391131B1 (en) Data element information management in a network environment
JPH09198293A (en) Wide area data base management system
JP3216618B2 (en) Data failure recovery method for video server device and medium recording data failure recovery program
US20020029240A1 (en) System for the efficient transmission of partial objects in distributed data bases
CN117390078B (en) Data processing method, device, storage medium and computer equipment
KR0174603B1 (en) How to restore the database of the exchange
JPS63278155A (en) Management processing system for decentralized data base
JP2977518B2 (en) Mobile data processing system and mobile terminal data consistency control method
JPH11120059A (en) Network system

Legal Events

Date Code Title Description
AS Assignment

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NETHERLANDS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MAUMEISTER, MARKUS;HAUPTMANN, STEFFEN;KLABUNDE, KARIN;REEL/FRAME:012398/0986;SIGNING DATES FROM 20011015 TO 20011022

AS Assignment

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NETHERLANDS

Free format text: TO CORRECT INVENTOR'S NAME FROM "MAUMEISTER" TO BAUMEISTER-PREVIOUSLY RECORDED ON R012398 FRAME 0986.;ASSIGNORS:BAUMEISTER, MARKUS;HAUPTMANN, STEFFEN;KLABUNDE, KARIN;REEL/FRAME:013148/0707;SIGNING DATES FROM 20011015 TO 20011022

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION