Abstract: A method for backing up a client data set on a computer by generating a manifest of the client data set and storing the manifest on a remote server along with a server data set corresponding to the client data set; taking a snapshot of the server manifest and data set; and comparing the manifest to the remote server data set and synchronizing the client dataset if a difference is detected.

Abstract: In a process for migrating a virtual machine's storage from a source disk to a destination disk, during a steady state (i.e., wherein the contents of the virtual machine stored on the source disk and the destination disk are equal), a virtual machine monitor receives a set of write requests from a guest operating system (“guest”) of the virtual machine, provides confirmation of the completion of the set of writes to the source disk, and asynchronously replicates the set of write requests to the destination disk. Upon receipt of a flush request from the guest, the virtual machine monitor confirms completion of the flushing of the destination disk following replication of the write requests to the destination disk. Upon receipt of a switch request from a virtual machine manager, the virtual machine monitor switches the virtual machine to the destination disk and issues subsequent write requests to the destination disk.

Abstract: Systems, methods and computer program products for determining completion of asynchronous commands in a library system and providing an indication of the completion to a synchronous component of the media library system so that commands which are dependent upon the completion can be efficiently issued and executed. In one embodiment, a tape is mounted in a drive of the library and a command is issued to initiate an asynchronous filesystem mount operation. Diagnostic information generated by the operating system for this operation is communicated to the media library management application via a pipe. When the filesystem mount process is completed, a corresponding diagnostic message is communicated to the media library management application through the pipe. Until this message is received by the media library management application, commands that are dependent upon the completion of the filesystem mount process are inhibited, and afterward these dependent commands are allowed to be issued.

Abstract: Synchronization of metadata structures in a multi-threaded system includes receiving, by a first thread of a processing device, a request for a metadata structure located in a first cache associated with an object, obtaining, by the first thread of the processing device, a synchronization mechanism associated with the first cache, holding, by the first thread of the processing device, the metadata structure associated with the object, receiving, by a second thread of the processing device, a request for the metadata structure in a second cache associated with the object, obtaining, by the second thread of the processing device, a synchronization mechanism associated with the second cache and informing the second thread of the processing device that the metadata structure associated with the object is not available.

Abstract: A method may receive, at a first node, a first message with a first message data structure from a second node. The first message data structure may include a counter for each resource of a plurality of resources that is indicative of a most current age of a master copy of the resource known by the second node. The first node may include a current data structure with a counter for each resource that is indicative of a most current age of the master copy of the resource known by the first node. The method may determine whether at least one counter in the current data structure is older than the corresponding counter in the message data structure. The method may update the counter that is older, e.g., to learn the most current age of the master copy of the resource known by the second node, based on the determination.

Abstract: Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node.

Abstract: A computer system that provides a social network for traveling people includes software that maintains a list of members and buddies of the members. Each member has at least one association to a unique person identifier. The software downloads schedule(s) from pre-determined schedule system(s). Each schedule has records with a person identifier, at least one date/time, and a location. The software searches the schedule(s) and extracts a subset of records in which the person identifier corresponds with the unique person identifier of any member and the software creates layover entries from the subset. The software searches the layover entries for overlapping layovers, determined by a first member having a layover that overlaps with a layover of a buddy member (e.g. having the same or similar location). For each overlapping layover, the software notifies either the member and/or the buddy who have the overlapping layover.

Abstract: Described herein is a novel technique for implementing an unordered delivery (UOD) of write logs between nodes in a cluster to optimize processing resources during log mirroring operations. A mirroring entry may be generated for each write log in a local log cache constituting the write log and an order indicator for the write log. The order indicator may be, for instance, a storage location of the write log in the local log cache. The mirroring entry may then be forwarded across a network from the local node to the remote node, where the mirroring entry may be stored at a next available location of an interim cache at the remote node independent of the write log storage location in the local log cache.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: Handling asynchronous data provided by at least two sources includes synchronizing data between the at least two sources, coordinating cycle switching between the at least two sources, where an asynchronous cycle of data from one of the sources corresponds to an asynchronous cycle of data from an other one of the sources, receiving asynchronous data corresponding to a data cycle from at least one of the sources, and saving at least some of the received data. A first portion of data for a particular cycle may be transmitted from one of the sources and a second portion of data for the particular cycle, different from the first portion of data, may be transmitted from an other one of the sources and the first portion and the second portion together may correspond to all of the data for the particular cycle.

