Abstract: A B+ tree access method, apparatus, and a medium include: when a B+ tree creation instruction is acquired, determining whether there is an idle underlying tree file mapped to a Dynamic Random Access Memory (DRAM); if YES, storing underlying data of a B+ tree in the underlying tree file; if NO, creating a new target underlying tree file, and mapping the target underlying tree file to the DRAM, so as to store the underlying data of the B+ tree in the target underlying tree file; and when a number of layers of the B+ tree is greater than or equal to a preset threshold, storing, in a preset storage area, data of a layer numbered to be greater than or equal to the preset threshold in the B+ tree. Based on a data structure of the B+ tree, data needs to be accessed from the underlying data whenever read.

Abstract: A partition merging method includes obtaining, by a first database server, first metadata of a first partition based on an identifier of a current file of the first partition, obtaining second metadata of a second partition based on an identifier of a current file of the second partition, and generating third metadata of a third partition based on the first metadata and the second metadata.

Abstract: Non-relational database operations are invoked to provide results consistent with commands specified in a relational query language. A request to access data in a non-relational database is received that includes one or more commands specified in a query language for accessing data according to a relational data scheme. The request may be evaluated to determine one or more Application Programming Interfaces (APIs) to invoke operations at the non-relational database that provide a result consistent with the commands specified in the query language. The determined APIs are executed and a result returned for the request based on the execution of the APIs.

Abstract: A system, method, and machine-readable storage medium for maintaining an object storage system data are provided. In some embodiments, an object manager may receive a request to perform an operation on an object. The object storage system includes a first database of a first type and a second database of a second type. The object manager may identify a first record stored in the first database. The first record includes a name marker indicating a range of object names covered by the second database and includes a file handle referencing the second database. The range of object names includes the object name. Additionally, the object manager may identify a second record stored in the second database. The second record includes the object name and includes a file handle referencing the object. The object manager may perform the operation on the object in accordance with the request.

Abstract: The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. A determination is made that an unacceptable number of possible matching documents is likely to be returned. In response to the determination, a strengthening row bit vector is selected to reduce the number of possible matching documents. The identified bit vectors and the selected strengthening row are intersected to identify matching documents that contain the term.

Abstract: Multi-tenant hosting of inverted indexes for text searches is implemented. Text search requests are routed to different index nodes that cache inverted indexes for different user accounts. Updates to inverted indexes are routed to index nodes that have acquired a lock on an inverted index. The index nodes have access to a common data store that persistently stores the inverted indexes.

Abstract: Systems, methods, and computer-readable media are disclosed herein that generate a ternary tree data structure that includes multiple categories (e.g., terminologies) using dynamic array modifications that facilitate sharing of one or more nodes across categories. A plurality of different categories may be added and stored within a single ternary tree data structure such that each categories may be separately queried using the single ternary data structure.

Abstract: Among other things, we describe a method of receiving a portion of metadata from a data source, the portion of metadata describing nodes and edges; generating instances of a data structure representing the portion of metadata, at least one instance of the data structure including an identification value that identifies a corresponding node, one or more property values representing respective properties of the corresponding node, and one or more pointers to respective identification values, each pointer representing an edge associated with a node identified by the corresponding respective identification value; storing the instances of the data structure in random access memory; receiving a query that includes an identification of at least one particular element of data; and using at least one instance of the data structure to cause a display of a computer system to display a representation of lineage of the particular element of data.

Abstract: Systems, devices, and methods are provided for implementing shadow data lakes. In at least one embodiment, a deletion workflow obtains a deletion request from a delete request cache service, gets attestation details from an attestation service, submits a job to scan one or more records from a source table of a data lake and publish the one or more records to a deleted records table of a shadow data lake, and cause deletion of the one or more records from the data lake.

Abstract: Systems and methods are disclosed for scalable bucket merging in a data intake and query system. Various components of a bucket manager can be used to monitor recently-created buckets of data in common storage that are associated with a particular tenant and a particular index, apply a comprehensive bucket merge policy to determine groups of buckets that qualify for merging, merge those group of buckets into merged buckets to be stored in the common storage, and update any information associated with the merged buckets and pre-merged buckets. These components may be shared across multiple tenants, and some of these components may be dynamically scalable based on need. This approach may also provide many additional benefits, including improved search performance from merged buckets, efficient resource utilization associated with discriminate merging, and redundancy in case of component failure.

