Abstract: A system and method are disclosed for providing continuous file protection in a computer processing system. In accordance with an embodiment, the system includes a configuration module, a filter driver, and a storage module. The configuration module permits a user to elect certain files or folders for protection. The configuration module runs at an application layer without involving the computer processing system's operating system. The filter driver intercepts and splits write input and outputs addressed at protected files or folders. The storage module is also run without involving the computer processing system's operating system. The storage module is for performing functions including data logging, version managements, and data recovery.

Abstract: An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.

Abstract: During garbage collection, writes to objects being copied (relocated) are monitored (tracked) using a write barrier that uses a thread-local write barrier buffer. In the preferred embodiment, soft synchronization is used for reading the thread-local write barrier buffers. In response to detecting a write to an object, the object may be re-copied, the copying may be made to fail, the write may be propagated to another copy of the object, or, e.g., another node in a distributed system may be notified of the write.

Abstract: Certain exemplary embodiments relate to techniques for determining the correct item serial number structure, even when information regarding the serial number data and/or structure is lacking. Such techniques advantageously promote data integrity by helping to ensure that the desired data is captured correctly, while also reducing (and sometimes even eliminating) the need to obtain detailed information regarding serial number structure and intelligence that sometimes is guarded by producers/manufacturers. Statistical sampling of collected unknown data formats may be used to help decipher product identification numbers (or other numbers) such as product serial numbers through a repetitive process of scanning a known constant such as the UPC number, followed by a variable number such as a products serial number. Certain exemplary embodiments check serial number against a database containing algorithms to determine if and which algorithm is used to create such serial numbers.

Abstract: A lock manager system is provided that includes multiple distinct mechanisms for assigning resources to masters. Specifically, the lock manager system includes (1) one or more assignment mechanisms that do not take into account the affinity between nodes and objects (“affinity-independent assignment mechanisms”), and (3) one or more assignment mechanisms that do take into account the affinity between nodes and objects (“affinity-based assignment mechanisms”). At any given time, the assignment of any given resource to a master is governed by only one of the multiple assignment mechanisms employed by the system. Various techniques are described for determining which assignment mechanism to use with which resources.

Abstract: Stubbing systems and methods are provided for intelligent data management in a replication environment, such as by reducing the space occupied by replication data on a destination system. In certain examples, stub files or like objects replace migrated, de-duplicated or otherwise copied data that has been moved from the destination system to secondary storage. Access is further provided to the replication data in a manner that is transparent to the user and/or without substantially impacting the base replication process. In order to distinguish stub files representing migrated replication data from replicated stub files, priority tags or like identifiers can be used. Thus, when accessing a stub file on the destination system, such as to modify replication data or perform a restore process, the tagged stub files can be used to recall archived data prior to performing the requested operation so that an accurate copy of the source data is generated.

Abstract: An approach is provided for content-based investigation services. Event data corresponding to content satisfying a predetermined criterion is received. A plurality of prioritization parameters relating to the content are retrieved. One or more of the prioritization parameters are selected based on the received event data. A prioritization score for the event data is generated using the selected parameters. Inspection of the event data is scheduled according to the prioritization score. A determination is selectively made whether the content is in violation according to the inspection.

Abstract: Architecture for restoring nodes. After restoring a node, fix-up occurs to make the node appears as a different node than before the restore operation. The node appears as a new node, which new node knows the data up to a certain point from when the new node had the prior identity. This allows for new changes generated by the new node to flow to the other nodes in the topology, as well as have the changes that the prior identity sent to other nodes flow back to the new node. In other words, the architecture maintains information to create the new node in the topology while maintaining prior data knowledge. Additionally, item level metadata of associated data items is updated to correlate with the updated data items so that changes can be correctly enumerated and applied. This metadata update occurs across scopes of which the data items are included.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for backing up an in-memory database. In an embodiment, a backup server is provided to perform backup operations of a database on behalf of a database server. A determination is made as to whether the database is an in-memory database. Database server connections are utilized during data accesses for the backup operations when the database is an in-memory database.

Abstract: There are provided mechanisms and methods for maintaining data stored in a data structure. These mechanisms and methods for maintaining data stored in a data structure can provide maintenance operations with improved efficiency, functionality, etc.

