Abstract: Systems and methods are described herein that address the shortcomings in conventional systems via a novel technique for utilizing a social interactions and knowledge about social connections to facilitate the exchange of information from a source of the information to a consumer of the information. For example, a consumer of information may be any individual or entity seeking information. A provider of information may be any entity or individual that may provide the information sought by the consumer. As provided herein, the systems identify providers that may most efficiently provide accurate information to the consumer without requiring the consumer to waste time reviewing irrelevant information.

Abstract: A method includes encoding data in accordance with a width parameter to produce a first set of data slices. Storage of the first set of data slices is maintained in a set of storage units of a storage pool. An expanded set of storage units of the storage pool is determined based on an additional subset of storage units added to the storage pool. Storage of the first set of data slices is maintained in the set of storage units after addition of the additional subset of storage units added to the storage pool. An updated width parameter is determined by increasing the width parameter based on the expanded set of storage units. The data is encoded in accordance with the updated width parameter to produce a second set of data slices. Storage of the second set of data slices is maintained in the expanded set of storage units.

Abstract: A method for validating a query result for a query of a database uses an index of the database. A selection of a set of source data from the database is received and a first hash operation is performed on the source data in the database resulting in a database hash value for the source data. A second hash operation is performed on the source data in the index resulting in an index hash value. The index hash value is compared with the database hash value, and a guarantee indication is provided for the source data in the index.

Abstract: Described herein are systems and methods for transaction identification (ID) generation in transaction-based environments. The systems and methods provided generated transaction IDs which inherently define a range of values (a range of blockchain heights) within which the transaction is valid. This obviates problems associated with traditional transaction ID databases where a transaction ID only comprises a hashed value. That is, the presently disclosed systems and methods are an improvement over traditional hashing schemes as in traditional hashing schemes, a server must traverse an entire transaction ID database to determine if an incoming transaction is valid.

Abstract: An apparatus comprises a first processing node configured to participate in a consensus protocol with a plurality of additional processing nodes. The first processing node is further configured in conjunction with its participation in the consensus protocol to implement repeated polling of respective selected subsets of the additional processing nodes, to resolve a state for a given transaction to a particular one of a plurality of possible states for the given transaction responsive to results of the repeated polling; and to initiate at least one automated action based at least in part on the resolved state for the given transaction. In some embodiments, the first processing node utilizes the results of the repeated polling to maintain a directed acyclic graph or other data structure of transactions that characterizes relationships between the given transaction and a plurality of other transactions.

Abstract: Systems and methods are provided for optimizing data storage and improving the speed of data retrieval in a data store, such as a storage server connected to a large network through the use of bucketing techniques to create efficient data structures for storing received key-value datasets at one or more storage servers. Fast key-value read requests and key-value retrievals may be accomplished through the use of multiphase lookup operations on the one or more storage servers. The system is optimized for best performance of retrieval through the separation of the write and read mechanisms. Systems and methods provided herein control the level of wastefulness on the back end of a system and reduce read operation inefficiencies on the front end of a system.

Abstract: A size associated with a first content file is determined to be less than a threshold size. In response to determining that the size associated with the first content file is less than the threshold size, a combined metadata structure is updated at least in part by combining metadata of the first content file with metadata of a second content file in the combined metadata structure. A snapshot tree is updated to reference a first portion of the combined metadata structure corresponding to the first content file and to reference a second portion of the combined metadata structure corresponding to the second content file.

Abstract: A method for reducing a storage of duplicated documents is provided. Methods may include hashing each document stored in the centralized data repository by executing a hashing algorithm on the document, outputting a hash-value and adding the hash-value and a hash pointer to a hash table. Methods may further include crawling the hash table to identify duplicate hash-values. For each hash-value recorded on the hash table two or more times, methods may include combining two or more duplicate hash-values into a cluster and for each cluster identifying, on the hash table, a unique hash-value. For the unique hash-value, methods may include maintaining the unique hash-value on the hash table and maintaining the document corresponding to the unique hash-value in the memory address. For each remaining duplicate hash-value stored in the cluster, deleting the corresponding document from the memory address and store the reference pointer at the memory address.

Abstract: The subject invention functions to use available data and information to automatically create narrative stories that describes domain events, circumstances and/or entities in a comprehensible and compelling and audience customized, manner. Computer executable instructions provide for generating a narrative story using standard and uniform structures and data for receiving domain related data and a story specification, parsing the story specification to provide constituent components, transforming the constituent components into executable code, instantiating content blocks having at least one feature for the domain according to the story specification and rendering the narrative story using the constituent components specified by the content blocks.

