Abstract: Data is replicated on a backup node, where the granularity of the replication can be less than a full volume. A data consistency group comprising a subset of data for a volume is defined for a primary node. A set of differences for the data consistency group is sent to a backup node. The backup node creates change logs in response to receiving the set of differences. In response to receiving a request to access a file having data in the data consistency group, the backup node creates a clone of the file. The backup node determines whether an update to a data block of the file exists in the change logs. In response to determining that the update to the data block exists in the change logs, the backup node updates a copy of the data block for the cloned file with data in the change logs.

Abstract: Techniques for implementing a non-relational database that makes efficient use of collections within the database. For one or more collections, two or more sub-collections can be created for storing documents. Each collection can be configured as a single partition entity or a partitioned entity within the database. Each sub-collection is identified by a sub-collection identifier. If the collection is configured as a partitioned entity, then a partition key can be determined for documents to be accessed in the collection. The partition key can be extended with the sub-collection ID to form a compound property (sub-collection ID, partition key) that determines placements of the respective documents in the identified sub-collection across partitions of the collection. If the collection is configured as a single partition entity, then a field for the partition key is ignored and the respective documents are placed in the identified sub-collection within the single partition of the collection.

Abstract: The present disclosure provides a method comprising receiving an instruction to partition a trie in a database, wherein the trie comprises a first sequence of values comprising information that indicates labels of keys in the trie, a second sequence of values comprising information that indicates whether the labels in the first sequence have one or more child nodes, a third sequence of values comprising information that indicates whether the labels in the first sequence are first child nodes under a parent node, and a fourth sequence of values comprising information that indicates values that corresponds to the labels in the first sequence; separating a sub-trie from the trie by removing entries corresponding to the sub-trie from the first, the second, the third, and the fourth sequences; and updating an entry in the fourth sequence corresponding to a parent node of the sub-trie using a memory address of the sub-trie.

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: 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: Embodiments described herein provide a system for facilitating efficient indexing in a database. The system can maintain a data table in the database. The data table includes a first column for structured data and a second column for unstructured text. A row of the data table can include a first piece of data in the first column and a second piece of data in the second column. During operation, the system performs word segmentation on the second piece of data to generate a first set of semantically meaningful word segments. The system then generates a set of index entries that corresponds to the row. A respective index entry includes an index generated from the first piece of data and a corresponding word segment of the first set of semantically meaningful word segments.

Abstract: Systems and methods for adjusting parameters for a spin-lock implementation of concurrency control are described herein. In an embodiment, a system continuously retrieves, from a resource management system, one or more state values defining a state of the resource management system. Based on the one or more state values, the system determines that the resource management system has reached a steady state and, in response adjusts a plurality of parameters for spin-locking performed by said resource management system to identify optimal values for the plurality of parameters. After adjusting the plurality of parameters, the system detects, based on one or more current state values, a workload change in the resource management system and, in response, readjusts the plurality of parameters for spin-locking performed by said resource management system to identify new optimal values for the parameters.

Abstract: A method includes maintaining a hierarchical datastore for an agent instantiated in a computer-generated reality (CGR) environment. The hierarchical datastore includes a first storage hierarchy associated with a first data type and a second storage hierarchy associated with a second data type. The method includes detecting a sensory input that includes sensory input data. The method includes determining a type of the sensory input data. The method includes, in response to the sensory input data being of the first data type, storing the sensory input data in the first storage hierarchy for a first amount of time associated with the first storage hierarchy. The method includes, in response to the sensory input data being of the second data type, storing the sensory input data in the second storage hierarchy for a second amount of time that is different from the first amount of time.

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: In some examples, a system receives, in a synchronization buffer stored in a memory, fingerprint index entries for respective data units received by the system, each fingerprint index entry of the fingerprint index entries comprising a fingerprint computed for a corresponding data unit, and a storage location indicator for the corresponding data unit. The system merges the fingerprint index entries in the synchronization buffer with fingerprint index entries of a persistent fingerprint index in a hash data structure stored in persistent storage, the hash data structure comprising a plurality of buckets.

