Abstract: The present invention relates to processing of time series data. There is disclosed a method and apparatus for processing time series data, the method comprising: receiving a time series data set, wherein each element of the time series data set contains a timestamp and an original value associated with the timestamp, and times represented by all timestamps constitute a time series having fixed time intervals; converting each original value into a coded value occupying a smaller storage space, according to a predetermined monotone numerical compression coding scheme; dividing the times represented by all timestamps into a plurality of time intervals having a predetermined length; assembling coded values corresponding to all timestamps within each time interval into a data package such that the data package contains coded values arranged in an order of timestamps; and storing in a database record each data package and its associated identification of a time interval.

Abstract: Methods and systems are disclosed that generate life scores for individuals based on various information associated with the individuals. For example, life scores may be based on data associated with several aspects of the individual's life, such as work, family, hobbies, education, etc. The life scores may be generated in realtime and/or periodically and provided to the individual and/or shared with others in various formats.

Abstract: A method is used in managing file system checking in file systems. Metadata of a file system is evaluated upon receiving a request to perform file system checking on the file system. Based on the evaluation, determination is made as to whether file system checking has been performed previously on the file system. Based on the determination, file system checking is performed on the file system.

Abstract: Techniques for predicting data replication performance degradation are described. According to one embodiment, a method starts with receiving periodically data replication characteristics from a source storage and a target storage, the periodically received data replication characteristics being extracted from a replication process of the source storage replicating data to the target storage. The periodically received data replication characteristics are analyzed at a replication management server communicatively coupled with the source storage and the target storage, and a predictive modeling are applied. When the possibility of degradation of replication performance reaches a predetermined threshold, a notification is sent out.

Abstract: An approach is provided in which a mobile device collects serviceability data from applications executing on the mobile device based upon one or more serviceability state changes provided by a server. The mobile device filters the collected serviceability data according to one or more collection filter rules provided by the server and, in turn, sends the filtered serviceability data to the server accordingly.

Abstract: Embodiments include a method and computer program product for encoding data while it is being processed as part of a query is provided. The method includes receiving a query request and determining a set of values associated with data to be encoded for completing the query request. The method also includes encoding those values such that any subsequent processing operations can be performed on the encoded values to complete the requested query. After performing the subsequent processing operations to complete the requested query, each value is decoded back to its original value.

Abstract: The information processing apparatus includes: a search unit configured to search an application, which satisfies a condition; a data share unit configured to output location information; and a computer controlled to function as: a first request control unit that requests with a first condition; a first reception unit that receives first application information, satisfying the first condition; a second request control unit that requests with a second condition; a second reception unit that receives second application information satisfying the second condition; a display control unit that displays options to receive an operation of selecting any one of the application indicated by the first application information and the second application information; and an output unit that designates a selected application corresponding to the selected options and outputs location information.

Abstract: A system and method of de-duplicating data using a graphical user interface application. The graphical user interface application represents a model of the selected data records in a data tree. The graphical user interface application processes a selected target data record and potential duplicates data records. Nodes representing the potential duplicate data records can be added to the target data record. Nodes representing the potential duplicate data records can also be dragged and dropped into a node of the target data record. Nodes from the target data record can also be removed from the target data record. Differences between data associated with multiple nodes can be graphically presented with the graphical user interface application when multiple nodes are selected. Changes made to the data tree in the graphical user interface are applied to data records stored in a database.

Abstract: The present invention relates to a method, system, and computer program product for data backup, the method comprising: performing first chunking on current data by using the same chunking method as that used by original backup data to obtain a current chunk; calculating hash value of the current chunk; and acquiring, from a hash value table of the original backup data, an identifier of a matched chunk whose hash value is the same as the calculated hash value of the current chunk, and incrementing number of continuous matched chunks by one. Since the pertinence between original backup data and current data is maximally utilized, performance of de-duplication method can be efficiently improved.

Abstract: Techniques for providing on-demand validation services for wager-based virtual machines deployed in a cloud based virtual environment. In some implementations, data sources store master deployment sets containing virtual machines. The master deployment sets may be deployed to component servers to provide a gaming related software services to remote client machines. The on-demand service takes snapshots of the virtual machines in the deployment and the virtual machines in the master deployment set. The snapshots are compared to ensure that important files in the master deployment set have not been improperly modified in the deployment. In some implementations, a secure hashing algorithm creates signatures for the snapshots prior to the comparison and the signatures are compared. The validation result may be sent to a remote client that requested the validation.