Abstract: Stubbing systems and methods are provided for intelligent data management in a replication environment, such as by reducing the space occupied by replication data on a destination system. In certain examples, stub files or like objects replace migrated, de-duplicated or otherwise copied data that has been moved from the destination system to secondary storage. Access is further provided to the replication data in a manner that is transparent to the user and/or without substantially impacting the base replication process. In order to distinguish stub files representing migrated replication data from replicated stub files, priority tags or like identifiers can be used. Thus, when accessing a stub file on the destination system, such as to modify replication data or perform a restore process, the tagged stub files can be used to recall archived data prior to performing the requested operation so that an accurate copy of the source data is generated.

Abstract: The present invention provides a method for information recovery using a snapshot database, comprising the steps of: collecting first user log information for users of one or more user terminals; sorting effective information from the first user log information; storing the sorted effective information into the format of a snapshot database in accordance with period information; receiving recovery request information for the effective information from the user terminals; comparing and analyzing the second user log information and the effective information at the point of time where said recovery request information is received in accordance with said recovery request information; and recovering the second user log information to said effective information in accordance with the result of the analysis.

Abstract: A device may include a memory, line cards, and a processor. The memory may include an address database for storing sub-location addresses. The line cards may be configured to communicate with other devices. The processor may be configured to receive a request to reconcile physical addresses from a network device, retrieve sub-location addresses from the database based on the request, determine whether each of the sub-location addresses can be deleted from the database based on association between the sub-location address and a physical device, and, for each of the sub-location addresses, delete the sub-location address from the database based on the determination.

Abstract: Systems and methods are provided for handling uncorrectable errors in a non-volatile memory (“NVM”), such as flash memory, during a garbage collection operation.

Abstract: Provided is an information processing system including a plurality of nodes 3 and a plurality of storages 4 coupled subordinately to each of the nodes 3, each of the nodes 3 functioning as a virtual file system that provides a client 2 with storage regions of each of the storages 4 as a single namespace. This information processing system is further provided with a backup node 10 and a backup storage 11 coupled subordinately to the backup node 10. The backup node 10 synchronizes and holds location information (file management table 33) held by each of the nodes 3. Then, the backup node 10 creates a backup file, and stores the backup file in the backup storage 11 by accessing a location identified by the location information (file management table 43) synchronized and held by the backup node 10 itself to acquire a file.

Abstract: The invention concerns a method of comparing by a comparator tool a pair of electronic data files each comprising a plurality of data elements, the method comprising: identifying at least one data element in each of said files; replacing the values of said at least one identified data elements in each of said files by a same reference value; comparing the files to detect differences between values of the data elements; and generating an output report indicating said differences.

Abstract: Systems, methods, and computer readable media for managing the configuration of topologically related network devices are described. In general, devices that are “topologically related” are devices that are functionally coupled in some way (e.g., network switches sharing a common trunk line or network routers providing common router services in accordance with an established priority scheme). Specifically, techniques are disclosed for verifying or changing the configuration of a first network device based on the configuration of a second, topologically related, network device. Configuration policies (or rules) are described that are used to “bridge” the configuration of one device with that of another device.

Abstract: A database management apparatus is provided with a setting unit that receives a snapshot request and records information indicating an extraction range to a memory, an extraction unit that sequentially extracts records and records the extracted records to another area, a monitoring unit that records information indicating an extraction-completed area and an extraction-remaining area, an update unit that judges whether a record targeted by an update instruction for update by a subsequent transaction is in the extraction-completed area, updates the update target record in the extraction-completed area if in the extraction-completed area, and records a map of the update target record in the extraction-remaining area to an area outside the extraction range and updates the map if in the extraction-remaining area, and a restore unit that updates the update target record to be the same as the map, after extraction of the update target record is completed.

Abstract: Systems, methods, and other embodiments associated with graph transformation are described. One example method includes transforming a base graph into a folded graph as a function of a folding query.

Abstract: Provided herein is a method and system for the security of the file input and output of application programs. At a security process running step, an application program and an security process are executed independent of a main process of the application program. The security process is connected to a filter driver to control the filter driver. At an event generation step, the filter driver checks an event being processed by the application program, stops the processing of the event, and transfers event information regarding the event to the security process. At a control policy checking step, the security process compares the event information with a corresponding security control policy, and transfers the determination of the comparison to the filter driver. At an execution step, the filter driver continues the following processing of the corresponding event in conformity with the determination of the security process.

