Abstract: A mechanism is provided in a data processing system to implement a medical concept searching engine for improving searches of medical concepts based on an index model. The mechanism generates a concept index model data structure that records medical concepts and corresponding numbers of instances of the medical concepts in the corpus of documents. Responsive to receiving a search request from a user, the medical concept searching engine identifies at least one medical concept in the search request and one or more related medical concepts that are related to the at least one medical concept based on an ontology data structure. The medical concept searching engine generates a bubble graph user interface comprising a plurality of bubbles corresponding to the at least one medical concept and the one or more related medical concepts.

Abstract: Placing an event into a particular cluster can allow various inferences about the event. A new payment transaction that looks similar to a previously identified cluster of mostly fraudulent payment transactions, for example, may be higher risk. The present disclosure includes structural data improvements to the way that online clustering of events (which may include web events and not just payment transactions) occurs. A new event can be classified into a particular segment very quickly using feature table searching, which can allow for better decision making when a short timeframe is required (e.g. transaction processing, online advertising, etc.).

Abstract: In some implementations, a computer-implemented method includes receiving a state update command. The method further includes, in response to the state update command, sending a command to perform a state update in a first server of a plurality of servers and queueing incoming requests for access to the plurality of servers. The method further includes receiving confirmation from the first server that the state update was successful. The method further includes, after receiving the confirmation, sending a respective command to the plurality of servers to perform the state update and a scheduled update time associated with the state update. The method further includes receiving a respective state update message from a subset of the plurality of servers that the state update was successful and after receiving the state update message, transmitting the queued incoming requests to the subset of the plurality of servers.

Abstract: A method and system manage synchronization of data streams in a multi-tenant system. The method includes tracking by a flow control mechanism a recent flow rate of at least one data stream, determining by the flow control mechanism whether the flow rate of the at least one data stream varies from at least one related data stream, and adjusting by the flow control mechanism a throughput of the at least one data stream to correlate with the at least one related data stream, in response to determining that the at least one data stream has varied from the at least one related data stream.

Abstract: A non-transitory computer readable medium can store machine readable instructions that when accessed and executed by a processing resource cause a computing device to perform operations. The operations can include establishing a connection between data stores (such as a relational data store and a graph engine), wherein the connection includes a shared memory buffer storing data in a data format according to internal structures of the graph engine. The connection between the data stores is bi-directional. The connection enables data that is stored in the shared memory to be processed by either of the graph engine and the relational database. Upon receiving a query, the graph engine or the relational database can be selected to process the data based on a query. The data can be processed by the selected one of the graph engine or the relational database.

Abstract: A method is provided.

Abstract: Techniques are disclosed to safely and performantly store data in a distributed graph database. In various embodiments, a combination of a replication protocol for data redundancy with a chain-commit protocol is used to ensure a safe ordering of concurrent updates across servers. The resulting protocol allows a distributed graph database to simultaneously uphold ACID properties and a useful degree of scalability through concurrent processing of updates in the typical case, and serialization of updates only where data integrity would otherwise be at risk.

Abstract: The present disclosure relates to a computer implemented method for applying changes into tables of a target database system using a data synchronization system, the data synchronization system being configured to automatically use at least one configurable parameter for applying a requested change in the target database system. The method provides a trained machine learning model, the machine learning model being configured to adjust the at least one configurable parameter based on a workload level. The method determines a current workload level at the target database system and uses the machine learning model for adjusting the at least one configurable parameter according to the determined workload level.

Abstract: A query that is frequently processed to access an object storage is identified. Results from the query returned from the object storage is transformed into a relational database format as a materialized view. When the query is submitted a subsequent time, updated results are managed from the materialized view, other materialized views, and/or the object storage when needed.

Abstract: A method of building a first distributed ledger based on synchronization with a proxy distributed ledger comprising a genesis block of a second distributed ledger and a contiguous plurality of last blocks of the second distributed ledger. The method comprises initializing a first distributed ledger by creating a first genesis block comprising executable instructions that implement a smart contract; initializing the proxy distributed ledger as a combination of the blocks read from the second distributed ledger; and building the first distributed ledger by creating blocks and adding the blocks to the first distributed ledger, wherein each block comprises a content field created at least in part based on processing one of the blocks of the proxy distributed ledger in time synchronization based on executing the executable instructions stored in the first genesis block.

Abstract: Systems and methods include a set of delta copies received from cluster node replicas of a replica set and stored on a main data storage on the cloud. A cloud storage service internally replicates the data from the delta copies and provides fault-tolerance and high availability against storage failures. All cluster node replicas participate in a delta copies merge. Each replica writes their deltas to an independent location in a shared storage on the cloud. Then, the delta merge includes deltas from all replicas when building a new main storage. This ensures that the data from all replicas are included in the delta merge.

