Abstract: Locking allocated data space is disclosed. An indication is received that certain previous version data is required to be retained. A map of metadata records, each associated with a journaling process write of previous version data which write includes previous version data required to be retained, is built. In some embodiments, the map associates a write time with each record in the map. A reclamation process checks to determine whether any storage proposed to be reclaimed is included in the map of record identifiers. In some embodiments, the determination is made based at least in part on the write time associated in the map with at least a first record identifier in time-sorted order.

Abstract: There is described a method, apparatus and a memory storing a computer program that operates to back-up data on a computer readable memory; and responsive to receiving a restore request to select a subset of the stored back-up data for restoring to a device based on operational capabilities of the device. In various embodiments, the operational capabilities can be determined from device capability indications received from the device which are used to select individual files of the back-up data set; security hashes on individual files can be generated, and sent to the device for each file of the subset; and/or the stored backup data is from a first device and the subset is restored to a second device based on operational capabilities of the second device which differ from those of the first device (for example, language capabilities of a multi-lingual software package).

Abstract: A method and system for performing garbage collection operations on update blocks in a memory device using volatile memory is disclosed. When performing a garbage collection operation, a first part of the data related to the garbage collection operation is written to a volatile memory in the memory device, and a second part of the data related to the garbage collection operation is written to a non-volatile memory in the memory device. The first part of the data that is written to the volatile memory (such as a random access memory) may comprise control information (such as mapping information of the logical addressable unit to a physical metablock). The second part of the data related to the garbage collection that is written to the non-volatile memory (such as a flash memory) may comprise the consolidated data in the update block.

Abstract: This patent application relates to enhanced logical recovery techniques for redo recovery operations of a system with an unbundled storage engine. These techniques can be implemented by utilizing an enhanced logical recovery approach in which a dirty page table (DPT) is constructed based on information logged during normal execution. The unbundled storage engine can include a transaction component (TC) that is architecturally independent of a data component (DC). These techniques can enhance redo recovery operations by mitigating the resources needed to determine whether previously executed operations sent from the TC to the DC are to be repeated in response to a recovery-initiating event.

Abstract: The present invention is embodied in an online-like transaction processing method and system for processing account information contained in batch process files, the method including: reading at least one batch file containing a plurality of records, each of the plurality of records being related to an associated one of a plurality of accounts; identifying which of the plurality of records relate to same ones of the plurality of accounts; identifying one of the accounts; and, processing all of the records identified as relating to the one of the accounts together and independent of processing any of the records relating to any other of the plurality of accounts.

Abstract: Disclosed are methods and computer program product for securing data corresponding to one or more data fields of a form by providing data integrity, confidentiality and non-repudiation. The present invention includes providing one or more controls for enabling selection of at least one security type for each of the data fields corresponding to the form. Further, at least one security routine is implemented for the data fields to produce corresponding secured data. The at least one security routine corresponds to the selected at least one security type. Further, a system for securing the data is also disclosed.

Abstract: The present invention is directed to methods and systems of implementing a guaranteed SQL insert operation. In one embodiment, the method may include initiating an SQL insert operation for a database, receiving an SQL exception indicating that a failover for the database has occurred, and in response to the SQL exception, caching the SQL insert operation and caching the SQL insert operation as an SQL merge operation. The method further includes determining that a primary key is associated with the SQL insert operation, and in response to determining that a primary key is associated with the SQL insert operation, executing the SQL merge operation.

Abstract: Approaches for replicating data in a distributed transactional system. At a first node of a cluster, a per-transaction write set that comprises a plurality of write operations that are performed against a first data store maintained by the first node is committed. The per-transaction write set is replicated from the first node to a second node of the cluster. At the second node, the plurality of write operations, specified by the per-transaction write set, may be performed in parallel against a second data store maintained by the second node. At the second node, two or more threads may perform a portion of the plurality of write operations against data blocks stored within an in-memory buffer.

Abstract: In one embodiment, accessing, using a computing device, a batch file comprising a plurality of events generated by a remote game client application executing an instance of a computer-implemented game; accessing, in response to the batch file, a game state data object associated with the instance of the computer-implemented game, wherein the game state data object includes one or more game state parameters formatted as serialized unstructured data; parsing the game state data object to identify the one or more game state parameters; processing the plurality of events in the batch file against game logic to update one or more of the game state parameters; re-serializing the one or more game state parameters into an updated game state data object; and storing the game state data object in a memory cache.

Abstract: Data records in files may be validated by sequentially accessing the data records while allowing random data access within a sliding window. The data records may also be validated by caching record values. Variable-length record lists in one or more files may be reduced to fixed length record lists while accessing arbitrary record list items.