Abstract: Mailbox pooling pre-emptive criteria is set forth for use in an adaptive polling system for synchronizing data between a mail server and a mobile communication device. The polling engine stores an indication of the number of messages in the mailbox, the total mailbox size (i.e. the used storage size in bytes), and the last message ID from the last poll. In the next poll, the polling engine retrieves this information from the mailbox and checks against the values stored from the last poll. If the information is the same, then there is no need to compare the message ID list. Whenever either the number of messages in the mailbox or the mailbox size or last message ID has changed, then the full comparison of the message ID list is performed.

Abstract: A really simple syndication (RSS) feed generator provides a set of data related to an entity to a user in the form of a really simple syndication (RSS) feed in a manner so that the set of data includes entity information at the feed-level. A user of the RSS feed may use the feed-level entity information to consume the set of data in a number of different ways. In an embodiment, the feed-level entity information includes meta-data defining the entity such that a user may use the metadata to display the entity on the client side. The RSS feed generation system allows a user to manipulate a copy of an instance of entity data as necessary for a client.

Abstract: Disclosed are various embodiments for synchronizing data stores. A notification is received indicating that a write transaction was performed to a data store. The notification includes a path used by the write transaction. When a predetermined delay has passed after the receipt of the notification, a read is performed from the path included in the notification. In response to at least completion of the read, data returned by the read is written to a different data store.

Abstract: Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying and scoring restricted-locality synonyms. In one aspect, a method includes receiving a search query including a query term and a synonym for the query term. The synonym is evaluated using one or more predetermined criteria and based on the evaluation is designated as a restricted-locality synonym. A first scoring model is selected that specifies how to score occurrences of restricted-locality synonyms in documents. A document is received that is identified as being responsive to the search query. A document score for the document is determined using the first scoring model.

Abstract: For each of one or more existing nodes in a file system, pending notifications of updates that have been performed on the node can be identified and sent to one or more other nodes. The file system can be opened for use, and one or more other nodes can be updated in response to the pending notifications while the file system is open for use. For example, this may be done in an operation for recovering from a crash of the file system. Also, a process for dealing with stale data in container nodes in a file system can include processing access requests according to a stale data scheme.

Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances.

Abstract: A distributed system of data centers is configured to ensure that all data operations involving specific accounts are performed within a given time frame at only one data center. Once a data center has begun accessing data that is associated with an account, all requests to access or manipulate data for that account are redirected to that data center for a period of time. Thus, the data center becomes not only the “owner” of all data associated with the account for that period of time, but also the servicer of all requests associated with the account. The data center then asynchronously replicates changes to the data associated with the account to the other data centers. Since none of the other data centers are permitted to change the data associated with the account, conflicts in the replicated data are minimized.

Abstract: System and method of sequencing distributed asynchronous messages. An inbound handler receives an incoming message with a sequence correlation value that identifies a sequence comprising the incoming message, and checks for a sequence status of the sequence. If the sequence status indicates that none of multiple outbound handlers is currently processing a message for the sequence and if the incoming message is the next message to be processed for the sequence, then the incoming message is forwarded to a queue storage and subsequently forwarded to an available outbound handler. If the sequence status indicates that at least one of the outbound handlers is currently processing a message of the sequence, if the queue storage already comprises a message to be processed for the sequence, or if the incoming message is not the next message to be processed for the sequence, then the incoming message is stored in overflow storage.

Abstract: A first database comprises a data entity and a first data model that models the data entity. An agent comprises a data rule concerning the data entity. A plurality of second databases comprises the data entity. A messaging module comprises the agent and is configured to send a message to at least one of the second databases according to the data rule and the general data model.

Abstract: A clustered database environment (e.g. Oracle Real Application Cluster (RAC)) includes multiple database instances that appear as one server. An application server (e.g. WebLogic Server (WLS)) can use a data source (e.g. an Oracle GridLink data source) and connection pools to connect with the clustered database. In accordance with an embodiment, a data source configuration allows for specification of a preferred affinity policy, such as a data affinity, temporal affinity, and/or session or session-based affinity policy. In accordance with an embodiment, the system includes a number of features that improve application connectivity in the clustered database environment, including a select-only case for application continuity, wherein an application-independent infrastructure, e.g. implemented within a Java Database Connectivity (JDBC) driver, enables recovery of work from an application perspective and masks system communications, hardware failures and hangs.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying and scoring restricted-locality synonyms. In one aspect, a method includes receiving a search query including a query term and a synonym for the query term. The synonym is evaluated using one or more predetermined criteria and based on the evaluation is designated as a restricted-locality synonym. A first scoring model is selected that specifies how to score occurrences of restricted-locality synonyms in documents. A document is received that is identified as being responsive to the search query. A document score for the document is determined using the first scoring model.

