Abstract: The described technology is generally directed towards managing data retention policy for stream data stored in a streaming storage system. When a request to truncate a data stream from a certain position (e.g., from a request-specified stream cut) is received, an evaluation is made to determine whether the requested position is within a data retention period as specified by data retention policy. If any data prior to the stream cut position (corresponding to a stream cut time) is within the data retention period, the truncation request is blocked. Otherwise truncation from the stream cut point is allowed to proceed/is performed. Also described is handling automated (e.g., sized based) stream truncation requests with respect to data retention.

Abstract: A method for accelerating data operations across a plurality of nodes of one or more clusters of a distributed computing environment. Rack awareness information characterizing the plurality of nodes is retrieved and a non-volatile memory (NVM) capability of each node is determined. A write operation is received at a management node of the plurality of nodes and one or more of the rack awareness information and the NVM capability of the plurality of nodes are analyzed to select one or more nodes to receive at least a portion of the write operation, wherein at least one of the selected nodes has an NVM capability. A multicast group for the write operation is then generated wherein the selected nodes are subscribers of the multicast group, and the multicast group is used to perform hardware accelerated read or write operations at one or more of the selected nodes.

Abstract: Interaction output over a local computer-readable medium (CRM) generated based on user interaction with rendered content input representing a virtualized asset being is received at a virtualized asset local provisioning server. A manner to exploit the virtualized asset is determined from interaction output. The virtualized asset is exploited based on the determined manner to exploit the virtualized asset. A request for a portion of the virtualized asset generated in response to the exploiting the virtualized asset is intercepted. If it is determined that the portion of the virtualized asset is absent from the local storage, a request for the portion of the virtualized asset is sent to a virtualized asset delivery system over a non-local CRM; the portion of the virtualized asset retrieved by the virtualized asset delivery system is received over the non-local CRM; and the received portion of the virtualized asset is used in exploiting the virtualized asset.

Abstract: An example method of determining geolocations of objects based on information retrieved from heterogeneous data sources comprises: receiving, from a first data source associated with an object by an ontology-defined relationship, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the object; receiving, from a second data source associated with an object by an ontology-defined relationship, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the object; and determining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the object and a corresponding time identifier.

Abstract: A URL and a categorization associated with the URL are received. A key associated with the received URL is determined. An operation is performed on a database using the determined key. Examples of such operations include inserting the categorization into the database, changing a value associated with the key in the database, removing a key-value pair from the database, and querying the database.

Abstract: Methods, apparatus, systems, computing devices, computing entities, and/or the like for using machine-learning concepts (e.g., machine learning models) to determine predicted taxonomy-based classification scores for claims and dynamically update data fields based on the same.

Abstract: The illustrative storage management system uses snapshot technologies and performs block-level analysis thereof and to synthesize full backups of a database, regardless of the database management system (DBMS) and content of the database and without involving native DBMS utilities. Synthetic full copies are created efficiently and use network transport resources sparingly. Successive snapshots of the database may be hardware snapshots and/or software snapshots. The illustrative storage management system tracks which data blocks in the database change over time after a baseline full copy is saved to secondary storage. Only the changed blocks are subsequently moved to secondary storage as incremental backups and are indexed for future reference. A synthetic full backup of the database, at a given point in time, may be created by synthesizing the original full backup with changed blocks from any number of later incremental backups.

Abstract: In a distributed database, many nodes can store copies, or instances, of the same record. If the record is split on one node, it should be split on the other nodes to maintain consistency, concurrency, and correctness of the data in the distributed database. In some distributed databases, the records are locked during the update process to ensure data integrity. Unfortunately, locking the records can increase latency, especially for larger databases. But if the records aren't locked and a node fails as a record is being split and updated simultaneously, the split and update may not propagate throughout the distributed database, leading to a loss of data integrity. Exchanging messages about the status of record splitting and forwarding updates internally reduces the likelihood of a loss of data integrity due to a node failure.

Abstract: A database contains a corpus of incident reports, a machine learning (ML) model trained to calculate paragraph vectors of the incident reports, and a look-up set table that contains a list of paragraph vectors respectively associated with sets of the incident reports. A plurality of ML worker nodes each store the look-up set table and are configured to execute the ML model. An update thread is configured to: determine that the look-up set table has expired; update the look-up set table by: (i) adding a first set of incident reports received since a most recent update of the look-up set table, and (ii) removing a second set of incident reports containing timestamps that are no longer within a sliding time window; store, in the database, the look-up set table as updated; and transmit, to the ML worker nodes, respective indications that the look-up set table has been updated.

Abstract: A method and system for accessing updated data from a database in response to a user query has been developed. First, multiple transaction logs are generated for a database. Each transaction log contains a record of actions executed by a database management system and referenced according to the specified date of the actions. Data updates are received and stored with the database. An incremental database partition is created for each data update. Each incremental database partition is stored with reference to a corresponding transaction log for the date of the data update. The updated data is accessed through the incremental database partition in response to an outdated user query. The outdated user query contains a data access request for a date earlier than the receipt of data updates.