Abstract: To reduce or avoid multiple calls for authentication, during mobile device provisioning for broadband connectivity which might otherwise be caused by add-ons associated with a browser, a provisioning gateway or server system maintains a database of records of source addresses and associated mobile numbers. The records may also indicate time of last request from each address. In response to a new request, the system determines if there is a record for the source address. If there is a record, and in our example, if the record indicates that time since the last prior request is less than a threshold value, then the system continues provisioning processing for the device but without any communication with an authentication system. However, if there is no record or if the last request from a source address is older than the threshold, then the system communicates with the authentication system to obtain the directory number for the mobile device.

Abstract: A method, a data processing system, and a computer program product for protecting data in a database. A query to a database in a data processing system is received by a security mechanism in the data processing system that is external of the database. The query is converted to a modified query according to a security policy. The modified query is sent to the database, and a response to the modified query is returned.

Abstract: A method and system for performing a graph search, includes constructing an abstract representation of the graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.

Abstract: Changes are managed in a multi-user database application environment. Proposed changes are collected, including changes to data, schema, and/or application descriptions. A user may specify foreign key relationships between items belonging to one or more of these categories. A view is produced showing the impact proposed changes would have on the environment if successfully committed. The user's proposed changes are ordered according to their dependencies, and submitted for committal together in a single transaction, subject to optimistic concurrency and consistency checks. For example, a proposed change to a data value may be inconsistent with a change which removed a data element containing the data value. The commitment operation may return identifiers and other return values, in addition to indicating whether the commitment was successful.

Abstract: Background synchronization of data objects may be provided. A background thread associated with an application may be created. A first data item associated with the application may be opened by the background thread and a copy of the first data item may be created. A modification may be performed on a property of the first data item. If no second data item is associated with a pending modification, the first data item may be replaced with the modified copy of the first data item.

Abstract: Components of a distributed server system are configured through replicating configuration data from a central configuration store to server machines. Configuration data is placed in globally identifiable containers or batches. A master replication agent service and a file transfer agent service running in conjunction with a central data storage unit are responsible for replicating configuration data within the batches to other machines in the deployment. A replica replication agent service running on the individual machines updates its own state and posts its latest status back to the central replication services, which upon receiving the status from every machine pushes changes to synchronize the machines with the latest configuration in central store.

Abstract: A system includes a database instance, a data storage system, and a database management system. The data storage system stores a first data partition and a second data partition. The first data partition includes a first plurality of database pages storing tenant-independent data and a first converter associated with the first partition. The second data partition includes a second plurality of database pages storing tenant-independent data and a second converter associated with the second partition.

Abstract: A method of replicating a deduplicated storage system is disclosed. The method comprises storing a stream of data on an originator deduplicating system by storing deduplicated segments and information on how to reconstruct the stream of data. The method further comprises replicating the originator deduplicating system by receiving a copy of the deduplicated segments, information regarding containers for the deduplicated segments, and information on how to reconstruct the stream of data transferred from the originator deduplicating system to the replica system.

Abstract: Backing up data blocks is disclosed, including: receiving an indication that a first backed up data block is to be processed; determining that the first backed up data block and a second backed up data block are related at an application level and are to remain stored together; and processing together the first and second backed up data blocks based at least in part on the determination that the first and second backed up data blocks are related at an application level and are to remain stored together.

Abstract: The invention provides an efficient apparatus and method for deleting items within a distributed datastore. Deletion of items is accomplished using anti-items having the same structure as a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item, wherein the single tag, flag, or bit but does not affect the location at which a data item or anti-item is ultimately stored within the datastore, thereby ensuring that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item.

Abstract: In a state where the migration source NAS apparatus is continuously operated, a migration processing program confirms the update date and time of files stored in the migration source NAS apparatus, and migrates only the files that were not updated from a specific time to the start date and time of migration processing. Or, the migration processing program migrates the files stored in the migration source NAS apparatus sequentially from the oldest file. The migration performance is calculated based on the capacity and migration time of the migrated files, and the time required for migrating the non-migrated files is calculated based on the size and migration performance of the non-migrated files.

Abstract: In certain embodiments, a tiered storage system is disclosed that provides for failover protection during data backup operations. The system can provide for an index, or catalog, for identifying and enabling restoration of backup data located on a storage device. The system further maintains a set of transaction logs generated by media agent modules that identify metadata with respect to individual data chunks of a backup file on the storage device. A copy of the catalog and transaction logs can be stored at a location accessible by each of the media agent modules. In this manner, in case of a failure of one media agent module during backup, the transaction logs and existing catalog can be used by a second media agent module to resume the backup operation without requiring a restart of the backup process.