Abstract: A relational database replication system includes a client, at least one primary database, a plurality of secondary databases and replication agents which coordinate database transactions. The system provides a high level of performance, reliability, and scalability with an end result of efficient and accurate duplication of transactions between the primary and secondary databases. In one implementation, the client transmits sets of database update statements to the primary database and primary agent in parallel; the primary agent replicates the statements to at least one secondary agent. A transaction prepare and commit process is coordinated between the primary database and the primary agent, which in turn coordinates with the at least one secondary agent.

Abstract: User profiles of remote desktops are managed in a crash-consistent manner. When a user logs into a remote desktop, metadata of the user profile is loaded from persistent storage while registry settings and files of the user profile are loaded asynchronously with respect to the login. During the remote desktop session, snapshots of the remote desktop image in persistent storage are generated periodically, and a change log that indicates changes to the user profile is created therefrom. The user profile stored in persistent storage is updated lazily using the change log at opportunistic times after snapshot generation. When the user logs out of the remote desktop, the user profile stored in the persistent storage is updated with any additional changes to the user profile by extracting the changes from the copy-on-write cache associated with the most recent snapshot.

Abstract: The present invention relates to a method of data uplink synchronization between a mobile terminal and a server. The server modifies the stored address book data one item by one item. The present invention also relates to a method of data downlink synchronization between a mobile terminal and a server. Before the server sends address book data to the mobile terminal requesting the downlink synchronization, it performs item-by-item adaptation of the address book data according to the item's attribute and parameter supported by the mobile terminal. The present invention relates to another method of data downlink synchronization between a mobile terminal and a server. The mobile terminal, according to the received address book data, modifies the stored address book one item by one item.

Abstract: Synchronization of two or more items can be optimized through the use of parallel execution of synchronization tasks and adaptable processing that monitors and adjusts for system loading. Two or more synchronization tasks required to be performed for an item can, if not inherently serial in nature, be performed in parallel, optimizing synchronization of the item. Even if multiple synchronization tasks required for one item must be serially executed, e.g., download the item prior to translating the item, these synchronization tasks can be executed in parallel for different items, optimizing a download request involving two or more items. Moreover, multiple threads for one or more synchronization tasks can be concurrently executed when supportable by the current operating system resources. Rules can be established to ensure synchronization activity is not degraded by the overextension of system resources.

Abstract: A method is provided for processing base level data of a change queue that is not serialized at the logical level. The base level change queue data is transaction data previously posted to a source database. A logical replication engine is provided to replicate and post the change queue data to a target database in the order that the transaction data is stored in the change queue. Upon detection in the logical replication engine of change queue data that is not serialized at the logical level, the change queue data is reserialized at the logical level before the logical replication engine applies the change queue data to the target database. The change queue data that is not serialized at the logical level may be posted to the target database using asynchronous database access.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: Systems and methods are disclosed for offloading collection of monitored data. A data collector is associated with a plurality of monitored data sources and with a plurality of monitored data recipients. The data collector collects a cycle of monitored data from each of the sources of monitored data and persistently stores each of the cycles of monitored data in a separate monitored data package. The data collector provides the monitored data packages to the associated monitored data recipients in a manner that is asynchronous to the collection of the monitored data.

Abstract: A method for reducing data transfers while eliminating data loss during database replication includes receiving one or more database log write operations caused by an application making updates to a database. The method also includes writing the one or more database log write operations on a database log stored at a primary site and asynchronously mirroring the database log to a secondary storage device located at a secondary site. The method also includes synchronously storing the one or more database log write operations on a secure storage unit at the primary site and receiving an indication of a disaster event at the primary site. In response to the indication of the disaster event, transmitting only the one or more database log write operations stored to the secure storage unit during a time interval to the secondary storage device.

