Abstract: The current document is directed a resource-exchange system that facilitates resource exchange and sharing among computing facilities. The currently disclosed methods and systems employ efficient, distributed-search-based auction methods and subsystems within distributed computer systems that include large numbers of geographically distributed data centers to locate resource-provider computing facilities that match the resource needs of resource-consumer computing facilities. In one implementation, resource-provider computing facilities automatically generate hosting fees for hosting computational-resources-consuming entities on behalf of resource-consumer computing facilities that are included in bid-response messages returned by the resource-provider computing facilities in response to receiving bid-request messages. In another implementation, a cloud-exchange system automatically generates hosting fees on behalf of resource-provider computing facilities.

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: In some implementations, a computing device may create a semantic mapping that includes identified features that appear in a particular percentage of assets in a subset of assets of a media library. Also, the computing device may analyze assets of the media library using the semantic mapping to generate semantic scores, which may be used to determine a first tier of assets from the media library that rate highest for semantic score out of all assets. The computing device may present at least one of the first tier assets prominently in a user interface when viewing assets of the media library.

Abstract: A method, computer system, and a computer program product for data optimization is provided. The present invention may include performing a reading at a determined frequency, wherein the reading at the determined frequency is within a bracket parameter. The present invention may include determining a bracket value based on the bracket parameter. The present invention may include posting the bracket value to a subledger.

Abstract: A system 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. The data sets may be included in one or more data streams. The system 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. One of the data sets may be duplicated and provided to multiple computer systems.

Abstract: In accordance with an embodiment, described herein is a system and method for implementing a distributed ledger a blockchain cloud service. The blockchain cloud service can include nodes of the distributed ledger and a management console component. The management console component can include a web application running in a script runtime environment, a plurality of backend of APIs for communicating with various nodes of the blockchain cloud service, and a plurality of client APIs configured to be invoked by a client application. The plurality of client APIs uses one or more of the plurality of backend APIs in provisioning the distributed ledger as a blockchain cloud service, and in managing the managing the blockchain cloud service.

Abstract: A system for propagating an identity state change set about shared identities may include a plurality of systems of record (SORs), and a management server cooperating with the plurality of SORs and configured to: detect discrete Create-Retrieve-Update-Delete (CRUD) operations on a given SOR related to at least one shared identity to generate an identity state change set corresponding to a current state of the at least one shared identity; transact the identity state change set, with associated metadata, to a distributed immutable long-term storage as a current transaction; propagate the identity state change set and associated metadata to replicate a current state of the at least one shared identity as of the current transaction to at least one domain cache instance, and; synchronize the current state of the at least one shared identity across the plurality of SORs from the at least one domain cache instance.

Abstract: Embodiments of a system and method for generating a classification model with a cost function having different penalties for false positives and false negatives are described. Embodiments may include perform machine learning operations on known duplicates and known non-duplicates to generate a classification model for classifying structured data items as duplicates or non-duplicates. Each duplicate may represent a pair of structured data items describing a common item; each non-duplicate may represent a pair of structured data items describing different items. Generation of the classification model may be performed based on a cost function that penalizes false positive misclassifications within the classification model differently than false negative misclassifications. Embodiments may also include evaluating the classification model to determine whether a candidate structured data item is a duplicate or non-duplicate.

Abstract: A method for decreasing a number of individual entries in a database of user-created records which describe a single item by: receiving a plurality of user-created records, each of said records comprising at least a descriptive string; placing individual ones of the plurality of user-created records having a sufficiently similar descriptive string into one of a plurality of first groups; hashing the descriptive string of each of the plurality of first groups in order to place two or more groups into a single bin; performing a pair-wise comparison of the descriptive strings of the two or more groups in each bin; and when the comparison of the descriptive strings of the two or more groups in a bin results in a distance below a first threshold, merging the two or more groups into a combined group.

Abstract: The present disclosure provides systems and methods for modifying and controlling access to private data objects. A system can maintain a node graph comprising nodes that each maintains an association with one or more neighbor nodes. The system can maintain private data objects that are generated based on a request from an organizer node, and include a list of authorized nodes and a setting to enable neighbors of authorized nodes to request inclusion in the list of authorized nodes. The system can receive a request for private data objects from a first node, and identify private data objects that include one or more neighbor nodes of the first node. The system can present a list of private data objects to the first node, and add the first node to the list of authorized nodes of the private data object subsequent to receiving a request from the first node.