Abstract: Multiple versions of a set of data objects can be maintained to allow concurrent conflicting access to the objects. Additionally, a range of acceptable timestamps for each transaction in a set of database transactions can be tracked. Conflicting access requests for an object in the set of objects can be detected, and the requests can be made by two or more conflicting transactions in the set of transactions. A range of acceptable timestamps for at least one of the conflicting transactions can be adjusted, such that an order of transaction timestamps can be maintained in accordance with a specified transaction isolation level. Such timestamp range adjustment can frequently permit conflicting read and write accesses to proceed concurrently. When concurrent access cannot be allowed while maintaining such an order of transaction timestamps, in many cases one of the conflicting accesses can be blocked instead of aborting one of the transactions.

Abstract: A replicated state machine with N replica servers may be configured to tolerate a count of F faults. A first operation (of a first ordering type) executes when a first quorum of correctly functioning replicas is available. A second operation (also of the first operation type) executes when a second quorum of correctly functioning replicas is available. A third operation (of a second ordering type) executes when a third quorum of correctly functioning replicas are available. The operations are executed by the replicated state machine such that: (1) the replicated state machine does not guarantee operational ordering between the first operation and the second operation; (2) the replicated state machine guarantees ordering between the first operation and the third operation; and (3) the replicated state machine guarantees ordering between the second operation and the third operation.

Abstract: Rule sets are managed as a web service. A web service request having at least a body and an endpoint address is received from a client. The endpoint address includes a service description parameter and a parameter identifying a path to a given rule set in a rule set. The body of the web service request is parsed to determine whether the body identifies a first type of method or a second type of method. If a first type of method is identified, a service description file is dynamically generated in a format specified by the service description parameter in the web service request. The service description file is based on the rule set path, information from the rule set database and model data. If a second type of method is identified, the identified rule set is executed. The first type of method may be a GET method while the second type of method may be a POST method.

Abstract: In one embodiment a network attached storage device comprises at least one input/output port, at least one storage media, and a network caching module to receive, in the network attached storage device, a backup request from a computing device communicatively coupled to the network attached storage device, wherein the backup request identifies at least a first file, determine, in the network attached storage device, whether the at least a first file associated with the backup request resides on a storage media in the network attached storage device; and in response to a determination that the at least a first file associated with the backup request resides on a storage media in the network attached storage device executes the backup request against the at least a first file associated with the backup request which reside on a storage media in the network attached storage device, and initiates a remote backup operation to a remote network-based storage device coupled to the network attached storage device.

Abstract: A system includes a first storage apparatus and a second storage apparatus. The first storage apparatus includes: a generating unit to generate logs, in response to updates performed on a database in the first storage apparatus, related to the updates; a storage unit to store the logs and data representing the order of generation of each of the logs; and a transmitting unit to transmit, when the logs and the data are stored in the storage unit, the log and the data to the second storage apparatus. The second storage apparatus includes: a receiving unit to receive the logs and the data transmitted by the transmitting unit; and an updating unit to update a database in the second storage apparatus based on the logs in accordance with the order represented by the data.

Abstract: A method executes a simulation to determine backup times to backup objects to storage devices using a number of concurrent disk agents that are assigned to each of the storage devices. The number of concurrent disk agents is changed during the backup of the objects to the storage devices.

Abstract: A solid state memory stores a mirror image of a computer hard drive. The solid state memory is coupled with a wireless communication chip, such as 3G, in order to enable dynamically updating the files on the solid state memory. Any modifications done to the files on the hard drive are synced with the files on the solid state memory. Similarly, any modifications done to the files on the solid state memory are synced with the files on the hard drive.

Abstract: A method for providing database reorganization statistics across timestamp recoveries, includes: appending statistical data for a database reorganization associated with a timestamp to a statistics file; determining that the database reorganization has resumed after a suspension; obtaining a resume timestamp; retrieving statistical data within the statistics file corresponding to the resume timestamp; and appending statistical data for the resumed database reorganization to the retrieved statistical data. Further raw statistical data for the resumed database reorganization are appended to the retrieved raw statistical data. When a unit of reorganization has committed or the resumed database reorganization has terminated, a statistics record including the retrieved raw statistical data and the further raw statistical data associated with another timestamp is created, and the statistics record is appended to the statistics file.