Abstract: System, method, and various embodiments for providing a metadata based memory management system are described herein. An embodiment operates by determining metadata of a table of a database indicating whether data of the table is to be stored in memory or disk storage, wherein the table comprises a plurality of columns and a plurality of rows. A first column of the table is identified. A hierarchy of the metadata for the table including a column value, partition value, and table value is determined, wherein the column value is prioritized over the partition value, and wherein the partition value is prioritized over the table value. The data of the table stored in the column is loaded from the disk storage into the memory based on the hierarchy. A query is processed based on the data loaded into the memory.

Abstract: Some aspects provide: analyzing data exchange database records of a first entity; determining a sector with which the first entity is associated by at least one of the analyzing and first entity input identifying the sector; analyzing data exchange database records of second entity(ies) different from the first entity, to determine sector associated second entity(ies) data exchanges; analyzing the sector associated second entity(ies) data exchange records to determine data baseline(s); analyzing the first entity data exchange records to determine first entity data baseline(s), at least one of which corresponding in type to a respective one of the data baseline(s); comparing one of the data baseline(s) to a corresponding one of the first entity data baseline(s); identifying the relevant information based on the comparing; and notifying, via a communication module of the computing device, over a network, an electronic device associated with the first entity of the relevant information.

Abstract: A system and method that given a user preference will create a list of geographic locations that are the closest matches to the user's criteria. Based on the user specified importance of one or more categories and advanced metrics, locations are ranked. Climate category is ranked by estimating the number of days the user will be comfortable per year. Budget category is estimated based on if user wants to save money, have approximately the same cost of living, or pay more for improved lifestyle. For diversity metric, ranking is based on diverse or a specific ethnicity.

Abstract: Index sharding in a low-latency database analysis system includes obtaining index configuration data for indexing constituent data, the constituent data including a plurality of logical tables, and indexing, by an indexing unit, the constituent data by partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for each segment of the second partition, sharding the segment into one or more respective shards.

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: An index update method, including: receiving an index update request, where the index update request is used to instruct to create or delete a target index that is associated with a field in a logic table of a tenant; updating metadata information of the logic table in a database in response to the index update request; notifying a coordination service, where the coordination service is used to notify a second data access node to perform a local synchronization update; and after all second data access nodes finish local synchronization updates, performing a data asynchronization update. After the metadata information is updated in the database, an index is updated in two steps. In a first step, a local synchronization update is performed. In a second step, after all data access nodes finish local synchronization updates, a data asynchronization update is performed.

Abstract: Some embodiments provide a method for expressing viability of a first database as a candidate for replacing a second database. The method identifies a first group of database queries that a group of applications directed towards the second database. The method produces a second group of queries by removing, from the first group, queries that are duplicates. Based on a set of complexity values associated with a set of components of the second group of queries, the method generates a complexity indicator representing a level of difficulty for rewriting the second group of queries for the second database.

Abstract: An approach to structured record retrieval permits transmission and storage of records in a native concise format, without requiring that the records be interpreted and stored in a tabular form. Such storage of the records in a tabular form might double the space required, and more generally, requires substantially more space in applications in which there are many optional elements. In some embodiments, each message is parsed according to a specification of the message structure (e.g., according to a “grammar” for the message), and during parsing field values in predefined positions in the structure are extracted and added to an index structure that associates record identifiers with the (position, value) pairs.

Abstract: In one example this disclosure describes a method that includes receiving, by a computing system, a first single character input from a user for a type down search. Responsive to the first single character input, sending, by the computing system, a plurality of asynchronous search requests to one or more data sources. Responsive to the plurality of asynchronous search requests, receiving, by the computing system, a first one or more data source search results from a first data source. Displaying, by the computing system, the one or more data source search results. Receiving, by the computing system, a second one or more data source search results from a second data source different from the first data source. And, updating, by the computing system and based on the received second one or more data source search results, the displayed one or more data source search results.

Abstract: There has been desired a technique for creating a table on a database without formulating an SQL statement. A control system includes a development support device and a controller. The development support device includes a development tool configured to accept, as setting information, a setting that designates collection target variables from among variables included in a control program, and a setting that designates an identification name, on a database, of each collection target variable. The controller includes a generation module-configured to output an SQL statement for creating a table on the database, based on a data type and an identification name on the database, the identification name being specified in the setting information.