Abstract: According to one aspect, embodiments of the invention provide a data replicator comprising a system exit configured to capture data received at a source, the captured data including a plurality of individual messages, a message broker configured to receive the plurality of individual messages from the configuration control system and to convert the plurality of individual messages to a format of a destination, and a sequence engine in communication with the message broker via a channel, the sequence engine configured to receive and store the converted plurality of individual messages, to re-sequence the converted plurality of individual messages into a desired sequence, and to provide the re-sequenced messages to a destination database in the desired sequence, wherein the sequence engine includes a message throttle which is configured to close the channel in response to a determination by the message throttle that the sequence engine cannot receive additional converted individual messages.

Abstract: According to one aspect, embodiments of the invention provide a data replicator comprising a system exit configured to capture data received at a source, a configuration control system configured to receive captured data from the system exit and modify the captured data to include sequence information, a message broker configured to receive the modified data from the configuration control system and to convert the modified data to a format of a destination, and a sequence engine configured to receive the converted and modified data from the message broker in a first sequence, to re-sequence, based on the sequence information, the converted and modified data in the first sequence into a second sequence, where the second sequence corresponds to the chronological order in which the data was captured by the system exit, and to forward the converted and modified data to the destination database in the second sequence.

Abstract: A method and system are disclosed for remotely monitoring and controlling traditional software application/computer program behavior through the use of a hybrid client-server data proxy controller (DPC). The client DPC intercepts application read/write/delete operations and relays the operations to the data storage area(s). Activity information is asynchronously sent to a server DPC in a remote computing environment where the monitored activity is recorded, analyzed, and application business logic is processed. The server DPC sends instructions back to the client DPC, whereby modifications to the client DPC behavior, software application, and data storage area can be made.

Abstract: Method, system, and computer program product embodiments for synchronizing workitems on one or more processors are disclosed. The embodiments include executing a barrier skip instruction by a first workitem from the group, and responsive to the executed barrier skip instruction, reconfiguring a barrier to synchronize other workitems from the group in a plurality of points in a sequence without requiring the first workitem to reach the barrier in any of the plurality of points.

Abstract: The invention provides a mechanism for a transaction coordinator to indicate to a transaction participant that it supports a heuristic outcome, where a course of action has occurred which means that the transaction participant is unable to honor a transactional prior commitment to the transaction coordinator. The mechanism is such that a transaction participant that is incapable of communicating a heuristic outcome may ignore any such indication. A transaction participant may be incapable because it does not understand the concept of a heuristic outcome at all or because it does not have the ability to inform the transaction coordinator that a heuristic outcome has occurred.

Abstract: A computing device receives a request to perform a Lightweight Directory Access Protocol (“LDAP”) database operation and propagates the request to perform the LDAP database operation to a peer server to test the LDAP database operation at the peer server. The computing device executes an action on a distributed LDAP database based on a result of testing the LDAP database operation at the peer server.

Abstract: An internet based method and system for communicating terms and conditions of an issued export license to all parties (e.g., exporter, distributor, consignee) in a transaction. The system directs prescribed export related messages from the exporter to the parties. The messages include instructions to the recipients to take certain actions required by the export license terms, and directs those parties to report the results back to the exporter.

Abstract: A method for managing a data storage system includes maintaining a record on a secondary storage subsystem, which is predictive of locations to which data are to be written on a primary storage subsystem by a host processor. Upon receiving at the primary storage subsystem, from a host processor, the data to be written to a specified location, if the specified location is not included in the record, the primary storage subsystem sends to the secondary storage subsystem so as to cause the secondary storage subsystem to update the record. The primary storage subsystem signals the host processor that the data have been stored in the data storage system responsively to receiving the data and to receiving an acknowledgment from the secondary storage subsystem indicating that the record has been updated.

Abstract: A system for defining a plurality of extended tables, wherein each extended table of the plurality of extended tables is associated with a corresponding base table of a plurality of base tables. The system updates data contained by the plurality of extended tables in accordance with data contained by the plurality of base tables, wherein the updating is performed asynchronously across logical units of data contained by the plurality of extended tables. The system provides a combined view of the data contained by the plurality of extended tables and the data contained by the plurality of base tables.

Abstract: A synchronization unit examines the packets on a network to determine the changes being caused to a database server, and propagates the same changes to corresponding backup server(s). As the synchronization is implemented in a separate unit, the throughput performance of database servers may not be impeded due to the synchronization requirement.