Abstract: A first controller has a first CM area having a plurality of first sub-areas, and a second controller has a second CM area having a plurality of second sub-areas. The first controller stores first data in any of the first sub-areas, and in addition, stores a mirror of the first data (first mirror data) in any of the second sub-areas. The first controller manages a pair (an association relationship) of the storage-destination first sub-area of the first data and the storage-destination second sub-area of the first mirror data. Similarly, the second controller stores second data in any of the second sub-areas, and in addition, stores a mirror of the second data (second mirror data) in any of the first sub-areas. The second controller manages a pair (an association relationship) of the storage-destination second sub-area of the second data and the storage-destination first sub-area of the second mirror data.

Abstract: A mechanism for unioning file systems using fall-through directory entries is disclosed. A method of embodiments of the invention includes receiving a request to open a directory of a union file system, processing directory entries of the directory for whiteouts and duplicates, copying the processed directory entries to disk storage, and flagging the copied entries from a lower level file system as fall-through entries.

Abstract: A method for data protection includes accepting data for storage from one or more data sources (24). The data is sent for storage in a primary storage device (28) and in a secondary storage device (32). While awaiting an indication of successful storage of the data in the secondary storage device, a record associated with the data is temporarily stored in a disaster-proof storage unit (48) adjacent to the primary storage device. When an event damaging at least some of the data in the primary storage device occurs, the data is reconstructed using the record stored in the disaster-proof storage unit and at least part of the data stored in the secondary storage device.

Abstract: Architecture that provides the capability to automatically (e.g., dynamically) reorganize (repartition) an existing partition by dividing (splitting) or recombining (merging) logical databases. This reorganization can be performed to logical databases belonging to the same customer, and based on the partitioning of the tables in these databases. This can include not only splitting secondary replicas of a partition or merging secondary replicas of the partition, but also splitting off secondary replicas of the partition to create a new partition and merging two partitions into one partition. Moreover, these operations can occur while the logical databases are accepting workload (online).

Abstract: Embodiments of the invention broadly contemplate systems, methods, apparatuses and program products that employ a policy based method of timely execution of triggers over a data warehouse. Embodiments of the invention utilize methods to convert a trigger condition into differential queries over data sources, to decide when to send queries to data sources, and determine to which data sources to send queries.

Abstract: Provided are a method, system, and computer program product for creating a buffer point-in-time copy relationship for a point-in-time copy function executed to create a point-in-time copy relationship. A point-in-time copy function is initiated to create a new point-in-time copy relationship from a source volume comprising a first volume to a target volume comprising a second volume. Detection is made that the target volume of the new point-in-time copy relationship is a source volume of a first pre-existing point-in-time copy relationship having as a target volume a third volume. Detection is also made that the target volume of the first pre-existing point-in-time copy relationship is a source volume of a second pre-existing point-in-time copy relationship having as a target volume a fourth volume.

Abstract: A method and system of provisioning one or more Network Elements, as well as a method and apparatus for resuming a failed Customer Service Order for provisioning one or more Network Elements, is disclosed. A provisioning logic framework receives a Customer Service Order CSO from a Business Support System, calls respective provisioning logic for performing said Customer Service Order and detects if the received Customer Service Order is a CSO to be resumed. During the performing time of said Customer Service Order, historical processing data is stored. If it is detected that the received Customer Service Order is a CSO to be resumed, the provisioning logic framework builds up a fake environment on the basis of historical processing data stored previously for the CSO to be resumed. Then the successful part of the CSO is directed to the fake environment and the uncompleted part of the CSO is directed to actual Network elements.

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: Methods and systems for creating, reading, and writing compressed data for use with a block mode access storage. The compressed data are packed into a plurality of compressed units and stored in a storage logical unit (LU). One or more corresponding compressed units may be read and/or updated with no need of restoring the entire storage logical unit while maintaining a de-fragmented structure of the LU.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for operating on time sequences of data. In one aspect, a method includes a database management system storing and updating information in records in a table of a database, the records being associated with respective times that are spaced apart by time intervals, the database management system responding to a query that is phrased to imply a putative record with respect to a time interval that is not among the time intervals with which the records of the table are associated, and the response of the database management system to the query including a computation of a value of an attribute of the putative record from at least one non-null value of the attribute for one of the records of the table, the computation being based on an interpolation policy.