Abstract: A memory stores graph information representing a graph that includes nodes and inter-node edges. The nodes include a first plurality of nodes each associated with node information and a first node. Each of the inter-node edges has a weight. A processor extracts, in accordance with the node information, two or more nodes and transforms the two or more nodes into an aggregate node. The processor generates an aggregate inter-node edge between the aggregate node and the first node. The aggregate inter-node edge is associated with a weight based on two or more weights associated with two or more inter-node edges between the two or more nodes and the first node. The processor estimates first node information to be associated with the first node based on transformed graph information representing a transformed graph including the aggregate node and the aggregate inter-node edge.

Abstract: Performing quantum file copying is disclosed herein. In one example, upon receiving a request to copy a source quantum file comprising a plurality of source qubits, a quantum file manager accesses a quantum file registry record identifying the plurality of source qubits and a location of each of the plurality of source qubits. The quantum file manager next allocates a plurality of target qubits equal in number to the plurality of source qubits, and copies data stored by each of the source qubits into a corresponding target qubit. The quantum file manager then generates a target quantum file registry record that identifies the plurality of target qubits and their locations. In some examples, a quantum file move operation may be performed by deleting the source quantum file after the copy operation, and updating the target quantum file registry record with the same quantum file identifier as the source quantum file.

Abstract: A method is provided of communication between a user and a database of Patents and also of the display and the interactive exploration of data on information of interest relating to Patents/Patent applications. The method comprises: the generation, by means of an access interface, of a request allowing the database to be interrogated based on at least one selection criterion entered into the access interface; the interrogation of the database by means of the request and the loading of bibliographical data for the Patents/Patent applications found, the downloaded bibliographical data comprising data on the technological category; the processing of the bibliographical data, the processing comprising an analysis of co-occurrences comprising the determination of a number of co-occurrences of data on the technological category for all of the Patents/Patent applications found; the displaying, in interactive graphical and/or textual form, of a result and/or of an interpretation of the analysis of co-occurrences.

Abstract: Methods, systems, and computer-readable storage media for receiving, by a current database system, a query plan file representative of a captured query plan from a source database system, receiving, by the current database system, a set of definitions including one or more definitions, each definition in the set of definitions corresponding to an object that is implicated by the query plan, the object being included in a set of objects, and determining, by the current database system, that each definition in the set of definitions is identical to a respective definition of a corresponding object within the current database system, and in response: executing the captured query plan in the current database system to provide a query result.

Abstract: System and methods are provided for executing queries across multiple services and data sources using a Service Graph. The Service Graph is customizable and trainable using continuous feedback loops among the various components of the Service Graph. The Service Graph is configured to select at least one data source or at least one location service from a plurality heterogeneous data sources and location services, generate an execution strategy for searching the at least one location service or the at least one data source, and provide the results generated as a result of the execution strategy.

Abstract: Provided are techniques for optimized content object storage service for large scale content. A content object file is created. An index entry for the content object file is created with a content object key and a content object location. The content object file is appended to an aggregated file on a storage node. In response to a request to retrieve the content object file from the aggregated file, the content object key is used to access the content object location that describes the storage node, a name of the aggregated file, an offset into the aggregated file, and a size of the content object file to retrieve the content object file.

Abstract: A non-transitory computer-readable recording medium records an index generation program for causing a computer to execute processing of: inputting data which is described by a combination of an item and a value; and generating index information regarding an appearance position of each of the item and the value for each of the item and the value which are included in the data.

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: A computer-implemented method includes: reading a vector of a first table in a database, the vector including counts of a plurality of keywords in the first table, the plurality of keywords including a first keyword and a second keyword; determining a first custom attribute describing the first table, the first custom attribute having a vector including counts of at least a first portion of the plurality of keywords in the first table; determining a multiplier of the first custom attribute, the multiplier being a number of other tables that reference the first custom attribute; and revising the vector of the first table based on the first custom attribute.

Abstract: Techniques for efficiently storing client data blocks on a distributed-computing system are provided. The system includes a fast performance tier and a large capacity tier. The capacity tier stores the client data blocks in erasure encoded data stripes. The performance tier stores logical map data including an address map indicating a correspondence between logical addresses associated with a first layer of the system and physical addresses associated with a second layer. A method includes receiving a request to include additional client data blocks in the client blocks. The request indicates logical addresses for additional blocks. Corresponding physical addresses for additional block are determined. Each additional block is stored at the physical address. Additional logical map data is stored in the performance tier. Storing the additional logical map data includes updating the address map to indicate the correspondence between the logical addresses and the physical addresses for the additional blocks.