Patent classifications
G06F16/2455
Efficient traversal of hierarchical datasets
In one embodiment, a method comprises receiving a request for a particular user identification (ID) to perform a particular operation on a particular data object. An entitlement cache associates each operation that the particular user ID is entitled to perform with a first encoding of a tuple of a plurality of tuples. An object mapping cache associates each tuple of the plurality of tuples with a second encoding of each tuple of the plurality of tuples. An object mapping is used to determine a first tuple. The object mapping cache is used to determine a first vector of one of more left values based on the first tuple. The entitlement cache is used to determine a second vector of one or more value pairs. In response to identifying a match between the first vector and the second vector, the particular user ID is granted access to the particular data object.
Methods and apparatuses for generating redo records for cloud-based database
Methods and apparatuses in a cloud-based database management system are described. Data in a database are stored in a plurality of pages in a page store of the database. A plurality of redo log records are received to be applied to the database. The redo log records within a predefined boundary are parsed to determine, for each given redo log record, a corresponding page to which the given log record is to be applied. The redo log records are reordered by corresponding page. The reordered redo log records are stored to be applied to the page store of the database.
Community data aggregation with automated followup
A system and method are disclosed for the collection and aggregation of data from contributing members of a community, such as health-related, personal, genomic, medical, and other data of interest for individuals and populations. Contributors become members of a community upon creation of an account and providing of data or files. The data is received and processed, such as to analyze, structure, perform quality control, and curate the data. Value or shares in one or more community databases are computed and attributed to each contributing member. The data is controlled to avoid identification or personalization. Steps are taken to determine incompleteness and incorrectness of the data, and the data may be improved or completed automatically, based upon interaction with members, additional contributions of data, and so forth.
Implementing linear algebra functions via decentralized execution of query operator flows
A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.
Database systems for similar accommodation determination
A system and a method are disclosed for replacing a listing of a canceled booking for a guest user. In an embodiment, an accommodation management system receives an indication that a booking by the guest user has been canceled. The system retrieves, from an attribute database, attributes of the canceled listing and maps each attribute to a set of similar attributes in an equivalence table. The system retrieves, from a listing database, a set of comparable listings, each of which includes one or more of the mapped similar attributes and available during the same time period as the canceled booking. The system books one of the comparable listings for the guest user during the time period by populating a booking data structure with a connection between the comparable listing and the guest user.
Database systems for similar accommodation determination
A system and a method are disclosed for replacing a listing of a canceled booking for a guest user. In an embodiment, an accommodation management system receives an indication that a booking by the guest user has been canceled. The system retrieves, from an attribute database, attributes of the canceled listing and maps each attribute to a set of similar attributes in an equivalence table. The system retrieves, from a listing database, a set of comparable listings, each of which includes one or more of the mapped similar attributes and available during the same time period as the canceled booking. The system books one of the comparable listings for the guest user during the time period by populating a booking data structure with a connection between the comparable listing and the guest user.
Search infrastructure
A system for real-time search, including: a set of partitions, each including a set of segments, each segment corresponding to a time slice of messages posted to the messaging platform, and a real-time search engine configured to receive a search term in parallel with other partitions in set the set of partitions, and search at least one of the set of segments in reverse chronological order of the corresponding time slice to identify document identifiers of messages containing the search term; and a search fanout module configured to: receive a search query including the search term; send the search term to each of the set of partitions for parallel searching; and return, in response to the search query, at least one of the identified document identifiers of messages containing the search term.
Cache conscious techniques for generation of quasi-dense grouping codes of compressed columnar data in relational database systems
Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.
Columnar techniques for big metadata management
A method for managing big metadata using columnar techniques includes receiving a query request requesting data blocks from a data table that match query parameters. The data table is associated with system tables that each includes metadata for a corresponding data block of the data table. The method includes generating, based on the query request, a system query to return a subset of rows that correspond to the data blocks that match the query parameters. The method further includes generating, based on the query request and the system query, a final query to return a subset of data blocks from the data table corresponding to the subset of rows. The method also includes determining whether any of the data blocks in the subset of data blocks match the query parameters, and returning the matching data blocks when one or more data blocks match the query parameters.
Bucket data distribution for exporting data to worker nodes
Systems and methods are described for exporting bucket data from one or more buckets to one or more worker nodes. The system can identify data from different bucket data from buckets stored in a data intake and query system that is to be processed by one or more worker nodes. The system can allocate one or more execution resources, such as a processing pipeline, to process and export the bucket data from the buckets. The system can assign bucket data corresponding to individual buckets to the execution resource based on a bucket distribution policy. The indexer can export the bucket data to the worker nodes for further processing based on the bucket data-execution resource assignment.