Abstract: An example operation may include one or more of receiving a storage request which comprises respective data sets generated by a plurality of endorser peers via simulation of a blockchain request, detecting that a key value of a data set generated by a first endorser peer is different than a respective key value of a data set generated by a second endorser peer, and committing the storage request to a data block of a blockchain in response to verifying that the detected different key values generated by the first and second endorser peers correspond to a multi-value key of the blockchain request.

Abstract: A computer implemented system and method for automated estimation of relationships among a plurality of data elements. The approach includes processing elements of one or more data sets to establish linkage relations among the data records, and then extending the linkage relations based on one or more equivalence relations, stored as linkage data structures. The generated data structures are used for computationally simplifying the data sets by consolidating data records or removing redundancies, such as duplicates, and may be used to yield a compressed data representation or data structure.

Abstract: Aspects of the present disclosure involve a system comprising a computer-readable storage medium storing a program and method for presenting past interactions. The program and method include generating a group profile for a plurality of users that includes a plurality of media items previously exchanged between the plurality of users and saved by at least one of the plurality of users; computing a prior time period as a function of a current date and a specified time interval; searching the plurality of media items to identify a collection of media items that were exchanged between the plurality of users during the prior time period; and generating for display in a graphical user interface a subset of the identified collection of media items.

Abstract: Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.

Abstract: Disclosed is an approach for allowing an entity to perform semantic analysis in a SaaS semantic analysis platform upon private data possessed by one or more entities. In one or more embodiments, separate processing pipelines may be provided to the plurality of entities thereby keeping private data secure within the semantic analysis platform. In one or more embodiments, a common processing pipeline is provide with data associated a first entity being assigned a first identification code, and data associated with a second entity being assigned a second identification code.

Abstract: A method for storing progress data while replicating a snapshot is disclosed. The operations comprise: determining blocks in a storage object that are different between a first and a second snapshots, wherein the first snapshot corresponds to a first tree structure, and the second snapshot corresponds to a second tree structure; and replicating the second snapshot to a remote storage system, comprising replicating all the blocks in the storage object determined to be different between the first and the second snapshots, wherein the replicating further comprises: upon completion of replication of each data slice, determining nodes in the first tree structure that reference only already-replicated blocks; orphaning all such nodes in the first tree structure; and subsequently, updating the first tree structure, comprising merging the first tree structure and the second tree structure, wherein the first tree structure is updated upon completion of replication of each data slice.

Abstract: A computer-implemented method for creating a web programming interface (API) description may include parsing an API usage dataset with a processor to identify a plurality of nodes in each of a plurality of uniform resource locators (URLs), and tagging path parameters for the plurality of nodes. Tagging the path parameters may include identifying, with the processor, which nodes are static parts of the URLs, and identifying, with the processor, which of the nodes are path parameters for the URLs. The method may further include aggregating, with the processor, a plurality of node types based on the tagged path parameters and the static parts of the URLs, and outputting, via the processor, an API description based on the aggregated plurality of node types.

Abstract: The embodiments described herein include one embodiment that provides a control method that includes connecting a first controller to a control system; receiving control system configuration data from a database, in which the configuration data comprises holistic state data of a second controller in the control system; and configuring operation of the first controller based at least in part on the configuration data received.

Abstract: A computer-implemented method for creating a web programming interface (API) description may include parsing an API usage dataset with a processor to identify a plurality of nodes in each of a plurality of uniform resource locators (URLs), and tagging path parameters for the plurality of nodes. Tagging the path parameters may include identifying, with the processor, which nodes are static parts of the URLs, and identifying, with the processor, which of the nodes are path parameters for the URLs. The method may further include aggregating, with the processor, a plurality of node types based on the tagged path parameters and the static parts of the URLs, and outputting, via the processor, an API description based on the aggregated plurality of node types.

Abstract: Disclosed are a method and system for propagating data changes in a hierarchy of dataset models in which each dataset model comprises an analytic and one or more parent datasets, including a primordial dataset. The analytic is executed to instantiate a first instance of the data model. After a change in a primordial dataset, each instance of a dataset model that descends from the primordial dataset is invalidated, and the analytic is re-executed to create a second instance of the data model. Analytical results may be displayed. The first dataset model may include a metric in which the definition of the metric comprises metadata of the dataset model. Metric values may be stored in a first cache, re-computed on a new instance of the dataset model, and stored in a second cache.