Abstract: Systems and methods are described for automating the creation of data marts within an enterprise. Data is maintained in a plurality of data sources that include at least a relational database and a multidimensional database. The system includes a business intelligence server that provides a virtual logical semantic model to integrate all of the plurality of data sources. The user specifies a list of levels and measures on the virtual logical semantic model. The list of levels and measures can span data from multiple data sources. The user can also specify a location in the plurality of data sources that will store the aggregate matrix. Once the list of levels and measures are specified, the business intelligence server generates a multidimensional cube to store the data for the aggregate matrix and stores the multidimensional cube in the data source location.

Abstract: The present invention relates to a distributed data storage system comprising a plurality of storage nodes. Using unicast and multicast transmission, a server application may read and write data in the storage system. Each storage node may monitor reading and writing operations on the system as well as the status of other storage nodes. In this way, the storage nodes may detect a need for replication of files on the system, and may carry out a replication process that serves to maintain a storage of a sufficient number of copies of files with correct versions at geographically diverse locations.

Abstract: An information processing system retains one or more files utilized by an external apparatus, each of which is made up of a plurality of chunks, in a manner that the chunks making up each of the files are distributed. The information processing system includes a plurality of chunk servers, each storing chunks, and one master server communicatively coupled thereto. The master server retains a file name of a file, chunk IDs indicating chunks making up the file, and chunk IDs indicating chunk servers storing the chunks. When a snapshot taking request for a file is received, the master server identifies chunks included in the file from the file name and the chunk IDs to instruct the chunk servers having these chunks to take a differential snapshot of each of the chunks with the use of a differential snapshot function included in a local file system of each of the chunk servers.

Abstract: Persistent memory in an integrated circuit cars (ICC) must be managed in such a way that removal of power from the device at any moment does not leave the data stored in this memory in a faulty or inconsistent state. The mechanisms of this disclosure accomplish this end using the tag-length-value data structures found extensively in ICC software and standards.

Abstract: A data transfer application implemented in a computational device receives a request to copy a plurality of storage volumes that form a consistency group. A determination is made that a first storage volume of the plurality of storage volumes is more likely to be written into than a second storage volume of the plurality of storage volumes, in response to receiving the request to copy the plurality of storage volumes. The first storage volume is copied before copying the second storage volume, in response to determining that the first storage volume is more likely to be written into than the second storage volume.

Abstract: A system and method provide for backing up and restoring using patch level data for operating system and application files. Patch level data for the files in the backup image may be displayed along with current patch level data. Further, files in a backup image may be replaced based on current patch level data indicating a patched version of the file in the backup image is available. Further, upon a restore, if a patched file is available for a corresponding file in a backup image, the patched file may be retrieved from a patch source and used in place of the file that would have been restored from the backup image.

Abstract: A backup and restoration process which first attempts to recover information blocks from locally connected information handling systems executing a backup/restore service before looking to the slower access cloud store to recover data blocks.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for validating queries. These mechanisms and methods for validating queries can enable embodiments to provide more reliable and faster execution of queries both in development and in production. In an embodiment and by way of example, a method for validating queries is provided. The method embodiment includes capturing a query that is directed to a multi-tenant database. A plan is determined by which the query will be applied to the database. The plan is statically analyzed for performance. Then a performance measure is applied to the query.

Abstract: A system and method for data compression using compression hardware is disclosed. In accordance with the method, a data set in a data stream is received. The data set includes a set of data descriptor fields. The data set is portioned into one or more data subsets using the set of data descriptor fields. One or more tabular slices and an index are generated for at least one of the data subsets using the set of data descriptor fields. The one or more tabular slices are identified by the index. The one or more tabular slices are compressed into a compressed data block by a data compression scheme using a hardware compressor. A compression data file is generated in a database. The compression data file has a header that stores information about the data compression scheme. The compressed data block is stored in the compression data file.

Abstract: An index to be backed up in a multitenant environment is identified. The multitenant environment includes data for multiple client entities, each identified by a tenant identifier (ID) having one of one or more users associated with the tenant ID. Users of each of multiple client identities can only access data identified by a tenant ID associated with the respective client entity. The multitenant environment is a hosted database provided by an entity separate from the client entities, and provides on-demand database service to the client entities. A staged copy of the index to be backed up is created. The staged copy of the index is segmented. The segments are uploaded to a pre-selected location.

Abstract: A database management system having a database component, which includes a lock manager, and a filesystem component. The filesystem component is configured to: generate a mapping between one or more filesystem access modes, one or more filesystem sharing modes and one or more database locks, receive a request from a filesystem stack to perform one or more actions on data in a database, identify a filesystem access mode and a filesystem share mode of the request, determine which one of the database locks corresponds to the filesystem access mode and the filesystem share mode of the request based on the mapping, and receive a notification lock on the data from the lock manager when no other database locks conflict with the notification lock, wherein the notification lock corresponds to the one of the database locks.

