A first copy of a database object may be constructed prior to applying a designated database update request to a first database. The database object may be represented by a plurality of database table rows in the first database, and the request may update one or more of the plurality of rows. The request may be applied to the first database to update the one or more of the plurality of rows in the first database. A second copy of the database object may be constructed after applying the database update request to the first database. A message identifying a difference between the first copy of the database object and a second copy of the database object may be transmitted to a remote computing device.

A method for making a playlist available to the public, in which the playlist comprises user-defined descriptor information. The user-defined descriptor information is entered as free form text or prose.

Example systems and methods for cloning catalog objects are described. In one implementation, a method identifies an original catalog object associated with data and creates a duplicate copy of the original catalog object without copying the data itself. The method allows access to the data using the duplicate catalog object and supports modifying the data associated with the original catalog object independently of the duplicate catalog object. The duplicate catalog object can be deleted upon completion of modifying the data associated with the original catalog object.

The present disclosure relates to a computer implemented method for loading data in a target database system. The method comprises: determining that a load of a source table is expected to occur in the target database system. A future target table may be provided in advance in accordance with a defined table schema, and thereafter a load request for loading the source table may be received. Data of the source table may be loaded into the future target table.

A system for data reconciliation is provided. The data reconciliation system includes a data processing subsystem. The data processing subsystem includes a computation module, configured to generate hash values for a set of tables located in a source database by a hashing technique and also configured generate hash values for a set of tables located in a destination database by the hashing technique. The data processing subsystem also includes an analysis module, configured to analyse the hash values located in the source database and the hash values located in the destination database by a pre-determined rule. The data processing subsystem also includes a suggestion module, configured to suggest output based on the analysis result. A data memory subsystem is configured to store the generated hash values for the source database and the generated hash values for the destination database. Present invention provides safe migration or transferring of data.

A client-side spreadsheet with client-side worksheets is constructed. The constructing includes structuring worksheet relationships between the client-side worksheets of the client-side spreadsheet in accordance with data object relationships of data objects of a server-side data structure. A determination is made that an operation has been selected for performing on data of at least one of the client-side worksheets. User input operative to initiate performance of the at least one of the client-side worksheets is detected. Implementation of the operation is initiated in accordance with the worksheet relationships and the data object relationships.

A portable, hand-held computer functions as an intermediary between a database server and individual aircraft when the aircraft cannot be connected to the database server. By virtue of being portable and being locally linked (over time) to different aircraft, the intermediary computing device can provide the data upload validation and auditing for accurate billing of database usage for a flight database provided from the server. This ensures that each aircraft which receives an uploaded database is entitled to receive the upload based on a paid license. As a result, billing by the database vendor is based on usage. Licensing and data authentication is mediated by the intermediary computing device.

The present disclosure relates to determining the shareability of values of node profiles. Record objects and electronic activities of a system of record corresponding to a data source provider may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Values of fields corresponding to a predetermined type of field including fewer than a predetermined threshold number of data source providers may be identified. A restriction tag used to restrict populating other node profiles may be generated. Provision of the value with a second data source provider may be restricted.

Techniques are provided for resynchronizing a synchronous replication relationship. Asynchronous incremental transfers are performed to replicate data of a storage object to a replicated storage object. Incoming write requests, targeting the storage object, are logged into a dirty region log during a last asynchronous incremental transfer. Metadata operations, executed on the storage object, are logged into a metadata log during the last asynchronous incremental transfer. Sequence numbers are assigned to the metadata operations based upon an order of execution. The metadata operations are replicated to the replicated storage object for execution according to the sequence numbers, and the dirty regions are replicated to the replicated storage object in response to the metadata operations having been replicated to the replicated storage object. The storage object and replicated storage object are transitioned to a synchronous replication state where incoming operations are synchronously replicated to the replicated storage object.

Disclosed herein are exemplary systems and methods for garbage collection and/or deletion in a document database. The methods may include, for each change in a first change set, determining whether a first characteristic of the change is superseded by a second characteristic of a corresponding change in a second change set. The change of the first change set and the change of the second change set can pertain to a document attribute. The method may include determining whether the first change set is redundant with the second change set if each change of the first change set is superseded by a corresponding change of the second change set, and eliminating the first change set from the document database when the first change set is redundant with second change set.