Abstract: Systems and methods for providing a rapid hyperledger onboarding platform are provided. The rapid hyperledger onboarding platform enables various teams within an organization to have their own distributed ledger implementation with a private channel for communication among participants of that network. After a request is received from one or more clients to register an application with a distributed ledger comprising a peer node for each of the one or more clients, a selection of data elements to be stored in the distributed ledger is received. The application is instantiated on the distributed ledger. A separate channel is automatically created for each client of the one or more clients among the corresponding peer nodes. Each channel provides smart contract code execution for the application such that blocks are replicated to a node corresponding to a particular transaction and not to other peer nodes.

Abstract: The invention relates to a method for managing a database shared by a group of applications. The database comprises elements, each comprising a value and a version number. Each application comprises a replica of the database. The method comprises a step for modifying the value of an element in the replica of an application, called active application, a step for incrementing the version number of said element in said replica of the active application, a step for transmitting, via the active application, transmission data to the other applications, the transmission data comprising the modified element, and an earlier version number of this modified element, a synchronization step, during which at least one application other than the active application updates its replica based on a comparison of the earlier version number with that of said element in this replica.

Abstract: A distributed secured database system includes a ledger, a transmitting device, edge devices, and a time synchronization source. An evolving nonce is generated at the transmitting device and the edge devices. The evolving nonce is time-synced across the transmitting device and the edge devices. A hash value is generated at the transmitting device and the edge devices using the evolving nonce. The hash value is verified at the transmitting device and each of the edge devices during a particular time frame. A block is added to the distributed secured database system when the hash value is verified by the transmitting device and the edge devices.

Abstract: Proposed are a transaction savepoint management apparatus and method, which may involve: creating, based on a transaction initiation request from a user terminal, a transaction, wherein the transaction includes a plurality of operation instructions, and subsequently accessing at least one of a plurality of databases so as to sequentially execute the plurality of operation instructions according to a time sequence; and if the plurality of operation instructions includes global savepoint establishment instruction, creating and maintaining a global savepoint queue to coordinate the plurality of databases and implement an operation for global savepoints, and based on the global savepoints, triggering a database, involved in this transaction, from among the plurality of databases to establish local savepoints and record an association relationship between each of the local savepoints and the global savepoints.

Abstract: An example system includes a memory store of aggregate definitions. Each aggregate definition specifies a key value, an output store, a feature, a half-life value, and an aggregate operation metric to apply to a cross of the feature and the half-life value to generate aggregate metrics. The system also includes an aggregation engine that generates aggregate feature records from the input source based on the aggregate definitions and stores the aggregate feature records in the output store. An aggregate feature record includes an aggregate of the metric for the feature decayed over time using the half-life. The system also includes a query service that identifies, using the aggregate definitions, responsive aggregate feature records that satisfy parameters of a received request, applies the half-life to the responsive feature records, and provides the responsive feature records to a requester, the requester using the responsive feature records as input for a neural network.

Abstract: Embodiments of the present disclosure include systems and methods for identifying people in an image that contains more than one images of people. In embodiments, a query feature representation that represents features is extracted from each image of a person. In embodiments, each query feature representation is compared to image feature representations in a database and a set of candidate representations is selected among the image feature representations. Then, a set of user accounts that is associated with the set of candidate representations is selected. The strengths of connection in a network between user accounts in a set of candidate user accounts corresponding to an image and user accounts in a different set of candidate user accounts corresponding to a different image may be determined. In embodiments, user accounts that has the highest strength of connection are selected and used to identify the persons corresponding to the images.

Abstract: An external function system can be implemented on a database to perform processing on one or more external network services. The external function system can comprise a particular external function for a particular external service, an outbound serializer function, and an inbound serializer function that are linked with the particular external function. The outbound serializer function can be configured to transform the data of a query from a database format to a different format of the particular external network service. The inbound deserializer function can be configured to receive data returned from the external service and transform the data to the format of the database.

Abstract: Disclosed is a system for automatically estimating spatio-temporal entity counts in real time and for a future time window using machine learning from partially observable location data. The system includes a data aggregator, a hyper-cube computational data structure, a geo coder, a geolocation mapper, a key value data structure updater, a hyper cube estimator, a census-based extrapolator, and an entity estimator. The entity estimator (i) determines an entity count for each or combinations of the one or more spatio temporal dimensions in real time by combining lower bound number and upper bound number of the entity count from the hyper cube estimator and the census based extrapolator, and (ii) estimates, using a machine learning based time series model, spatio temporal entity count for a future time window in response to a query criterion.

Abstract: Techniques for scheduling search queries in a computing environment are disclosed. A search query scheduling system associates a first set of queries with a first skew tolerance, the first set of queries scheduled to be performed during a first period, where the first skew tolerance is based on a duration of the first period. The search query scheduling system reschedules a first subset of search queries included in the first set of queries by skewing the first subset of search queries over a first portion of the first period based on the first skew tolerance.