Abstract: Load balancing in a parallel database system is performed using multi-reordering, in which a sequence of multiple processors (two, three, or more) that have small average load (for example, the smallest of any such sequence) is selected to participate in load balancing. In the case of three adjacent low-load processors, the load of all three is evenly distributed over two of them, and the remaining processor becomes a free processor. The free processor is moved adjacent to a high-load processor, the load of which is then shared with the free processor. Data is moved in a “transaction” so that the view of data is always consistent. The database continues to service requests from a former location while data undergoes a transfer.

Abstract: Method for establishing, by means of a computer, a data sequence for generating a trip, the said method comprising the use of a first set of N data, each data item (POIi; 1?i?N) identifying a point of interest that may form part of trips, with each data item (POIi) of the said first set of data there being associated a first identifier (Lp; 1?p?P; P?N) identifying a geographical location where the point of interest identified by the data item (POIi) is situated, these data being structured in a database by means of the first identifier, the said database indicating, between on each occasion a first pair ((Lr,Lj); 1?r?P; 1?j?P) of geographical locations, a distance (?drj) and a time (?trj) for going from the geographical location Lr to the geographical location Lj.

Abstract: Information is retrieved by receiving a list of one or more files to be restored; and obtaining a contiguous group of blocks that includes a first segment of one or more blocks associated with the one or more files to be restored, a gap of one or more blocks that are not associated with the one or more files to be restored that is adjacent to the first segment, and a second segment of one or more blocks associated with the one or more files to be restored that is adjacent to the gap.

Abstract: A method for maintaining data integrity of a storage device is provided. A request is received to create an access monitoring session for a data range on a volume of the storage device. A session identification (ID) is determined for the access monitoring session for data range on the volume. An entry is created in an access monitoring session table for the session ID, and the entry adds the access monitoring session with session ID for the data range on the volume to the access monitoring session table. Request parameters are included in the request to create the access monitoring session. The request parameters denote access to the data range on the volume for the session ID and are stored in the access monitoring session table. Access is controlled to the data range on the volume for the session ID based on request parameters stored in the access monitoring session table.

Abstract: Described is optimistic locking in a distributed file system replication environment, in which a replica machine (e.g., a replicated file server) sends an optimistic lock to other replica machines when a file is opened for write access. Other replica machines that receive the optimistic lock prevent read-write opening of the file until the file is unlocked, thereby preventing many conflicts. Acknowledgements are not required by the locking replica. Of the reduced number of conflicts, many of those conflicts may be detected and thus handled before the file is closed, while conflicts detected after close may be handled via conventional conflict resolution techniques, e.g., last-writer wins.

Abstract: An information processing system for recording operational information in a log includes a log generating unit configured to generate the log in such a manner that a conversion target character string included in the log is recognizable; a log converting unit configured to convert the conversion target character string to an irrecoverable and unique character string; a log outputting unit configured to output the log including the converted character string; and a log collecting unit configured to collect the output log.

Abstract: Various embodiments described and illustrated herein include at least one of systems, methods, and software to identify and resolve violations of system and process performance measuring metrics. Following identification of such a violation, some embodiments may identify and cause a solution to be implemented. Following implementation of a solution, the violated metrics are again applied and the results evaluated to verify resolution of the metric violation. Some embodiments may repeat this process until the metric violation or violations are resolved.

Abstract: A non-transitory, computer-readable recording medium stores therein a verification support program that causes a computer to execute identifying from a finite state machine model related to a circuit-under-test, an input count of transitions to a transition-end state and an output count of transitions from the transition-end state; determining the transition-end state to be a record/restore subject, if the identified output transition>the identified input transition count; embedding record-instruction information causing the record/restore subject to be recorded to a database, if a first element causing transition to the record/restore subject is included in a first test scenario that is in a test scenario group related to the circuit-under-test; and embedding restore-instruction information causing the record-restore subject to be restored from the database, if a second element causing transition to the record-restore subject is included in a series of elements making up a second test scenario that is in

Abstract: A method and system for provisioning data that has been collected and stored in a source database. The source database is a database that consumes a large amount of power and drains the company's database resources. The method and system determine which data should be provisioned and sent to a target server, the target server being more energy efficient than the source database and less exhausting of company resources. Various factors, such as the amount of data being requested and the frequency of change of the requested data, determine whether a transfer of data from the source database to the more energy efficient target database should be performed.