Abstract: An apparatus of adaptive index structures is provided. Four common data attributes, including time, space, keyword, and value, are used. The present invention is a structure adaptively selecting the most efficient combined index by estimating index performance and selectivity rate. The main concept is to set indexes with high selectivity rates at positions having higher priorities for processing query. The intermediate result of query is minimized and the performance is further improved. The present invention uses multiple indexes, where all possible combined-index orders are considered and the best combined index is selected according to different query adaptabilities. As a result, the structure has a high chance of saving query time at a rate of more than 25 times as compared to a structure with indexes of a single attribute sequence. Furthermore, as compared to the traditional relational database PostGIS, the reaction time is also twice faster.

Abstract: A system and method for ranking query-advertisement combinations is disclosed. Embodiments use an online component to enhance and rank query ad combinations. The query ad combination is then reranked with a trained factorization machine. The subsequent list of ranked query-ad combinations is then output. The output may be to an auction for determine ad-query combinations having the greatest expected revenue.

Abstract: Disclosed are a method and a device for graph data quality verification, which can perform quality verification of the graph data to be processed before importing the graph data to be processed to the target graph database, thereby avoiding generating a target list based on the graph data to be processed with errors. By determining whether there is an outlier in the target list, the abnormal graph data in the graph data to be processed can be detected to ensure the correctness of the graph data to be processed imported into the target graph database. By generating a graph data quality report, it is possible to verify whether the graph data to be processed has errors during the import process.

Abstract: Techniques for implementing content-based post-process data deduplication are provided. In one set of embodiments, a computer system can receive a write request comprising write data to be persisted to a storage system and can sample a portion of the write data. The computer system can further execute one or more analyses on the sampled portion in order to determine whether the write data is a good deduplication candidate that is likely to contain redundancies which can be eliminated via data deduplication. If the one or more analyses indicate that the write data is a good deduplication candidate, the computer system can cause the write data to be persisted to a staging storage component of the storage system. Otherwise, the computer system can cause the write data to be persisted to a primary storage component of the storage system that is separate from the staging storage component.

Abstract: A method for facilitating synchronization of a remote file system (RFS) and a local file system (LFS) includes maintaining a global revision identifier associated with the RFS, where the global revision identifier has a variable state, and responsive to the RFS being modified, updating metadata associated with one or more of the file system objects of the RFS based on a state of the global revision identifier. More particularly, the method includes updating the global revision identifier to a new state in response to the RFS modification and then updating the metadata of the folder(s) associated with the RFS modification. The RFS metadata is partitioned by folder and file to facilitate efficient searching based on a requested namespace view. Another method utilizes prior revision identifiers stored in the LFS to limit the RFS metadata returned to the local cloud during a rescan, by excluding the data set that has not changed, which improves the efficiency of the rescan synchronization.

Abstract: One or more embodiments interpret a configuration graph to efficiently and optimally construct requests and fetch data from a datastore. The values of objects of a requested data type are used to generate additional queries for pre-fetching data from the datastore. Specifically, the values are used to query for and retrieve a corresponding subset of objects of another, related data type. Recursively querying for and retrieving objects of related data types based on already retrieved objects builds a data cache of relevant objects. The cached, relevant objects may be useful in subsequent queries that are likely to follow the initial query.

Abstract: The embodiments described herein include one embodiment that provides a control method that includes connecting a first controller to a control system; receiving control system configuration data from a database, in which the configuration data comprises holistic state data of a second controller in the control system; and configuring operation of the first controller based at least in part on the configuration data received.

Abstract: Disclosed are a device and a method for restoring missing operational data. The method for restoring missing operational data includes determining whether missing data is present in a first event defining operational data or a first resource constituting the operational data, extracting candidate data from a missing table, depending on a form in which the first resource is defined by the first event and a location where the missing data is identified, and processing the candidate data to restore the missing data, based on a predetermined restoration scheme.

Abstract: The system and method described here relate to the effective organization of a media database. The media database can include music and can bring together time, place, genre, and artist with curator and community commentary and recommendations, cultural events and elements, media content, and a facility for procurement of related materials. The consistent focus of these fundamental elements of music and principles of organization provides a unique user experience that is a key aspect of the current invention. The user can interact with the media database using voice commands.

Abstract: In one or more embodiments, one or more systems, methods, and/or processes may receive, from first computer systems, data sets via a first different data encapsulations; obtain the data sets from the first different data encapsulations; produce second different data encapsulations that include the data sets; and provide the second different data encapsulations that include the data sets to second computer systems that subscribed to receive the data sets. In one or more embodiments, the data sets may be included in one or more data streams. In one or more embodiments, the one or more systems, methods, and/or processes may store at least two of the data sets. For example, at least two of the data sets may be stored until they are requested by one or more computer systems. In one or more embodiments, one of the data sets may be duplicated and provided to multiple computer systems.