Abstract: Various techniques for improving the performance of restoring deduplicated data files from a server to a client within a storage management system are disclosed. In one embodiment, a chunk index is maintained on the client that tracks the chunks remaining on the client for each data file that is stored to and restored from the storage server. When a specific file is selected for restore from the storage server to the client, the client determines if any local copies of this specific file's chunks are stored in files already existing on the client data store. The file is then reconstructed from a combination of these local copies of the file chunks and chunks retrieved from the storage server. Therefore, only chunks that are not stored or are inaccessible to the client are retrieved from the server, reducing server-side processing requirements and the bandwidth required for data restore operations.

Abstract: System and methods manage concurrent ETL processes accessing a database. Exemplary embodiments include a method for concurrency management for ETL processes in a database having database tables and communicatively coupled to a computer, the method including establishing a session lock for the database, determining that a current ETL process is accessing the database at a current time, associating a current expiration time with the session lock, the expiration time being stored in a lock table in the database, sending the session lock to the current ETL process and performing ETL-level locking for the current ETL process.

Abstract: An apparatus and a method operating on data at a server node of a data grid system with distributed cache is described. Data is copied to a network cloud of storage services remotely coupled to a server node with an asynchronous input output interface. The asynchronous input output interface is configured to asynchronously communicate with the network cloud of storage services. Confirmation that the data has been copied on the network cloud of storage services is received at the server node.

Abstract: Portions of a B-tree index in a database are locked for concurrency control. In one example, hierarchical lock modes are provided that permit locking a key, a gap between the key and the next key, and a combination of the key and the gap. In another example, key range locking may be applied to the B-tree index using locks on separator keys of index nodes. In another example, key range locking may be applied to the B-tree index using locks on key prefixes.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for storing file system content in a multi-tenant on-demand database system. These mechanisms and methods for storing file system content in a multi-tenant on-demand database system can enable embodiments to reduce a number of files stored on a file system, avoid copying of all file system content to file system copies, etc.

Abstract: Systems and methods are provided for segmenting time-series data stored in data segments containing one or more data records. A combined segment error measure is determined based on a proposed combination of two candidate segments. An error cost to merge the two candidate segments is determined based on a difference between the combined segment error measure and a segment error measure of one of the segments. The two candidate segments are combined when the error cost to merge meets a merge threshold to generate a combined segment.

Abstract: In a virtual machine, Java Virtual Machine, or other runtime environment, a system and a method for improving the garbage collection times of the virtual machine memory. The JVM, or a garbage collector operating therein, can estimate, for an area of the memory space, the sum of the pause times for garbage collection of the software objects within the area, and control the garbage collection process so that the sum of the pause times for garbage collection will be lower than a target pause time limit, with a high degree of probability. A preselected compaction area can be pre-compacted to keep the compaction time within the target limit. The garbage collector can also predict the time required for final marking and repeat precleaning until the predicted final marking time is within the limits for pause times, and can improve pause times by redirecting application worker threads to do garbage collector work when entering or leaving the memory subsystem.

Abstract: Provided is a computer program product for backing up data, which are stored in a first storage device connected with a computer, into a second storage device connected with the computer. The computer program product includes: a computer-readable medium; and a computer program code stored on the computer-readable medium, wherein the computer program code includes: a program code for generating backup data based on at least part of the data stored in the first storage device; a program code for obtaining, as identification data, at least one of image data and sound data provided by a separate program code that is different from the computer program and is executed during the generation of the backup data; and a program code for correlating the generated backup data to the obtained identification data and storing the backup data correlated to the identification data into the second storage device.

Abstract: According to one embodiment, a semiconductor memory device performs writing of data to a semiconductor memory element in response to a request to write the data with a specified logical block address from a host and performs writing of valid data to the semiconductor memory element for compaction according to a log-structured method. The semiconductor memory device adjusts a frequency of the writing response to a request from the host and a frequency of the writing for compaction according to a predetermined ratio.

Abstract: Embodiments of the present invention provide methods, apparatuses, systems, and computer software products for data storage. A first copy of a logical volume is created. A second copy of the logical volume is created based on the first copy of the logical volume, such that the first and second copies are represented by respective first and second sets of pointers to physical storage locations in which data used by the copies is stored. Responsively to a corruption of at least part of the data that is used by the first copy. The first copy is restored from the second copy by replacing the first set with the pointers in the second set.

Abstract: A system and method for incremental backup storage. The systems and methods include one or more incremental backup servers comprising a current version store configured to store data corresponding to a most recent backup and a historical version store corresponding to a prior backup to said most recent backup. One or more incremental backup clients are configured to communicate with one or more incremental backup servers . The one or more incremental backup clients each comprise a localized data set. The incremental backup server is configured to back up the localized data set of the one or more incremental backup clients.

