Efficient database searching for queries using wildcards

    公开(公告)号:US11409742B2

    公开(公告)日:2022-08-09

    申请号:US16211633

    申请日:2018-12-06

    Abstract: Described are mechanisms for creating and utilizing a specialized index to improve the efficiency of various types of leading wildcard searches without having to unduly burden the system with write requests. The mechanisms may identify particular fields to be included in one or more types of specialized indexes that are accessed in response to particular types of wildcard queries including various combinations of leading, trailing, and intermediate wildcard operators. In addition, the mechanism may perform various pre-processing by an application when creating such indexes to conserve resources of an underlying database system. The mechanisms may also execute such wildcard queries in a manner that appears to be synchronous to a user while maintaining such indexes asynchronously for efficiency purposes.

    Elastic data partitioning of a database

    公开(公告)号:US11354168B2

    公开(公告)日:2022-06-07

    申请号:US16252433

    申请日:2019-01-18

    Abstract: A database entry may be stored in a container in a database table corresponding with a partition key. The partition key may be determined by applying one or more partition rules to one or more data values associated with the database entry. The database entry may be an instance of one of a plurality of data object definitions associated with database entries in the database. Each of the data object definitions may identify a respective one or more data fields included within an instance of the data object definition.

    Trigger-free asynchronous maintenance of custom indexes and skinny performance meta-structures

    公开(公告)号:US11003662B2

    公开(公告)日:2021-05-11

    申请号:US15798077

    申请日:2017-10-30

    Abstract: Trigger-free asynchronous maintenance of custom indexes and skinny performance meta-structures is described. A database system receives a request to manipulate data in an object in a database table, and determines whether the object in the database table is associated with a user-based data structure. If the object in the database table is associated with the user-based data structure, the database system manipulates the data in the object in the database table and data in an object in an intermediate data table. The database system receives a query, and determines whether the query requests any data that is in the user-based data structure. If the query requests any data that is in the user-based data structure, the database system creates a query result by combining any data that is in the object in the intermediate data table with any requested data that is in the user-based data structure, and outputs the query result.

    EFFICIENT PRODUCTION AND CONSUMPTION FOR DATA CHANGES IN A DATABASE UNDER HIGH CONCURRENCY

    公开(公告)号:US20210117400A1

    公开(公告)日:2021-04-22

    申请号:US17111039

    申请日:2020-12-03

    Abstract: A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.

    Enhanced search functions against custom indexes

    公开(公告)号:US10956419B2

    公开(公告)日:2021-03-23

    申请号:US16374640

    申请日:2019-04-03

    Abstract: A database query may be determined based on a database query definition. The database query definition may include a filter criterion that contains a wildcard match, which may include a first fixed portion and a second wildcard portion. The first fixed portion may include one or more combining characters. The database query may include a first query portion including a first canonical representation of the first fixed portion that omits the one or more characters. The database query may include a second query portion including a second canonical representation of the first fixed portion. The database query may be executed to select a result set that includes a plurality of query result values by applying the second query portion to filter values accessed by the first query portion.

    Efficient production and consumption for data changes in a database under high concurrency

    公开(公告)号:US10942909B2

    公开(公告)日:2021-03-09

    申请号:US16141496

    申请日:2018-09-25

    Abstract: A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.

    ELASTIC DATA PARTITIONING OF A DATABASE
    38.
    发明申请

    公开(公告)号:US20200233848A1

    公开(公告)日:2020-07-23

    申请号:US16252448

    申请日:2019-01-18

    Abstract: A database entry may be stored in a container in a database table corresponding with a partition key. The partition key may be determined by applying one or more partition rules to one or more data values associated with the database entry. The database entry may be an instance of one of a plurality of data object definitions associated with database entries in the database. Each of the data object definitions may identify a respective one or more data fields included within an instance of the data object definition.

    Maintaining data across query executions of a long-running query

    公开(公告)号:US20200057819A1

    公开(公告)日:2020-02-20

    申请号:US15998854

    申请日:2018-08-17

    Abstract: Disclosed herein are system, method, and computer program product embodiments for a query processing system. An embodiment operates by receiving a query associated with a table. An ordered index with entries that include key values that uniquely identifies a corresponding record in the table is determined. A last key value is initialized to store a minimum value for a data type of the key value. The query is executed as a union-all of a plurality of queries. While a count of selected records is less than or equal to a threshold quantity and at least one entry remains in the ordered index, an ordered next entry with a key value subsequent to the last key value in the index is identified, the corresponding record is selected from the table, the last key value is updated, the query is executed, and the count is incremented.

    Access controlled queries against user data in a datastore

    公开(公告)号:US10372934B2

    公开(公告)日:2019-08-06

    申请号:US15295288

    申请日:2016-10-17

    Abstract: In an example, a processing device of a datastore system may be configured to identify one or more grants of permission corresponding to one or more first objects, respectively, wherein the one or more first objects comprise only a subset of objects of a datastore, wherein the one or more grants of permission are by a user of the datastore; generate an access control entry for a second object of the objects using at least one of the identified grants of permission, wherein the second object is not exposed to the user; and in responsive to receipt of a query for data corresponding to the objects, determine whether to grant access to the data based on the generated access control entry.

Patent Agency Ranking