Abstract: A technique for sharing an application between devices is discussed. Embodiments of the present invention transmit information about an application from a source computing device to a target computing device. An application sharing service on the target computing device then automatically searches the target computing device for a resident corresponding application or its equivalent and if a corresponding application is not found, searches an application store or repository for the corresponding application. If the application or its equivalent is found in the application store or repository, a user may be prompted to download the application or the application may be downloaded automatically. If the corresponding application was found on the target computing device originally, a check may be performed to determine if the most recent update is installed and, if the most recent version is not installed, it may be downloaded from the application store.

Abstract: Methods and apparatus are provided for processing a transaction that has been aborted on a source system. Transactions are completed within a transaction processing system, and the transactions are replicated from a source database to a target database by a replication engine. Each transaction is a series of one or more transaction steps or operations. The aborted transaction on the source system was replicated and is a pre-committed transaction on the target database. Transaction pattern data in a transaction pattern table is used to predict when a pre-committed transaction is an erroneously committed transaction. The pre-committed transaction is reversed on the target database when the prediction indicates that the pre-committed transaction was erroneously committed.

Abstract: In various examples there is an information retrieval system which has a memory storing an index of items, each item having one or more features of a plurality of features. The index includes, for each item, an indication of the features of that item; and is configured at least according to the features. The memory stores a plurality of questions about the features of the items. The information retrieval system has a question selector that selects at least one of the questions on the basis of at least an expected information gain of the question with respect to the items. A search component searches the index using answers to the selected questions received from a user.

Abstract: Methods and apparatus are provided to fully process an incomplete transaction which is incomplete in either a source database or a target database. Transactions are completed within a transaction processing system that includes a non-static application. The non-static application has a transaction mix that varies over its life cycle. The transactions are replicated from the source database to the target database by a replication engine. Each transaction is a series of one or more transaction steps or operations. A plurality of transaction pattern tables are provided, and one of the transaction pattern tables are selected for use in the process depending upon a time of day or a transaction mix.

Abstract: Techniques of deferred container deployment are disclosed herein. In one embodiment, a method includes receiving, at a computing device, a container image corresponding to the container. The container image includes a first set of files identified by symbolic links individually directed to a file in the host filesystem on the computing device and a second set of files identified by hard links. The method also includes in response to receiving the container image, at the computing device, storing the received container image in a folder of the host filesystem on the computing device without resolving the symbolic links of the first set of the files until runtime of the requested container.

Abstract: System and method for supporting configurable legacy P_Key table abstraction using a bitmap based hardware implementation in a high performance computing environment. A mapping table in DRAM can be provided through the use of a software based SMA that implements the mapping table. With this mapping table, it is possible to provide a legacy compliant view of a bit map based P_Key table. Such a legacy compliant view can be called a virtual P_Key table, or a configurable legacy P_Key table abstraction.

Abstract: Embodiments of the present disclosure relate to an approach for database query. According to the approach, a query for a group of data records is received. At least one index is created on at least one field of the data records and comprises index entries for storing and sorting respective values of the at least one field of the data records. It is determined if the query satisfies a predetermined condition. In response to the query satisfying the predetermined condition, a result of the query is determined by skipping at least a part of operations required by the query based on the at least one index.

Abstract: A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables.

Abstract: A computing device includes an interface configured to communicate with a second computing device, a memory configured to store a first copy of a file that is synchronized with a second copy of the file stored at the second computing device, and a processor. The processor is configured, in response to receiving an update to the file while the interface is unable to communicate with the second computing device, to access versioning management data indicating synchronization settings associated with each of a plurality of files that includes the file. The processor is configured to, conditioned on determining that the versioning management data indicates a first synchronization setting associated with the file, write the update to the first copy, and conditioned on determining that the versioning management data indicates a second synchronization setting associated with the file, refrain from writing the update to the first copy.

Abstract: Computer-readable media, methods, and systems for comparing and migrating multiple online user accounts from multiple online platforms while reducing the probability of false mergers. At least one first online platform comprising a plurality of online accounts associated with the first online platform may be compared with at least one second online platform comprising a plurality of online accounts associated with the second online platform. The comparison further includes comparing the one or more fields of personally identifiable information associated with the first user and the one or more fields of personally identifiable information associated with the second user while excluding known improbable values. Following the comparison between the online accounts, a migration outcome may be determined for creating a new online account, migrating online accounts across online platforms, or consolidating online accounts.

Abstract: A method of generating congruous metadata is provided. The method includes receiving a similarity measure between at least two multimedia objects. Each multimedia object has associated metadata. If the at least two multimedia objects are similar based on the similarity measure and a similarity threshold, the associated metadata of each of the multimedia objects are compared. Then, based on the comparison of the associated metadata of each of the at least two multimedia objects, the method further includes generating congruous metadata. Metadata may be tags, for example.