Abstract: Systems and methods for ingesting data from distributed ledger systems. To ingest data from the distributed ledger systems, all or a portion of the distributed ledger systems can be assigned a connector. One or more connectors can be initialized for a particular distributed ledger system. For example, the data intake and query system can include a first connector that is initialized for a first distributed ledger system and a second connector that is initialized for a second distributed ledger system. The connectors can be initiated with processing schema that can indicate how the connectors ingest, enrich, filter, etc. data from the distributed ledger systems. All or a portion of the connectors can be initiated with different processing schemas. The connectors can obtain data from nodes of the distributed ledger systems according to the processing schemas and route the data to the data intake and query system.

Abstract: Systems and techniques for intelligent data management are described herein. An example technique may include receiving a set of training data from a graph cube server, training a machine learning model using the received set of training data, and determining, using the machine learning model, a data usage pattern. The example technique may include receiving an indication that a first user of a user group logged into an intelligent data management system, the indication including a first user detail of the first user, and loading a first column into memory based on the determined data usage pattern and the first user detail.

Abstract: A system and method for adaptive data processing combining compression and encryption. The system analyzes input data characteristics, compares probability distributions, and creates a transformation matrix to convert data into a dyadic distribution. It generates a main data stream of transformed data and a secondary stream of transformation information. The system dynamically selects and applies processing techniques, including transformation, encoding, compression, and encryption algorithms, based on analyzed characteristics and real-time performance metrics. It compresses the main data stream using Huffman coding and implements security measures to protect the output. A feedback loop monitors technique effectiveness, updates a knowledge base, and influences future selections. The system can operate in lossless, lossy, or modified lossless modes, adapting to different application requirements.

Abstract: A metastore manager facilitates access to data/metadata stored on at least one data management platform. A first data processing operation is initiated, in association with a data set maintained in a first data store associated with a first data management platform, to generate a first processed data set. The first processed data set is stored in the first data store and a first metadata set corresponding to the first processed data set is stored in a first metastore associated with the first data store. The first metadata set includes partition metadata indicative of partitioning information associated with the first processed data set. A synchronization operation is implemented to store, in a second metastore associated with a second data management platform, a second metadata set corresponding to a subset of the first metadata set. The metastore manager may facilitate access, by a data processing pipeline, to the processed data set.

Abstract: A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger data storage file, and a node subset of computing nodes of the system that subscribe to the data shard. The primary node identifies which computing nodes of the node subset each have sufficient computing resources to execute the plan, as candidate computing nodes. The primary node identifies which files of the file subset each candidate computing node locally caches. The primary node selects one candidate computing node to execute the plan, based on the files of the file subset that each candidate computing node locally caches. The primary node causes the selected candidate computing node to execute the plan.

Abstract: Storage accesses for merge operations are minimized. A plurality of records of a plurality of input lists are merged. The merging includes determining that an input list of the plurality of input lists has become empty, and checking, based on determining that the input list has become empty, a control specific for the input list. The control is used to determine how to proceed, such as whether to end merging or continue merging.

Abstract: Improved systems and methods for navigating and interacting in virtual communication environments. At least some of these systems and methods provide a framework that includes one or more virtual areas and supports realtime communications between the communicants. At least some of these systems and methods provide an interface that includes navigation controls that enable a user to navigate virtual areas and interaction controls that enable the user to interact with other communicants in the one or more virtual areas.

Abstract: A computing machine receives a request for an action by a meta-agent at the computing machine. The computing machine selects, using the meta-agent, an agent for determining an action responsive to the request. The agent is selected from a plurality of reinforcement learning agents. The agent is selected based on values in a dataset associated with the request. At least a portion of the dataset has predefined value types. The meta-agent and each agent from the plurality of reinforcement learning agents is trained using datasets including the predefined value types. The computing machine transmits, to the selected agent, the request for the action to cause the agent to compute the action.

Abstract: A system gathers information on important and influential people and builds a social graph. The system regularly sends news alert messages to users. This can help users nurture their relationship with persons they are connected to, by providing them with updates on news and other events that happen to persons they are connected to. The watch can be customized with a variety of options, such as including related entities, organizing news alerts with user data, and other options.