Abstract: Provided are a computer program product, system, and method for processing request directed through a channel subsystem to a storage server. In one embodiment, a pattern search request is embedded in a Device Command Word (DCW) which allows the storage server to do all or substantially all of the search and comparison work in response to as few as a single DCW from the host. In addition, I/O processing can be enhanced to use the target record of interest of a successful embedded pattern search request as the starting point for read/write I/O processing, all in response to as few as a single DCW. Still further, orientation rules can also be relaxed such that once a target record is found, any and all fields of the record can be accessed and utilized in execution of subsequent commands of the initial or subsequent DCWs of the chain.

Abstract: Methods and systems for determining at least one candidate user for a license plate number (LPN) are described herein. A set of license plate recognition (LPR) events that correspond to the LPN and a set of access events of a plurality of users may be obtained. One or more associated events for each respective user of the plurality of users may be determined. A confidence score for each respective user may be determined based on the one or more associated events for the respective user. At least one candidate user for the LPN may be identified based on the confidence score. An indication that the at least one candidate user is a candidate for the LPN is output. Methods and systems for determining at least one candidate license plate number for a user are also described herein. Additional related methods and systems are described herein.

Abstract: A central database system receives information associated with an employee from an employer. Using this information, the central database system can provision one or more user accounts for the employee, for instance via an API of an account provider. The central database system can use a machine learned model to identify fields of the API and to translate the information associated with the employee based on information requirements associated with the API. When a characteristic of the employee, such as the employee's title, subsequently changes within the central database system, one or more features associated with the user account can be automatically updated in response to the change.

Abstract: This disclosure is provided, in which an answer generation unit configured to receive a document and a question as inputs, and execute processing of generating an answer sentence for the question by a learned model by using a word included in a union of a predetermined first vocabulary and a second vocabulary composed of words included in the document and the question, in which the learned model includes a learned neural network that has been learned in advance whether word included in the answer sentence is included in the second vocabulary, and increases or decreases a probability at which a word included in the second vocabulary is selected as the word included in the answer sentence at the time of generating the answer sentence by the learned neural network.

Abstract: Aspects of the present disclosure relate to systems and methods for dynamically adjusting queries based on data protection configurations. In one example, a request for data is received from an application. The data is indexed in at least one of a first index database, a second index database and a third index database. A first key notification indicating a protection status of a personal device is received. A query is sent to each of the first index database, the second index database and the third index database for the requested data based on the protection status of the personal device. The requested data is loaded into the application. A second key notification indicating a change in the protection status of the personal device is received. At least some of the loaded data is removed from the application based on the change in the protection status of the personal device.

Abstract: Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.

Abstract: Systems and methods for locking databases during database operations, such as logical mechanisms for locking a local number portability (LNP) database associated with the Number Portability Administration Center (NPAC), are described. For example, the systems and methods may utilize various logical constructs, such as parameters that identify items or records within a database (e.g., object type and value information), and lock records that include such parameters.

Abstract: A method and system of processing database transactions in a distributed online transaction processing (OLTP) database is provided. Overhead and network bandwidth associated with a global transaction manager are reduced and scalability improved by determining whether incoming statements are single-shard or multi-shard. For single-shard statements, a local transaction identifier (TXID) stored and associated with a data record reference by the statement is retrieved. The retrieved TXID is compared against a copy of a list of prepared transactions that are pending in a respective data node. If the TXID is in the copy of the prepared list, the statement is caused to await until the previous transaction has been committed or aborted. The visibility of a change committed by the previous is then determined, and the statement is processed.

Abstract: Transaction processing systems in accordance with aspects of the invention may process a variety of transactions. Transaction processing systems may include a transaction processing device and a distributed processing system. The transaction processing device obtains transaction requests from a variety of client devices and process the transaction requests. The distributed processing system may also obtain the transaction requests and maintain a transaction history of the transaction requests obtained and/or processed by the transaction processing device. Both the distributed processing system and the transaction processing device may send a transaction succeeded event based on the transaction being processed successfully. The transaction processing device and distributed ledger may also maintain an indication of if a particular transaction has been processed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a predictive system that obtains and processes data describing terms for different medical concepts to generate commands from a user query. An entity module of the system determines whether a term describes a medical entity associated with a healthcare condition affecting an individual. When the term describes the medical entity an encoding module links the medical entity with a specified category based on an encoding scheme. The system receives the user query. A parsing engine of the system uses the received query to generate a machine-readable command by parsing the query against terms that describe the medical entity and based on the encoding scheme for linking the medical entity to the specified category. The system uses the command to query different databases to obtain data for generating a response to the received query.