Abstract: The embodiments described herein relate to a method and system for social awareness which may be based on social networks for knowledge exchange. More specifically, the embodiments may refer to specific social networks with social elements in the user interface based on knowledge exchange, social theory of group memberships within an enterprise or organization context. In addition, the disclosed group memberships may be predicated upon many different types of relationships. Furthermore, the social network (through a program interface) may provide to users the required specific project resources (project team members), which may be need to develop a better project performance according to the experience and knowledge of the new members. The required project team members may match with the attributes and criteria established during the project planning.

Abstract: The present disclosure describes methods, systems, and computer program products for performing JOIN value comparisons. One computer-implemented method includes converting, by operation of a computer system, a first value of a first data type into a second value of a second data type, wherein the first value is a value of a first attribute of a first table; converting, by operation of a computer system, the second value of the second data type into a third value of a third data type; converting, by operation of a computer system, a fourth value of the third data type into a fifth value of the second data type, wherein the fourth value is a value of a second attribute of a second table; converting, by operation of a computer system, the fifth value of the second data type into a sixth value of the first data type; and performing JOIN operations of the first table and the second table in response to determining that the first value equals the sixth value, and the fourth value equals the third value.

Abstract: Methods and apparatus for building a search index for a database are disclosed. When an incremental build trigger is detected (e.g., a threshold number of documents are added to database), the system determines which sub-indexes need to be updated and which sub-indexes do not need to be updated. Rather than update the affected sub-indexes directly, the system builds new sub-indexes to replace the affected sub-indexes. Database queries that occur during the generation of the replacement sub-indexes use the old sub-indexes. When the new sub-indexes are ready, the system moves pointers from the old sub-indexes to the new sub-indexes so that subsequent database queries use the new sub-indexes.

Abstract: A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store does not allow concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A transaction associated with the column-based in-memory database is received. For each table read by the transaction, a version of the table in the delta store that represents a transaction-consistent snapshot of the database visible to the transaction is determined. Each table is represented in the main store and the delta store; and each version of the table is represented by one or more bitmaps.

Abstract: A complete document management system is disclosed. Accordingly, systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are disclosed. Systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are further disclosed. Additionally, systems and methods for accessing documents available through a network, wherein the documents are stored on one or more data storage devices coupled to the network, are disclosed.

Abstract: Machines, systems and methods for optimizing data replication in a distributed storage network, the method comprising determining a need to create a replica for a data item in a remote failure zone in a data storage network; creating a temporary replica of the data item in a local failure zone defined in the data storage network, in response to determining that it is beneficial to create the temporary replica in the local failure zone based on a cost versus reliability improvement analysis; attempting to create the replica in the remote failure zone; and removing the temporary replica from the local failure zone, in response to successfully creating the replica in the remote failure zone.

Abstract: Methods and arrangements for predictively placing columns of a large database in a multi-tier storage system. Aspects include receiving a database to be stored in the multi-tier storage system, wherein the database comprises a plurality of columns and the multi-tier storage system comprises at least two storage devices and evaluating one or more attributes of each of the plurality of columns of the database. Aspects also include storing each of the plurality of columns of the database on one of the at least two storage devices, wherein a determination of which of the at least two storage devices to store each of the plurality of columns is based on the one or more attributes of each of the columns, a predictive model based on the weighted columnar relationship graph, and the characteristics of the storage devices.

Abstract: A method and apparatus for facilitating data set query is disclosed. In the method and apparatus one or more tables may be created for the data set, whereby each table of the one or more tables may enable searching the data set using one or more records that are associated with one or more indices of the data set. Upon receiving a request to search the data set, a table of the one or more table is identified based at least in part on the one or more bases for query and is searched to provide a yielded record.