Abstract: A hardware-based compaction accelerator may comprise two or more decoders, a merge iterator, a compaction module, and an encoder. Each of the decoders converts a sorted string table (SST) files into a corresponding key-value (KV) format data stream. The merge iterator receives a KV format data stream from each of the decoders, and combines the KV format data streams into a single KV format data stream. The compaction module receives the composite KV format data stream and produces a compacted data stream. The compacted data stream contains less data that is in the composite KV format data stream. The encoder converts the composite KV format data stream back into one or more output SST files. The compaction accelerator may be configured to perform only a subset of the processing available from the decoders, merge iterator, compaction module, and encoder, and may be configured through the Internet using a cloud-based processor.

Abstract: Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.

Abstract: The present teaching relates to recommending content by analyzing the streamed data. A request is received from a user requesting one or more recommendations from a set of items. A first distribution indicative of an interest distribution of the user in a plurality of topics is obtained. For each item, a second distribution indicative of a classification distribution of the item with respect to the plurality of topics is obtained. A score is estimated based on the first distribution and the second distribution, wherein the score indicates likelihood that the user is interested in the item. The scores associated with the set of items are ranked. The one or more recommendations are presented based on the ranked scores.

Abstract: Systems and methods for efficient bulk data deletion. The system comprises: 1) a deletion record set; an in-memory database representation comprising: tables and records; one or more exclusive locks for the records; and a record block index; 2) a persistent database representation comprising: record blocks; and a transaction log. The method comprises: receiving, by a processor, a deletion record set; acquiring, by the processor, an exclusive lock for one or more records in the deletion record set; deleting, by the processor, the deletion record set from an in-memory representation of the database; generating, by the processor, one or more post-delete record block sets; updating, by the processor, an in-memory record block index; writing, by the processor, the one or more post-delete record block sets to a persistent storage representation of the database; and, adding, by the processor, a transaction log entry for the record block index update.

Abstract: Storage accesses for merge operations are minimized. A plurality of records of a plurality of input lists are merged. The merging includes determining that an input list of the plurality of input lists has become empty, and checking, based on determining that the input list has become empty, a control specific for the input list. The control is used to determine how to proceed, such as whether to end merging or continue merging.

Abstract: A method for generating a probability for a first action of a sporting event by implementing a feature set, the method including: obtaining an initial set of data relating to the first action of a sporting event, the initial set of data including at least a position of a first player on a surface and a position of a target area on the surface; generating, by a machine learning model, an initial projected scoring probability based on the initial set of data; generating a feature set relating to the sporting event; and modifying, by the machine learning model, the initial projected scoring probability to an updated scoring probability using the feature set.

Abstract: Methods for determining a value assurance score for an investigated parameter in an application by means of an assurance determination model, in large data sets, in particular in such application contexts as financial record keeping (auditing). The methods are computer-implemented and involves establishing one or more inter-parameter correlations between at least a subset of the potential parameters, where the correlations link at least two of the parameters of the subset.

Abstract: Methods and apparatuses for provisioning a database management platform in a cloud computing environment include a server that reserves virtual computing resources in the cloud environment. The server provisions a database management platform using the reserved virtual computing resources. The database management platform includes primary and secondary database instances, a database observer instance, and a platform monitor agent. The server configures a database observer instance to monitor availability of database instances and to route traffic to other database instances. The server integrates the database management platform with an identity authentication service, monitors operational status of the database management platform using a monitoring service, and refreshes the reserved virtual computing resources in the database management platform using a rehydration service.

Abstract: The use of digital data privacy asserting technology, including but not limited to encryption technology, is specified so as to create entity specific data assets that assert entity specific data rights, including but not limited to, the right to determine how that data can be used by others.

Abstract: A computer-implemented method for intelligent query response in an enterprise resource planning (ERP) system is disclosed. The method can receive, from a user interface of the ERP system, a natural language user query for processing data of a target object and invoke a function call through an application programming interface of the ERP system based on the user query. Invoking the function call includes extract denormalized data from one or more database tables, generating a prompt using a prompt template and the denormalized data, prompting a large language model using the prompt, and receiving a response generated by the large language model. The method can generate an output on the user interface based on the response generated by the large language model. Related systems and software for implementing the method are also disclosed.

Abstract: The invention generally relates to systems and methods for automatically generating websites and suggesting a related business entity type using generative artificial intelligence that requires minimal user input, and which does not require the technical skills and expertise that is traditionally needed to develop websites.