A computer-implemented method for paging row-based data stored as an object file. The method includes receiving, from a client, a request for a set of data, wherein the set of data is included in a file, the file is stored as an object file, and the object file is stored in an object based storage system and the file includes row based data for a plurality of rows. The method also includes, generating, by a micro-service, an index of the file, wherein the index file includes a byte to row translation of a portion of the file. The method includes, storing the index in the object based storage system. The method further includes, retrieving, from the index, the set of data. The method includes, returning, to the client, the set of data.

A KV database configuration method, a query method, a device, and a storage medium, wherein the method comprises: taking unique index data of a first data table as a key value, taking a plurality of common index data as value value, and storing the first data table into a data storage area (S11); taking first index information generated according to the first data in the first data table as the key value, taking the unique index data of the first data as the value value, and generating a plurality of index data pairs and storing the index data pairs into the index storage area (S12); wherein, the first index information comprises the name of the first index, and the index data of the first index in the first data. The method realizes automatically storing all relational data in the data table into the kv database, greatly simplifies the workload of manually constructing the kv, and meanwhile, a common kv database can also achieve the effect of a relational database.

One embodiment sets forth a technique for generating a tree structure within a computer memory for storing sparse data. The technique includes dividing a matrix into a first plurality of equally sized regions. The technique also includes dividing at least one region in the first plurality of regions into a second plurality of regions, where the second plurality of regions includes a first region and one or more second regions that have a substantially equal number of nonzero matrix values and are formed within the first region. The technique further includes creating the tree structure within the computer memory by generating a first plurality of nodes representing the first plurality of regions, generating a second plurality of nodes representing the second plurality of regions, and grouping, under a first node representing the first region, one or more second nodes representing the one or more second regions.

A method of determining an indication of an intersection between a first dataset and a second dataset, the first and second datasets each holding entries in association with at least one key, the method comprising: generating for the at least one key in the first dataset location information in a first binary structure by applying a deterministic function to the entries associated with the key; transmitting the first binary structure to a comparison stage; generating for the at least one key in the second dataset, location information in a second binary structure by applying the same deterministic function to the entries associated with the key; and comparing, at the comparison stage, the location information in the first and second binary structures to determine the indication of the intersection between the first dataset and second dataset.

Described herein is a system and method for performing an updating of child records associated with a parent record within the specified time period, wherein the parent record has a value including a sum of values present in the associated child records, wherein a row lock on the child records is obtained, and the update is performed, and wherein such an update does not require a row lock on the associated parent record, wherein the parent record is periodically updated within the specified time period.

Methods and apparatuses are described for normalizing digital content across databases and generating personalized content recommendations. A server normalizes structured text for each content item to generate unstructured text. The server converts the unstructured text into a multidimensional content item feature set. The server trains a model based upon user profile information, historical content consumption information, historical content recommendation information, and the feature sets. The server receives a request including a vector associated with a user of a client device. The server executes the model using the vector as input to generate interaction prediction scores. The server selects scores above a threshold and identifies content items associated with each score. The server retrieves identified items for display, including converting the normalized text for the items into a format compatible with the client device, receives a response to the displayed digital content items, and updates the model based upon the response.

A query directed at a table organized into a set of batch units is received. The query comprises a predicate for which values are unknown prior to runtime. A set of values for the predicate are determined based on the query. An index access plan is created based on the set of values. Based on the index access plan, the set of batch units are pruned using a pruning index associated with the table. The pruning index comprises a set of filters that index distinct values in each column of the table. The pruning of the set of batch units comprises identifying a subset of batch units to scan for data that satisfies the query. The subset of batch units of the table are scanned to identify data that satisfies the query.

Systems and methods for multi-layered key-value storage are described. For example, methods may include receiving two or more put requests that each include a respective primary key and a corresponding respective value; storing the two or more put requests in a buffer in a first datastore; determining whether the buffer is storing put requests that collectively exceed a threshold; responsive to the determination that the threshold has been exceeded, transmitting a write request to a second datastore, including a subsidiary key and a corresponding data file that includes the respective values of the two or more put requests at respective offsets in the data file; for the two or more put requests, storing respective entries in an index in the first datastore that associate the respective primary keys with the subsidiary key and the respective offsets; and deleting the two or more put requests from the buffer.

A method of adapting a first key-value store to a second key-value store may include determining a conversion strategy based on one or more characteristics of the first key-value store and one or more characteristics of the second key-value store, converting the second key-value store to a converted key-value store based on the conversion strategy, and mapping the first key-value store to the converted key-value store based on a mapping function. The converted key-value store may be accessed on-the-fly. A data storage system may include a key-value interface configured to provide access to a lower key-value store, and a key-value adapter coupled to the key-value interface and configured to adapt an upper key-value store to the lower key-value store, wherein the key-value adapter may be configured to adapt at least two different types of the upper key-value store to the lower key-value store.

Methods and apparatus are disclosed for representing a dynamic hierarchical system as a composite graph data structure. Members of a system are represented as primary nodes of a tree. Multiple system states have respective trees, which can be overlaid to obtain a composite graph. The composite graph can be augmented with secondary nodes for member attributes, and further nodes for state-dependent values of the attributes. Methods of processing bottom-up, top-down, and filtered queries are disclosed. Applications to military, manufacturing, and communication networks are provided.