Abstract: A system includes reception of a first fragment of a first result set of a first one of a plurality of queries, storage of the first fragment of the first result set in a first local buffer associated with the first one of the plurality of queries, reception of a first fragment of a second result set of a second one of a plurality of queries, storage the first fragment of the second result set in a second local buffer associated with the second one of the plurality of queries, determination to flush the first local buffer, and, in response to the determination, transmit all fragments currently stored in the first local buffer to a client from which the plurality of queries was received with an identifier of the first one of the plurality of queries, before receiving all fragments of the first result set.

Abstract: The present disclosure is directed to a discovery process that enables discovery of database management systems (DBMSs) hosted by at least one client device of a client network. The disclosed discovery process involves a discovery server disposed on the client network accessing the client device hosting the DBMS to collect configuration item (CI) data on the configuration and operation of management, extraction, and replication processes of the DBMS. More specifically, this discovery process involves the discovery server requesting and receiving certain CI data from the management process of the DBMS, requesting and receiving certain CI data from an operating system (OS) of the client devices, as well as parsing and retrieving certain CI data from configuration and report files of the DBMS. Additionally, the disclosed discovery process is designed to be performed without being granted special or additional privileges within the DBMS itself.

Abstract: Multidimensional databases are well-suited for viewing data at different levels of detail. Graph databases are well-suited for modeling data sets with complex relationships. A novel platform for analysis and planning is enabled by linking multidimensional and graph databases. Graphs are data structures stored in graph databases. Graphs use nodes and edges to model data elements, some of which are derived. A graph is traversed to derive new data elements. To perform analysis on the graph data elements, graph traversal paths are stored as tuples in a fact table. This fact table is in turn loaded into the multidimensional database by mapping the fact table's attribute columns to dimensions of the multidimensional database.

Abstract: Disclosed embodiments are related to Master Data Management (MDM) technologies. Each DB entity (record) in component databases (DB) is represented as a judgment, and an MDM system unifies judgments obtained from the component DBs into a unified set of judgments. In the unified set of judgments, linkages are judgments asserting that particular DB entities from different DBs are the same/similar, and a golden record comprises field values describing each of the DB entities. In making judgments, the MDM system consolidates judgments (or records) describing the same subject into a single judgment, and performs updates to field values in a manner that does not violate referential integrity. Each update is associated with an MDM consistent state. Updates in the form of judgments are provided to the relevant component DBs, which are converted into serializable transactions associated with respective MDM consistent states. Other embodiments may be described and/or claimed.

Abstract: A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an approach that enables a database server to detect database changes that alter the result of a query registered for a client and to notify a client of those changes. The notifications may be sent to, for example, a cache manager responsible for maintaining coherency of a result set cache generated by the query. The notification notifies the cache manager of when and/or what changes are needed to maintain the coherency of the cache.

Abstract: A method of invoking in a terminal at least one application service by a browser. The method includes: detecting at least one invocation data item in a first loaded page loaded in the browser, the data item complying at least with one invocation data type registered for the at least one service; and invoking, in the first loaded page, the at least one service from the at least one detected invocation item.

Abstract: Partitioning of temporal databases can implement distributed storage of temporal data via time-based or space-based techniques to improve performance of operators on the database. A variety of operators can be supported for the partitioned tables, including temporal aggregation, time travel, and temporal join. The use of checkpoints can greatly increase performance in a variety of scenarios. The described partitioning techniques can be applied in a parallel execution context to great benefit. The partitioning can also reduce local memory footprint, facilitating in-memory database processing.

Abstract: The current document is directed a resource-exchange system that facilitates resource exchange and sharing among computing facilities. The currently disclosed methods and systems employ efficient, distributed-search-based auction methods and subsystems within distributed computer systems that include large numbers of geographically distributed data centers to locate resource-provider computing facilities that match the resource needs of resource-consumer computing facilities. Multiple security methods and subsystems are employed to prevent unauthorized access to resource-exchange-system services, to secure resource-exchange-system-participant data from unauthorized access, and to prevent hosted virtual machines and other hosted computational entities from interfering with operation of native virtual machines and other native computational entities within hosting resource-provider computing facilities.

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.