Abstract: Methods, systems, and computer programs are presented for providing a personalized news stream to a user. One method includes an operation for identifying user features associated with a user. The user features include personal features and social features. The personal features are based on activities of the user and the profile of the user. The social features are based on information about social connections of the user. The method further includes operations for extracting content features from a corpus of content items, for identifying intersections between user features and content features, and for assigning weights to the content features from the corpus based on the identified intersections. A score for each content item is determined based on the content features and the respective weights of the content items. The content items are then ranked based on the scores. One or more of the ranked content items are displayed.

Abstract: Third party data embedding may be provided. Data associated with a third party provider may be saved in a native application save file. If a save file opened by the application is determined to comprise third party data, the application may determine whether an appropriate data provider is available. The application may connect to the data provider and provide on-demand, asynchronous access to the third party data upon request from a user.

Abstract: Save set indexing outside of backup windows is described. A system creates a snapshot of a save set without creating an index of the save set. The system creates the index of the save set in response to creating the snapshot of the save set.

Abstract: A method for data container group management in a deduplication system is provided. The method includes arranging a plurality of data container groups according to a plurality of file systems. A subset of the plurality of data container groups correspond to each of the plurality of file systems, each of the plurality of data container groups having a reference database, a plurality of data containers, and a data container group identifier (ID). The method includes performing a first backup process for a first client-policy pair with deduplication via a first one of the plurality of data container groups and performing a second backup process for a second client-policy pair with deduplication via a second one of the plurality of data container groups.

Abstract: A method for context transfer for data storage is disclosed. The method includes receiving, from an analysis environment, a request to load a data item for analysis, creating, based on the request, a task request including context information of the data item, transmitting the task request to a data manager environment, receiving, from the data manager environment, an approval of the task request based on the context information, and loading the data item in a master data store in response to the approval.

Abstract: The present invention relates to a method for searching in a database containing at least one set of objects each linked to at least one descriptor, the search being done by a search engine from at least one request by a user in order to return at least one result object, said search method being characterized in that the request comprises at least one search parameter comprising a series of at least one search element (10, 11, 12, 13) obtained by freely adding (15) elements to said series by the user, the addition step being able to be repeated multiple times until a search instruction is given.

Abstract: Multiple clients can be enabled to perform operations relative to data items in a shard system asynchronously to each other without the use by those clients of exclusive locks. A rebalancing event, in which data items are redistributed automatically among a set of shards due to a modification of the quantity of shards in the system, can be performed without the use of exclusive locks by clients. Clients can continue to perform operations relative to at least some of the data items in the shard system even while rebalancing processes are redistributing at least some of the data items asynchronously during a system-wide rebalancing event. All of these benefits can be obtained without sacrificing data consistency within the shard system.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: A method to partition a deduplication pool is provided. The method includes determining that an amount of data in a plurality of data containers of the deduplication pool has reached a data capacity threshold and comparing each data container of the plurality of data containers with at least one other of the plurality of data containers as to amount of shared data. The method includes grouping, based on results of the comparing, the plurality of data containers into a plurality of groups of data containers, with data sharing from each of the plurality of groups of data containers to each other of the plurality of groups of data containers less than a data sharing threshold and data sharing inside each of the plurality of groups of data containers greater than the data sharing threshold.

Abstract: A transaction request is received at a log-based transaction manager, indicating a conflict check delimiter and a read set descriptor indicative of one or more locations from which data is read during the requested transaction. Using the conflict check delimiter, a subset of transaction records stored in a particular persistent log to be examined for conflicts prior to committing the requested transaction is identified. In response to determining that none of the read locations of the requested transaction correspond to a write location indicated in the subset of transaction records, a new transaction record is stored in the particular persistent log indicating that the requested transaction has been committed.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: Various embodiments for managing production data are described herein. In one example of a method for managing production data, the method can include allocating, via a processor, a first storage area to store production data for an external computing device. The method can also include receiving a write request comprising production data to be stored in the first storage area. In addition, the method can include detecting that the first storage area does not have available space to store the production data and allocating, via a processor, a second storage area to store the production data. Furthermore, the method can include transferring, via a processor, production data stored in the first storage area to a backup device.