Abstract: There is provided a first dock for a portable hard disk, where the first dock is connectable to a host device. There is also provided a corresponding method for accessing content on the host device during use of the dock. It is advantageous that the host device is able to access content from portable hard disks that are docked with the first dock and a second dock.

Abstract: A software system automatically and dynamically generates a fully functional user interface (UI) based upon, and connected directly to, an underlying data model (as instantiated within a relational database management system (RDBMS)). The UI derives from an automated interrogation of the RDBMS, and comprises all mode displays (e.g., browse, search, edit, add) for all tables, and a full complement of mechanisms—integrated directly into the mode displays—for representing, navigating, and managing relationships across tables, regardless of the complexity of the underlying RDBMS schema. It utilizes a hierarchical “context stack” for suspending the working state of a particular table while “drilling down” to work with related-table information and return relevant changes to the base table.

Abstract: An archival storage cluster of preferably symmetric nodes includes a metadata management system that organizes and provides access to given metadata, preferably in the form of metadata objects. Each metadata object may have a unique name, and metadata objects are organized into regions. Preferably, a region is selected by hashing one or more object attributes (e.g., the object's name) and extracting a given number of bits of the resulting hash value. The number of bits may be controlled by a configuration parameter. Each region is stored redundantly. A region comprises a set of region copies. In particular, there is one authoritative copy of the region, and zero or more backup copies. The number of backup copies may be controlled by a configuration parameter. Region copies are distributed across the nodes of the cluster so as to balance the number of authoritative region copies per node, as well as the number of total region copies per node.

Abstract: A computer system with read/write access to storage devices creates a snapshot of a data volume at a point in time while continuing to accept access requests to the mirrored data volume by copying before making changes to the base data volume. Multiple snapshots may be made of the same data volume at different points in time. Only data that is not stored in a previous snapshot volume or in the base data volume are stored in the most recent snapshot volume.

Abstract: An operation arrangement work is accelerated by improving efficiency of not only process of generating an operation arrangement proposal but also process of confirming whether the operation arrangement proposal is good or not by a user. An operation support system has an operation arrangement proposal generation part (1110) which executes automatic generation of an operation arrangement proposal, a diagram prediction part which executes simulation of train operation in the future, a diagram display part (1120) which displays an operation schedule and the operation arrangement proposal as a diagram, and a user input part which receives input of a parameter from the user.

Abstract: Architecture that facilitates the restoration of a cluster database in a scalable way using backups (e.g., SQL database backups) and a partition rebuild mechanism to achieve a high level of partition level data consistency, even when restore fails on individual machines and/or machine failure occurs. The architecture restores replicas of the partitions in consideration that the backups may be created at different points and at different times. Optimized parallelism is achieved in restoring each database machine using local backups, which eliminates cross-machine network traffic. Thus, fast recovery of the distributed database can be accomplished on the order of hours over thousands of machines and terabytes of data.

Abstract: One or more techniques and/or systems are disclosed herein for backing up in-memory working store data. A first server in a plurality of connected servers detects a data change for a key-value pair the distributed in-memory working store. The first server determines a backup location for storing a copy of the key-value pair, which is comprised on a backup location server from the plurality of connected servers, by using a key from the key-value pair to identify the backup location server, and determine if the backup location server is available to store the backup copy. The first server sends the backup copy to the backup location server without prior permission from the backup location server and without subsequent feedback from the backup location server concerning the sending of the backup copy.

Abstract: Data is selectively deduplicated such that portions of data suitable for deduplication are passed to a deduplication engine (1064) and stored in a first store (1072).

Abstract: A method and system of recovery point data view shift through a direction-agnostic roll algorithm is disclosed. The method includes forming a data view around a recovery point, and shifting the data view around the recovery point through a direction-agnostic roll algorithm that uses at least one of a roll-forward algorithm to shift the data view to a time after the recovery point and a roll-backward algorithm to shift the data view to a time before the recover point. A data integrity may be determined to be consistent at the recover point by examining data and meta-data associated with the recovery point. The recovery point may be associated with one of an automatically generated event, a user definable event, and/or a prepackaged event. A marker data may be generated at the recovery point to enable the direction-agnostic roll algorithm to reduce a recovery time objective when an algorithm is applied.