Abstract: Search results may be provided to a user. A search query may be received from the user. A query feature vector may be formed for the search query. The query feature vector may be compared with news feature vectors associated with documents related to current events. An augmented query feature vector may be formed based on results of the comparison of the query feature vector with the news feature vectors. The augmented query feature vector may be compared with feature vectors related to target documents. Search results that include target documents may be identified based on results of the comparison of the augmented query feature vector with the feature vectors related to the target documents. The user may be made able to perceive at least some of the identified search results.

Abstract: A system, method, and computer program product for evaluating variant configuration using in-memory technology. Embodiments receive configuration data and a selection condition to be solved, bring Boolean selection condition expressions into disjunctive normal form (DNF) in memory, join concrete configuration values with the selection condition, and compare values. Embodiments aggregate the comparison results per AND-group with a minimum function, and aggregate those results per OR-group with a maximum function and output results of the selection condition for a concrete configuration. Embodiments may employ SQL Script statements. Embodiments may use conjunctive normal form (CNF) instead of DNF with corresponding aggregation ordering. Embodiments may extend the pure normal forms to enable calculations, string operations, evaluation of non-fixed-value literals, multi-valued literals, in-lists, and variant tables by translating and integrating them into the pattern of conjunctive and disjunctive aggregations.

Abstract: Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth.

Abstract: A database analyzer includes a data sorting unit sorting a data group acquired from an analysis target database based on data values in a table column and storing it as analysis target data in a storage unit; a data pattern creation processing unit creating a group for each data value based on differences between the data values and storing a data pattern in the storage unit; a data pattern judgment processing unit for judging validity of the data pattern; and a data pattern transformation processing unit for reconstructing the data pattern with respect to constituent elements of each group included in the data pattern by transforming each group in accordance with a specified conversion rule for converting the constituent elements, which are conceptually similar to each other, into the same constituent element, and storing it in the storage unit if a negative result is obtained for the validity judgment.

Abstract: Various technologies described herein pertain to performing a file operation on an inputted file on a computer system. File data retained at a first location in a data store and a first file name retained at a second location in the data store can be provided. The inputted file can include the file data. Moreover, the first file name is a hard link to the file data. Further, a file operation command related to the file data can be received during installation or removal of the inputted file. Accordingly, a second file name retained at a third location in the data store can be created in response to the file operation command. The second file name is created while the file data is immutably maintained at the first location in the data store. Further, the second file name is a hard link to the file data.

Abstract: A system and method for evaluating claims is disclosed. The system comprises a selection module, a query module, a communication module and a determination module. The selection module determines a review set including one or more claims based at least in part on claim data. The query module determines, based at least in part on the review set, an evaluation form including one or more queries associated with a first claim. The communication module receives answer data describing one or more answers responsive to the one or more queries included in the evaluation form. The determination module determines a validity decision associated with the first claim based at least in part on the answer data.

Abstract: Techniques for migrating data in a database include identifying an update to one or more data entries of a source table; determining that a status of a trigger associated with the source table indicates to update a logging table, and in response: updating, in a first transaction, (i) the one or more data entries of the source table, and (ii) one or more data entries of the logging table based on the user input, and copying content of the source table to a target table; and determining that the status indicates to update the target table, and in response: updating, in a second transaction, (i) the one or more data entries of the source table and (ii) one or more data entries of the target table based on the user input, and updating the content of the target table based on the one or more data entries of the logging table.

Abstract: Checksum values are generated and used to verify the data integrity. A client executing in a parallel computing system stores a data chunk to a shared data object on a storage node in the parallel computing system. The client determines a checksum value for the data chunk; and provides the checksum value with the data chunk to the storage node that stores the shared object. The data chunk can be stored on the storage node with the corresponding checksum value as part of the shared object. The storage node may be part of a Parallel Log-Structured File System (PLFS), and the client may comprise, for example, a Log-Structured File System client on a compute node or burst buffer. The checksum value can be evaluated when the data chunk is read from the storage node to verify the integrity of the data that is read.

Abstract: A data classification module is configured to retrieve information from the repository and migrate the information into applications. The data classification module is configured to receive a request to migrate information and data from the repository into an application. The request can include the type of application and the type of information and data requested. The application can be an new application or an existing application. In order to locate information and data to migrate, the data classification module is configured to maintain rules that describe how the various applications maintain data and information.

Abstract: A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.