Abstract: Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node.

Abstract: Processing messages. Messages are processed based on a characteristic derived from information in messages, metadata about messages, or other information external to messages. Values for one or more pieces of information are received. At least one of the values for one or more pieces of information is associated with a first message. Queries are received. The queries specify one or more of the pieces of information. At least a portion of the plurality of values for the one or more pieces of information is processed in conjunction with the one or more queries to create one or more normalized characteristics for the first message. The one or more normalized characteristics for the first message are in a same format irrespective of the format of the pieces of information. The first message, and/or other messages, is processed based on at least one of the one or more normalized characteristics.

Abstract: A first storage system stores information relating to the updating of data stored in that system as a journal. More specifically, the journal is composed of a copy of data that was used for updating and update information such as a write command used during updating. Furthermore, the second storage system acquires the journal via a communication line between the first storage system and the second storage system. The second storage system holds a duplicate of the data held by the first storage system and updates the data corresponding to the data of the first storage system in the data update order of the first storage system by using the journal.

Abstract: Indexes for predefined search orders of items in a database are generated and stored. When a client issues a database query a responsive pre-generated index list is retrieved and provided to the client for use in, e.g., populating a U/I view for a user. Only those items that a client needs, e.g., for populating a current U/I view, are retrieved from the database and output to the client. When a change is rendered to the database, e.g., an item is added or deleted or an existing item is altered, only the change is output to the client, rather than the entire modified index or altered item. In this manner clients can more quickly and efficiently respond to user data query requests by performing some processing upfront and by limiting communications traffic to communications relevant to the client's current processing.

Abstract: A method and system of tiered quiescing is disclosed. In one embodiment, a method includes generating a representation data of a multi-tier network, embedding a flag marker at a transaction event based on at least of an event data and a timing data, and quiescing, based on the representation data, a set of modules of the multi-tier network associated with at least one of the event data and the timing data using the flag marker. The representation data may be generated based on a transaction modeling of data flows between the set of modules of the multi-tier network (e.g., the set of modules may each operate in different tiers of the multi-tier network). In addition, a series of consistency points may be determined based on the transaction modeling of data flows between the sets of modules of the multi-tier network.

Abstract: Systems and methods for reslicing data in a representation of a relational database are disclosed. In one embodiment, the database includes a representation including a first slice. The database system creates a plurality of new slice and to create a plurality of write queues. The database system copies units of data in the first slice to the new slices according to a distribution function. The distribution function determines, for each unit of data in the first slice, one of the new slices into which to copy the unit of data. The database system asynchronously writes one or more actions of a set of one or more asynchronous database transactions to the first slice when copying the data in the first slice to the new slices. The database asynchronously enqueues the one or more actions of the set of asynchronous database transactions in the write queues according to the distribution function.

Abstract: A wireless handheld device operable to continuously synchronize PIM information with a host desktop computer. The device comprises a software module for updating a handheld PIM database to reflect a change to PIM information, a software module for updating a handheld mirror database to reflect the change to PIM information, a software module for generating a PIM message relating to the change to the PIM information, a software module for translating the PIM message from a handheld data format into a network data format and a software module for sending the PIM message from the client wireless handheld device to the host desktop computer via a wireless network.

Abstract: Disclosed are systems and methods for synchronizing data present in a target data set with data present in a source data set. The data present in the target data set is partitioned to determine a partition definition of the target data set. A target message digest is calculated for the data present in each partition of the target data set. Based upon the partition definition of the target data set, the data present in the source data set is partitioned. A source message digest is calculated for the data present in each partition of the source data set. The source message digest of a partition is compared with the target message digest of a corresponding partition to capture a change in data present in the source data set. Based upon the captured data, the data in the target data set is synchronized with the data in the source data set.

Abstract: An event server running an event driven application implementing an event processing network. The event processing network can include at least one processor to implement a rule on at least one input stream. The event processing network can define concurrent operation of at least two components of the event processing networks.

Abstract: Continuous access to an application and associated data is provided during a modification (for example, an upgrade) of the application. Shared tables are used to perform parallel changes in databases associated with an original database schema, a temporary database schema, and an upgraded database schema. Aliases are used to access shared tables from some database schemas. The use of shared tables obviates a separate merging of data written by different tools and/or systems during an upgrade of the application. Related methods, apparatuses, systems, techniques and articles are also described.