EP4182808A1 - Pruning index for optimization of pattern matching queries - Google Patents
Pruning index for optimization of pattern matching queriesInfo
- Publication number
- EP4182808A1 EP4182808A1 EP21841334.2A EP21841334A EP4182808A1 EP 4182808 A1 EP4182808 A1 EP 4182808A1 EP 21841334 A EP21841334 A EP 21841334A EP 4182808 A1 EP4182808 A1 EP 4182808A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- search pattern
- grams
- pruning index
- preprocessing
- fingerprints
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000013138 pruning Methods 0.000 title claims abstract description 133
- 238000005457 optimization Methods 0.000 title description 6
- 238000003860 storage Methods 0.000 claims description 90
- 238000000034 method Methods 0.000 claims description 74
- 238000007781 pre-processing Methods 0.000 claims description 43
- 238000012545 processing Methods 0.000 claims description 33
- 230000015654 memory Effects 0.000 claims description 22
- 238000005192 partition Methods 0.000 description 95
- 238000013500 data storage Methods 0.000 description 42
- 238000004891 communication Methods 0.000 description 30
- 230000008569 process Effects 0.000 description 26
- 238000010586 diagram Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 9
- 244000141353 Prunus domestica Species 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 8
- 230000008878 coupling Effects 0.000 description 7
- 238000010168 coupling process Methods 0.000 description 7
- 238000005859 coupling reaction Methods 0.000 description 7
- 230000035620 dolor Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 241000544061 Cuculus canorus Species 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 3
- 238000010606 normalization Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000013475 authorization Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 239000000284 extract Substances 0.000 description 2
- 229910000078 germane Inorganic materials 0.000 description 2
- 230000005291 magnetic effect Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 239000000523 sample Substances 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000002730 additional effect Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 238000005056 compaction Methods 0.000 description 1
- 238000007596 consolidation process Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000003116 impacting effect Effects 0.000 description 1
- 150000002500 ions Chemical class 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000000116 mitigating effect Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000005096 rolling process Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000026676 system process Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/221—Column-oriented storage; Management thereof
Definitions
- Embodiments of the disclosure relate generally to databases and, more specifically, to generating and using pruning indexes to optimize processing of pattern matching queries in a database system.
- Databases are widely used for data storage and access in computing applications.
- a goal of database storage is to provide enormous sums of information in an organized manner so that it can be accessed, managed, and updated.
- data may be organized into rows, columns, and tables.
- Databases are used by various entities and companies for storing information that may need to be accessed or analyzed.
- a query statement may be executed against the database data.
- a database system processes the query and returns certain data according to one or more query predicates that indicate what information should be returned by the query.
- the database system extracts specific data from the database and formats that data into a readable form.
- it can be challenging to execute queries on a very large table because a significant amount of time and computing resources are required to scan an entire table to identify data that satisfies the query.
- FIG. 1 illustrates an example computing environment that includes a network-based database system in communication with a cloud storage provider system, in accordance with some embodiments of the present disclosure.
- FIG. 2 is a block diagram illustrating components of a compute service manager, in accordance with some embodiments of the present disclosure.
- FIG. 3 is a block diagram illustrating components of an execution platform, in accordance with some embodiments of the present disclosure.
- FIG. 4 is a conceptual diagram illustrating generation of an example blocked bloom filter, which may form part of a pruning index, in accordance with some example embodiments.
- FIG. 5 illustrates a portion of an example pruning index, in accordance with some embodiments of the present disclosure.
- FIG. 6 is a conceptual diagram illustrating further details regarding the creation of an example pruning index, in accordance with some embodiments.
- FIG. 7 is a conceptual diagram illustrating maintenance of a pruning index, in accordance with some embodiments.
- FIGS. 8-10 are flow diagrams illustrating operations of the network- based database system in performing a method for generating and using a pruning index in processing a database query, in accordance with some embodiments of the present disclosure.
- FIG. 11 illustrates a diagrammatic representation of a machine in the form of a computer system within which a set of instructions may be executed for causing the machine to perform any one or more of the methodologies discussed herein, in accordance with some embodiments of the present disclosure.
- a large source table may be organized into a set of batch units such as micro-partitions, and a pruning index can be created for the source table to be used in identifying a subset of the batch units to scan to identify data that satisfies the query.
- a “micro-partition” is a batch unit, and each micro-partition has contiguous units of storage.
- each micro partition may contain between 50 MB and 500 MB of uncompressed data (note that the actual size in storage may be smaller because data may be stored compressed).
- Groups of rows in tables may be mapped into individual micro partitions organized in a columnar fashion. This size and structure allow for extremely granular selection of the micro-partitions to be scanned, which can be comprised of millions, or even hundreds of millions, of micro-partitions.
- Pruning involves using metadata to determine which portions of a table, including which micro-partitions or micro-partition groupings in the table, are not pertinent to a query, and then avoiding those non-pertinent micro partitions when responding to the query and scanning only the pertinent micro partitions to respond to the query. Metadata may be automatically gathered about all rows stored in a micro-partition, including: the range of values for each of the columns in the micro-partition; the number of distinct values; and/or additional properties used for both optimization and efficient query processing. In one embodiment, micro-partitioning may be automatically performed on all tables.
- tables may be transparently partitioned using the ordering that occurs when the data is inserted/loaded.
- this disclosure of the micro-partition is exemplary only and should be considered non-limiting. It should be appreciated that the micro-partition may include other database storage devices without departing from the scope of the disclosure.
- a network-based database system generates a pruning index for a source table and uses the pruning index to prune micro-partitions of the source table when processing queries directed to the source table.
- the pruning index includes a probabilistic data structure that stores fingerprints for all searchable values in a source table. The fingerprints are based on a hash computed over N-grams of preprocessed variants of each searchable value in the source table.
- the data values in the source table can be case-sensitive strings and the strings can be normalized to case-agnostic variants (e.g., by making all characters lower case) before computing the fingerprints.
- multiple variants of a particular string can be determined to account for common or acceptable misspellings of search terms before computing the fingerprints for the string.
- multiple variants of a particular string can be determined based on synonyms of the string before computing fingerprints for the string.
- Fingerprints are computed for all N-grams of each preprocessed variant of a searchable value. For a given data value, the database system generates a set of N-grams by breaking the data value into multiple segments of equal length. In an example, the value of N is three and the searchable value is “solution.” In this example, database system computes fingerprints for “sol”, “olu”, “lut,” “uti”, “tio”, and “ion”.
- the network-based database system In generating a pruning index, the network-based database system generates a filter for each micro-partition of the source table that indexes distinct N-grams in each column of the micro-partition of the source table.
- the filter may, for example, comprise a blocked bloom filter, a bloom filter, a hash filter, or a cuckoo filter.
- the pruning index can be used to quickly disqualify micro-partitions that are certain to not include data that satisfies the query.
- the network-based database system probes the pruning index to identify a reduced scan set of micro-partitions comprising only a subset of the micro-partitions of the source table, and only the reduced scan set of micro-partitions is scanned when executing the query.
- pattern matching predicates e.g, LIKE, ILIKE, CONTAINS, STARTSWITH, ENDSWITH, etc.
- the database system uses the pruning index to identify a set of micro-partitions to scan for data that matches a specified search pattern, which can include one or more partial strings and one or more wildcards (e.g, “%” or ) used to represent wildcard character positions in the pattern (e.g, character positions whose underlying value unconstrained by the query).
- a pruning index By using a pruning index to prune the set of micro-partitions to scan in executing a query, the database system accelerates the execution of point queries on large tables when compared to conventional methodologies. Using a pruning index in this manner also guarantees a constant overhead for every searchable value on the table. Additional benefits of pruning index utilization include, but are not limited to, an ability to support multiple predicate types, an ability to quickly compute the number of distinct values in a table, and the ability to support join pruning.
- FIG. 1 illustrates an example computing environment 100 that includes a database system 102 in communication with a storage platform 104, in accordance with some embodiments of the present disclosure.
- a database system 102 in communication with a storage platform 104
- FIG. 1 illustrates an example computing environment 100 that includes a database system 102 in communication with a storage platform 104, in accordance with some embodiments of the present disclosure.
- various functional components that are not germane to conveying an understanding of the inventive subject matter have been omitted from FIG. 1.
- additional functional components may be included as part of the computing environment 100 to facilitate additional functionality that is not specifically described herein.
- the computing environment 100 comprises the database system 102 and a storage platform 104 (e.g., AWS ® , Microsoft Azure Blob Storage ® , or Google Cloud Storage ® ).
- the database system 102 is used for reporting and analysis of integrated data from one or more disparate sources including storage devices 106-1 to 106-N within the storage platform 104.
- the storage platform 104 comprises a plurality of computing machines and provides on-demand computer system resources such as data storage and computing power to the database system 102.
- the database system 102 comprises a compute service manager 108, an execution platform 110, and a database 114.
- the database system 102 hosts and provides data reporting and analysis services to multiple client accounts. Administrative users can create and manage identities (e.g., users, roles, and groups) and use permissions to allow or deny access to the identities to resources and services.
- the compute service manager 108 coordinates and manages operations of the database system 102.
- the compute service manager 108 also performs query optimization and compilation as well as managing clusters of computing services that provide compute resources (also referred to as “virtual warehouses”).
- the compute service manager 108 can support any number of client accounts such as end users providing data storage and retrieval requests, system administrators managing the systems and methods described herein, and other components/devices that interact with compute service manager 108.
- the compute service manager 108 is also in communication with a user device 112.
- the user device 112 corresponds to a user of one of the multiple client accounts supported by the database system 102.
- the compute service manager 108 does not receive any direct communications from the user device 112 and only receives communications concerning jobs from a queue within the database system 102.
- the compute service manager 108 is also coupled to database 114, which is associated with the data stored in the computing environment 100.
- the database 114 stores data pertaining to various functions and aspects associated with the database system 102 and its users.
- the database 114 includes a summary of data stored in remote data storage systems as well as data available from a local cache. Additionally, the database 114 may include information regarding how data is organized in remote data storage systems (e.g., the storage platform 104) and the local caches.
- the database 114 allows systems and services to determine whether a piece of data needs to be accessed without loading or accessing the actual data from a storage device.
- the database 114 can include one or more pruning indexes.
- the compute service manager 108 may generate a pruning index for each source table accessed from the storage platform 104 and use a pruning index to prune the set of micro-partitions of a source table to scan for data in executing a query. That is, given a query directed at a source table organized into a set of micro-partitions, the computing service manger 108 can access a pruning index from the database 114 and use the pruning index to identify a reduced set of micro-partitions to scan in executing the query.
- the set of micro-partitions to scan in executing a query may be referred to herein as a “scan set.”
- the compute service manager 108 may determine that a job should be performed based on data from the database 114.
- the compute service manager 108 may scan the data and determine that a job should be performed to improve data organization or database performance. For example, the compute service manager 108 may determine that a new version of a source table has been generated and the pruning index has not been refreshed to reflect the new version of the source table.
- the database 114 may include a transactional change tracking stream indicating when the new version of the source table was generated and when the pruning index was last refreshed. Based on that transaction stream, the compute service manager 108 may determine that a job should be performed.
- the compute service manager 108 determines that a job should be performed based on a trigger event and stores the job in a queue until the compute service manager 108 is ready to schedule and manage the execution of the job. In an embodiment of the disclosure, the compute service manager 108 determines whether a table or pruning index needs to be reclustered based on one or more DML commands being performed, wherein one or more of DML commands constitute the trigger event.
- the compute service manager 108 is further coupled to the execution platform 110, which provides multiple computing resources that execute various data storage and data retrieval tasks.
- the execution platform 110 is coupled to storage platform 104 of the storage platform 104.
- the storage platform 104 comprises multiple data storage devices 106-1 to 106-N.
- the data storage devices 106-1 to 106-N are cloud-based storage devices located in one or more geographic locations.
- the data storage devices 106- 1 to 106-N may be part of a public cloud infrastructure or a private cloud infrastructure.
- the data storage devices 106-1 to 106-N may be hard disk drives (HDDs), solid state drives (SSDs), storage clusters, Amazon S3TM storage systems or any other data storage technology.
- the storage platform 104 may include distributed file systems (e.g., Hadoop Distributed File Systems (HDFS)), object storage systems, and the like.
- HDFS Hadoop Distributed File Systems
- the execution platform 110 comprises a plurality of compute nodes.
- a set of processes on a compute node executes a query plan compiled by the compute service manager 108.
- the set of processes can include: a first process to execute the query plan; a second process to monitor and delete micro-partition files using a least recently used (LRU) policy and implement an out of memory (OOM) error mitigation process; a third process that extracts health information from process logs and status to send back to the compute service manager 108; a fourth process to establish communication with the compute service manager 108 after a system boot; and a fifth process to handle all communication with a compute cluster for a given job provided by the compute service manager 108 and to communicate information back to the compute service manager 108 and other compute nodes of the execution platform 110.
- LRU least recently used
- OOM out of memory
- communication links between elements of the computing environment 100 are implemented via one or more data communication networks. These data communication networks may utilize any communication protocol and any type of communication medium. In some embodiments, the data communication networks are a combination of two or more data communication networks (or sub-networks) coupled to one another. In alternate embodiments, these communication links are implemented using any type of communication medium and any communication protocol.
- the data storage devices 106-1 to 106-N are decoupled from the computing resources associated with the execution platform 110.
- This architecture supports dynamic changes to the database system 102 based on the changing data storage/retrieval needs as well as the changing needs of the users and systems.
- the support of dynamic changes allows the database system 102 to scale quickly in response to changing demands on the systems and components within the database system 102.
- the decoupling of the computing resources from the data storage devices supports the storage of large amounts of data without requiring a corresponding large amount of computing resources.
- this decoupling of resources supports a significant increase in the computing resources utilized at a particular time without requiring a corresponding increase in the available data storage resources.
- the compute service manager 108, database 114, execution platform 110, and storage platform 104 are shown in FIG. 1 as individual discrete components. However, each of the compute service manager 108, database 114, execution platform 110, and storage platform 104 may be implemented as a distributed system (e.g., distributed across multiple systems/platforms at multiple geographic locations). Additionally, each of the compute service manager 108, database 114, execution platform 110, and storage platform 104 can be scaled up or down (independently of one another) depending on changes to the requests received and the changing needs of the database system 102. Thus, in the described embodiments, the database system 102 is dynamic and supports regular changes to meet the current data processing needs.
- the database system 102 processes multiple jobs determined by the compute service manager 108. These jobs are scheduled and managed by the compute service manager 108 to determine when and how to execute the job. For example, the compute service manager 108 may divide the job into multiple discrete tasks and may determine what data is needed to execute each of the multiple discrete tasks. The compute service manager 108 may assign each of the multiple discrete tasks to one or more nodes of the execution platform 110 to process the task. The compute service manager 108 may determine what data is needed to process a task and further determine which nodes within the execution platform 110 are best suited to process the task. Some nodes may have already cached the data needed to process the task and, therefore, be a good candidate for processing the task.
- Metadata stored in the database 114 assists the compute service manager 108 in determining which nodes in the execution platform 110 have already cached at least a portion of the data needed to process the task.
- One or more nodes in the execution platform 110 process the task using data cached by the nodes and, if necessary, data retrieved from the storage platform 104. It is desirable to retrieve as much data as possible from caches within the execution platform 110 because the retrieval speed is typically much faster than retrieving data from the storage platform 104.
- the computing environment 100 separates the execution platform 110 from the storage platform 104.
- the processing resources and cache resources in the execution platform 110 operate independently of the data storage devices 106-1 to 106-N in the storage platform 104.
- the computing resources and cache resources are not restricted to specific data storage devices 106-1 to 106-N. Instead, all computing resources and all cache resources may retrieve data from, and store data to, any of the data storage resources in the storage platform 104.
- FIG. 2 is a block diagram illustrating components of the compute service manager 108, in accordance with some embodiments of the present disclosure.
- the compute service manager 108 includes an access manager 202 and a key manager 204 coupled to a data storage device 206.
- Access manager 202 handles authentication and authorization tasks for the systems described herein.
- Key manager 204 manages storage and authentication of keys used during authentication and authorization tasks.
- access manager 202 and key manager 204 manage the keys used to access data stored in remote storage devices (e.g., data storage devices in storage platform 104).
- the remote storage devices may also be referred to as “persistent storage devices” or “shared storage devices.”
- a request processing service 208 manages received data storage requests and data retrieval requests (e.g., jobs to be performed on database data). For example, the request processing service 208 may determine the data necessary to process a received query (e.g., a data storage request or data retrieval request). The data may be stored in a cache within the execution platform 110 or in a data storage device in storage platform 104.
- a management console service 210 supports access to various systems and processes by administrators and other system managers. Additionally, the management console service 210 may receive a request to execute a job and monitor the workload on the system.
- the compute service manager 108 also includes a job compiler 212, a job optimizer 214 and a job executor 216.
- the job compiler 212 parses a job into multiple discrete tasks and generates the execution code for each of the multiple discrete tasks.
- the job optimizer 214 determines the best method to execute the multiple discrete tasks based on the data that needs to be processed.
- the job optimizer 214 also handles various data pruning operations and other data optimization techniques to improve the speed and efficiency of executing the job.
- the job executor 216 executes the execution code for jobs received from a queue or determined by the compute service manager 108.
- a j ob scheduler and coordinator 218 sends received j obs to the appropriate services or systems for compilation, optimization, and dispatch to the execution platform 110.
- jobs may be prioritized and processed in that prioritized order.
- the job scheduler and coordinator 218 determines a priority for internal jobs that are scheduled by the compute service manager 108 with other “outside” jobs such as user queries that may be scheduled by other systems in the database but may utilize the same processing resources in the execution platform 110.
- the job scheduler and coordinator 218 identifies or assigns particular nodes in the execution platform 110 to process particular tasks.
- a virtual warehouse manager 220 manages the operation of multiple virtual warehouses implemented in the execution platform 110. As discussed below, each virtual warehouse includes multiple execution nodes that each include a cache and a processor.
- the compute service manager 108 includes a configuration and metadata manager 222, which manages the information related to the data stored in the remote data storage devices and in the local caches (e.g., the caches in execution platform 110).
- the configuration and metadata manager 222 uses the metadata to determine which data micro-partitions need to be accessed to retrieve data for processing a particular task or job.
- a monitor and workload analyzer 224 oversee processes performed by the compute service manager 108 and manages the distribution of tasks (e.g., workload) across the virtual warehouses and execution nodes in the execution platform 110.
- the monitor and workload analyzer 224 also redistribute tasks, as needed, based on changing workloads throughout the database system 102 and may further redistribute tasks based on a user (e.g., “external”) query workload that may also be processed by the execution platform 110.
- the configuration and metadata manager 222 and the monitor and workload analyzer 224 are coupled to a data storage device 226.
- Data storage device 226 in FIG. 2 represents any data storage device within the database system 102.
- data storage device 226 may represent caches in execution platform 110, storage devices in storage platform 104, or any other storage device.
- the compute service manager 108 further includes a pruning index generator 228.
- the pruning index generator 228 is responsible for generating pruning indexes to be used in pruning scan sets for queries directed to tables stored in the storage platform 104.
- Each pruning index comprises a set of filters (e.g., blocked bloom filters, bloom filters, hash filter, or cuckoo filters) that encode an existence of unique N-grams in each column of a source table.
- the pruning index generator 228 generates a filter for each micro-partition of a source table and each filter indicates whether data matching a query is potentially stored on a particular micro-partition of the source table. Further details regarding the generation of pruning indexes are discussed below.
- FIG. 3 is a block diagram illustrating components of the execution platform 110, in accordance with some embodiments of the present disclosure.
- the execution platform 110 includes multiple virtual warehouses, including virtual warehouse 1, virtual warehouse 2, and virtual warehouse n.
- Each virtual warehouse includes multiple execution nodes that each includes a data cache and a processor.
- the virtual warehouses can execute multiple tasks in parallel by using the multiple execution nodes.
- the execution platform 110 can add new virtual warehouses and drop existing virtual warehouses in real-time based on the current processing needs of the systems and users. This flexibility allows the execution platform 110 to quickly deploy large amounts of computing resources when needed without being forced to continue paying for those computing resources when they are no longer needed.
- All virtual warehouses can access data from any data storage device (e.g., any storage device in storage platform 104).
- each virtual warehouse shown in FIG. 3 includes three execution nodes, a particular virtual warehouse may include any number of execution nodes. Further, the number of execution nodes in a virtual warehouse is dynamic, such that new execution nodes are created when additional demand is present, and existing execution nodes are deleted when they are no longer necessary.
- Each virtual warehouse is capable of accessing any of the data storage devices 106-1 to 106-N shown in FIG. 1.
- the virtual warehouses are not necessarily assigned to a specific data storage device 106-1 to 106-n and, instead, can access data from any of the data storage devices 106-1 to 106-N within the storage platform 104.
- each of the execution nodes shown in FIG. 3 can access data from any of the data storage devices 106-1 to 106-N.
- a particular virtual warehouse or a particular execution node may be temporarily assigned to a specific data storage device, but the virtual warehouse or execution node may later access data from any other data storage device.
- virtual warehouse 1 includes three execution nodes 302-1, 302-2, and 302-n.
- Execution node 302-1 includes a cache 304-1 and a processor 306-1.
- Execution node 302-2 includes a cache 304- 2 and a processor 306-2.
- Execution node 302-n includes a cache 304-n and a processor 306-n.
- Each execution node 302-1, 302-2, and 302-n is associated with processing one or more data storage and/or data retrieval tasks.
- a virtual warehouse may handle data storage and data retrieval tasks associated with an internal service, such as a clustering service, a materialized view refresh service, a file compaction service, a storage procedure service, or a file upgrade service.
- a particular virtual warehouse may handle data storage and data retrieval tasks associated with a particular data storage system or a particular category of data.
- virtual warehouse 2 includes three execution nodes 312-1, 312-2, and 312-n.
- Execution node 312-1 includes a cache 314-1 and a processor 316-1.
- Execution node 312-2 includes a cache 314-2 and a processor 316-2.
- Execution node 312-n includes a cache 314- n and a processor 316-n.
- virtual warehouse 3 includes three execution nodes 322-1, 322-2, and 322-n.
- Execution node 322-1 includes a cache 324-1 and a processor 326-1.
- Execution node 322-2 includes a cache 324- 2 and a processor 326-2.
- Execution node 322-n includes a cache 324-n and a processor 326-n.
- the execution nodes shown in FIG. 3 are stateless with respect to the data the execution nodes are caching. For example, these execution nodes do not store or otherwise maintain state information about the execution node or the data being cached by a particular execution node.
- the failed node can be transparently replaced by another node. Since there is no state information associated with the failed execution node, the new (replacement) execution node can easily replace the failed node without concern for recreating a particular state.
- the execution nodes shown in FIG. 3 each includes one data cache and one processor
- alternate embodiments may include execution nodes containing any number of processors and any number of caches.
- the caches may vary in size among the different execution nodes.
- the caches shown in FIG. 3 store, in the local execution node, data that was retrieved from one or more data storage devices in storage platform 104.
- the caches reduce or eliminate the bottleneck problems occurring in platforms that consistently retrieve data from remote storage systems. Instead of repeatedly accessing data from the remote storage devices, the systems and methods described herein access data from the caches in the execution nodes, which is significantly faster and avoids the bottleneck problem discussed above.
- the caches are implemented using high-speed memory devices that provide fast access to the cached data. Each cache can store data from any of the storage devices in the storage platform 104.
- the cache resources and computing resources may vary between different execution nodes. For example, one execution node may contain significant computing resources and minimal cache resources, making the execution node useful for tasks that require significant computing resources. Another execution node may contain significant cache resources and minimal computing resources, making this execution node useful for tasks that require caching of large amounts of data. Yet another execution node may contain cache resources providing faster input-output operations, useful for tasks that require fast scanning of large amounts of data. In some embodiments, the cache resources and computing resources associated with a particular execution node are determined when the execution node is created, based on the expected tasks to be performed by the execution node.
- the cache resources and computing resources associated with a particular execution node may change over time based on changing tasks performed by the execution node. For example, an execution node may be assigned more processing resources if the tasks performed by the execution node become more processor-intensive. Similarly, an execution node may be assigned more cache resources if the tasks performed by the execution node require a larger cache capacity.
- virtual warehouses 1, 2, and n are associated with the same execution platform 110, the virtual warehouses may be implemented using multiple computing systems at multiple geographic locations.
- virtual warehouse 1 can be implemented by a computing system at a first geographic location, while virtual warehouses 2 and n are implemented by another computing system at a second geographic location.
- these different computing systems are cloud-based computing systems maintained by one or more different entities.
- each virtual warehouse is shown in FIG. 3 as having multiple execution nodes.
- the multiple execution nodes associated with each virtual warehouse may be implemented using multiple computing systems at multiple geographic locations.
- an instance of virtual warehouse 1 implements execution nodes 302-1 and 302-2 on one computing platform at a geographic location and implements execution node 302-n at a different computing platform at another geographic location.
- Selecting particular computing systems to implement an execution node may depend on various factors, such as the level of resources needed for a particular execution node (e.g., processing resource requirements and cache requirements), the resources available at particular computing systems, communication capabilities of networks within a geographic location or between geographic locations, and which computing systems are already implementing other execution nodes in the virtual warehouse.
- Execution platform 110 is also fault tolerant. For example, if one virtual warehouse fails, that virtual warehouse is quickly replaced with a different virtual warehouse at a different geographic location.
- a particular execution platform 110 may include any number of virtual warehouses. Additionally, the number of virtual warehouses in a particular execution platform is dynamic, such that new virtual warehouses are created when additional processing and/or caching resources are needed. Similarly, existing virtual warehouses may be deleted when the resources associated with the virtual warehouse are no longer necessary.
- the virtual warehouses may operate on the same data in storage platform 104, but each virtual warehouse has its own execution nodes with independent processing and caching resources. This configuration allows requests on different virtual warehouses to be processed independently and with no interference between the requests. This independent processing, combined with the ability to dynamically add and remove virtual warehouses, supports the addition of new processing capacity for new users without impacting the performance observed by the existing users.
- FIG. 4 is a conceptual diagram illustrating generation of a filter 400, which forms part of a pruning index generated by the database system 102 based on a source table 402, in accordance with some example embodiments.
- the source table 402 is organized into multiple micro-partitions and each micro-partition comprises multiple columns in which values are stored.
- the compute service manager 108 In generating a pruning index, the compute service manager 108 generates a filter for each micro-partition of the source table 402, an example of which is illustrated in FIG. 4 as blocked bloom filter 400.
- Blocked bloom filter 400 comprises multiple bloom filters and encodes the existence of distinct N- grams present in each column of the corresponding micro-partition.
- the database system 102 probes the pruning index to identify a reduced scan set of micro-partitions comprising only a subset of the micro-partitions of the source table 402.
- the blocked bloom filter 400 is decomposed into N bloom filters stored as individual columns of the pruning index to leverage columnar scans.
- N-grams of stored values or preprocessed variants thereof are transformed into bit positions in the bloom filters.
- a set of fingerprints e.g., hash values
- the set of fingerprints may be used to set bits in the bloom filters.
- Each line of the blocked bloom filter 400 is encoded and stored as a single row in the pruning index.
- Each bloom filter 400 is represented in the pruning index as a two-dimensional array indexed by the fingerprints of the N-grams of the stored column values.
- FIG. 5 illustrates a portion of an example pruning index 500, in accordance with some embodiments of the present disclosure.
- the example pruning index 500 is organized into a plurality of rows and columns.
- the columns of the pruning index 500 comprise a partition number 502 to store a partition identifier and a blocked bloom filter 504 (e.g., the blocked bloom filter 400) that is decomposed into multiple numeric columns, each column in the blocked bloom filter 504 represents a bloom filter.
- a blocked bloom filter 504 e.g., the blocked bloom filter 400
- FIG. 6 is a conceptual diagram illustrating creation of an example pruning index, in accordance with some embodiments.
- the creation of a filter (e.g., a blocked bloom filter) is performed by a specialized operator within the compute service manager 108 that computes the set of rows of the pruning index. This operator obtains all the columns of a particular micro-partition of a source table and populates the filter for that micro-partition.
- the compute service manager 108 allocates a maximum number of levels to the pruning index, populates each filter and then applies a consolidation phase to merge the different filters in a final representation of the pruning index.
- the memory allocated to compute this information per micro-partition is constant.
- the memory allocated to compute this information is a two-dimensional array of unsigned integers. The first dimension is indexed by the level (maximum number of levels) and the second dimension is indexed by the number of bloom filters. Since each partition is processed by a single thread, the total memory is bounded by the number of threads (e.g., 8) and the maximum level of levels.
- the compute service manager 108 combines blocks based on a target bloom filter density.
- the compute service manager 108 may combine blocks such that the bloom filter density is no more than half. Since the domain of fingerprints (e.g., hashed values) is uniform, this can be done incrementally or globally based on the observed number of distinct values computed above.
- the compute service manager 108 determines the number of levels for the pruning index by dividing the maximum number of distinct N-grams by the number of distinct N-grams per level. To combine two levels, the compute service manager 108 performs a logical OR on all the integers representing the filter.
- the filter functions can combine two hash functions (e.g., two 32-bit hash functions). Both the hash function computation and the filter derivation need to be identical on both the execution platform 110 and compute service manager 108 to allow for pruning in compute service manager 108 and in the scan set initialization in the execution platform 110.
- FIG. 7 is a conceptual diagram illustrating maintenance of a pruning index based on changes to a source table, in accordance with some embodiments.
- a change is made to a source table (e.g., addition of one or more rows or columns).
- the change to the source table triggers generation of additional rows in the pruning index for each changed or new micro-partition of the source table, at 702.
- the newly produced rows in the pruning index are reclustered, at 704.
- the compute service manager 108 uses a deterministic selection algorithm as part of clustering the prune index.
- the processing of each micro partition in the source table creates a bounded (and mostly constant) number of rows based on the number of distinct N-grams in the source micro-partition. By construction, those rows are known to be unique and the index domain is non overlapping for that partition and fully overlapping with already clustered index rows.
- the compute service manager 108 delays reclustering of rows until a threshold number of rows have been produced to create constant partitions.
- the pruning index is described in some embodiments as being implemented specifically with blocked bloom filters, it shall be appreciated that the pruning index is not limited to blocked bloom filters, and in other embodiments, the pruning index may be implemented using other filters such as bloom filters, hash filters, or cuckoo filters.
- FIGS. 8-11 are flow diagrams illustrating operations of the database system 102 in performing a method 800 for generating and using a pruning index in processing a database query, in accordance with some embodiments of the present disclosure.
- the method 800 may be embodied in computer-readable instructions for execution by one or more hardware components (e.g., one or more processors) such that the operations of the method 800 may be performed by components of database system 102. Accordingly, the method 800 is described below, by way of example with reference thereto. However, it shall be appreciated that the method 800 may be deployed on various other hardware configurations and is not intended to be limited to deployment within the database system 102.
- an operation of the method 800 may be repeated in different ways or involve intervening operations not shown. Though the operations of the method 800 may be depicted and described in a certain order, the order in which the operations are performed may vary among embodiments, including performing certain operations in parallel or performing sets of operations in separate processes. For example, although the use and generation of the pruning index are described and illustrated together as part of the method 800, it shall be appreciated that the use and generation of the pruning index may be performed as separate processes, consistent with some embodiments.
- the compute service manager 108 accesses a source table that is organized into a plurality of micro-partitions.
- the source table comprises a plurality of cells organized into rows and columns and a data value is included in each cell.
- the compute service manager 108 generates a pruning index based on the source table.
- the pruning index comprises a set of filters (e.g., a set of blocked bloom filters) that index distinct N-grams in each column of each micro-partition of the source table.
- a filter is generated for each micro-partition in the source table and each filter is decomposed into multiple numeric columns (e.g., 32 numeric columns) to enable integer comparisons.
- the pruning index comprises a plurality of rows and each row comprises at least a micro-partition identifier and a set of bloom filters.
- the compute service manager 108 generates the pruning index in an offline process before receiving a query.
- the compute service manager 108 receives a query directed at the source table.
- a pattern matching predicate e.g., LIKE, ILIKE, CONTAINS, STARTSWITH, or ENDSWITH.
- the query specifies a search pattern for which matching stored data in the source table is to be identified.
- the compute service manager 108 accesses the pruning index associated with the source table based on the query being directed at the source table.
- the database 114 may store information describing associations between tables and pruning indexes.
- the compute service manager 108 uses the pruning index to prune the set of micro-partitions of the source table to be scanned for data that satisfies the query (e.g., a data value that satisfies the equality predicate or data that matches the search pattern). That is, the compute service manager 108 uses the pruning index to identify a reduced scan set comprising only a subset of the micro-partitions of the source table.
- the reduced scan set includes one or more micro-partitions in which data that satisfies the query is potentially stored.
- the subset of micro-partitions of the source table include micro partitions determined to potentially include data that satisfies the query based on the set of bloom filters in the pruning index.
- the execution platform 110 to process the query.
- the execution platform 110 scans the subset of micro partitions of the reduced scan set while foregoing a scan of the remaining micro partitions. In this way, the execution platform 110 searches only micro-partitions where matching data is potentially stored while foregoing an expenditure of additional time and resources to also search the remaining micro-partitions for which it is known, based on the pruning index, that matching data is not stored.
- the compute service manager 108 may instead identify and compile a set of non-matching micro-partitions.
- the compute service manager 108 or the execution platform 110 may remove micro-partitions from the scan set based on the set of non matching micro-partitions.
- the method 800 may, in some embodiments, further include operations 905 and 910. Consistent with these embodiments, the operations 905 and 910 may be performed as part of the operation 810 where the compute service manager 108 generates the pruning index.
- the operations 905 and 910 are described below in reference to a single micro-partition of the source table simply for ease of explanation. However, it shall be appreciated, that in generating the pruning index, the compute service manager 108 generates a filter for each micro-partitions of the source table and thus, the operations 905 and 910 may be performed for each micro-partition of the source table.
- the compute service manager 108 generates a filter for a micro-partition of the source table.
- the compute service manager 108 may generate a blocked bloom filter for the micro-partition that indexes distinct N-grams in each column of the micro-partition of the source table.
- the generating of the filter includes generating a set of fingerprints for each searchable data value in the micro-partition.
- the compute service manager 108 For a given data value in the micro-partition, the compute service manager 108 generates the set of fingerprints based on a set of N-grams generated for the data value.
- the set of N- grams can be generated based on the data value or one or more preprocessed variants of the data value.
- the compute service manager 108 can generate a fingerprint based on a hash that is computer of an N-gram.
- the compute service manager 108 may utilize a rolling hash function or other known hashing scheme that allows individual characters to be added or removed from a window of characters. Each generated fingerprint is used to populate a cell in the filter.
- the compute service manager 108 merges one or more rows of the filter.
- the compute service manager 108 can merge rows by performing a logical OR operation.
- the compute service manager 108 may merge rows of the filter until a density threshold is reached, where the density refers to the ratio of l’s and 0’s in a row.
- the density threshold may be based on a target false positive rate.
- the method 800 may, in some embodiments, include operations 1005, 1010, 1015, 1020, and 1025. Consistent with these embodiments, the operations 1005 and 1010 may be performed prior to operation 810 where the compute service manager 108 generates the pruning index for the source table.
- the compute service manager 108 preprocesses the data values in the cells of the source table. In preprocesses a given data value, the compute service manager 108 generates one or more preprocessed variants of the data value. In performing the preprocessing, the compute service manager performs one or more normalization operations to a given data value.
- the compute service manager 108 can utilize one of several known normalization techniques to normalize data values (e.g., normalization form canonical composition).
- the preprocessing performed by the compute service manager 108 can include, for example, any one or more of: generating a case-agnostic variant, (e.g., by converting uppercase characters to lowercase characters), generating one or more misspelled variants based on common or acceptable misspellings of the data value, and generating one or more synonymous variants corresponding to synonyms of the data value.
- the compute service manager 108 uses a common knowledge base to transform a data value into one or more permutations of the original data value.
- the string “Bob” can be transformed into to the case-agnostic variant “bob.”
- the preprocessed variants of “bob” “bbo” and “obb” can be generated for the string “Bob” to account for misspellings.
- the compute service manager 108 generates a set of N-grams for each preprocessed variant.
- An N-gram in this context refers to a contiguous sequence of N-items (e.g., characters or words) in a given value.
- the compute service manager 108 transforms the value into multiple segments of equal length. For example, for a string, the compute service manager 108 can transform the string into multiple sub-strings of N-characters.
- the value of N can be predetermined or dynamically computed at the time of generating the pruning index. In embodiments in which the value of N is precomputed, the compute service manager 108 determines an optimal value for N based on a data types of values in the source table. In some embodiments, multiple values of N can be used.
- a first subset of N-grams can be generated using a first value for N and a second subset of N-grams can be created using a second value of N.
- the operations 1015 and 1020 can be performed prior to operation 820 where the compute service manager 108 prunes the scan set using the pruning index.
- the compute service manager 108 preprocesses a search pattern included in the query. In preprocessing the search pattern, the compute service manager 108 performs the same preprocessing operations that are performed on the data values in the source table at 1005 to ensure that the characters of the search pattern fit the pruning index.
- the compute service manager 108 can perform any one or more of: generating a case-agnostic variant of the search pattern (e.g., by converting uppercase characters to lowercase characters), generating one or more misspelled variants based on common or acceptable misspellings of the search pattern, generating one or more synonymous variants corresponding to synonyms of the search pattern, and generating a variant that include special characters to mark a start and end of the search pattern.
- the compute service manager 108 can generate one or more preprocessed variants of the search pattern.
- the compute service manager 108 can generate any one or more of: a case-agnostic variant, misspelled variant, or a synonymous variant for the search pattern.
- the compute service manager 108 can generate a variant that includes special characters to indicate a start and end of a search pattern (e.g., “ A testvalue$” for the search pattern “testvalue”).
- the compute service manager 108 generates a set of N-grams for the search pattern based on the one or more preprocessed variants of the search pattern.
- the compute service manager 108 uses the same value for N that was used to generate the pruning index. In embodiments in which the compute service manager 108 uses multiple values for N in generating the pruning index, the compute service manager 108 uses the same values for generating the set of N-grams for the search pattern.
- the query includes the following statement:
- '%LoremIpsum%Dolor%Sit%Amef is the search pattern and in preprocessing the search pattern, the compute service manager 108 converts the search pattern to all lower case to create a case-agnostic variant: '%loremipsum%dolor%sit%amef .
- the compute service manager 108 splits the search pattern into segments at the wild card positions, which, in this example, produces the following sub-strings: “loremipsum”, “dolor”, “sit”, and “amet”. Based on these sub-strings, the compute service manager 108 generates the following set of N-grams:
- N is 5, and thus the compute service manager 108 discards the sub-strings “sit” and “amet” as their length is less than 5.
- the operation 1025 can be performed as part of the operation 825 where the compute service manager 108 prunes the scan set using the pruning index.
- the compute service manager 108 uses the set of N-grams generated based on the search pattern to identify a subset of micro-portions of the source table to scan based on the pruning index.
- the compute service manager 108 may identify the subset of micro-partitions by generating a set of fingerprints based on the set of N-grams (e.g., by computing a hash for each N-gram), comparing the set of fingerprints to values included in the pruning index (e.g., fingerprints of stored data values in the source table), and identifying one or more values in the pruning index that match one or more fingerprints in the set of fingerprints generated based on the N-grams of the search pattern. Specifically, the compute service manager 108 identifies one or more micro-partitions that potentially store data that satisfies the query based on fingerprints of data values in the pruning index that match fingerprints in the set of fingerprints computed for the search pattern.
- a fingerprint e.g., hash value computed based on an N-gram of a preprocessed stored data value in the source table
- a fingerprint generated from an N-gram of the search pattern indicates that matching data is potentially stored in a corresponding column of the micro-partition because the N-gram generated from the search pattern is stored in the column of the micro partition.
- the corresponding micro-partition can be identified by the compute service manager 108 based on the matching fingerprint in the pruning index.
- the compute service manager 108 uses the pruning index to identify any micro partitions that contain any one of the fingerprints generated from the search pattern N-grams, and from these micro-partitions, the compute service manager 108 then identifies the micro-partitions that contain all of the N-grams. That is, the compute service manager 108 uses the pruning index to identify a subset of micropartions that contain data matching all fingerprints generated based on the N-grams of the search pattern.
- the compute service manager 108 uses the pruning index to determine: a first micro partition and second micro-partition contain data corresponding to fl; the second micro-partition and a third micro-partition that contains data corresponding to f2; and the first, second, and third micro-partition contain data corresponding to f3.
- the compute service manager 108 selects only the second micro partition for scanning based on the second micro-partition containing data that corresponds to all three fingerprints.
- FIG. 11 illustrates a diagrammatic representation of a machine 1100 in the form of a computer system within which a set of instructions may be executed for causing the machine 1100 to perform any one or more of the methodologies discussed herein, according to an example embodiment.
- FIG. 11 shows a diagrammatic representation of the machine 1100 in the example form of a computer system, within which instructions 1116 (e.g., software, a program, an application, an applet, an app, or other executable code) for causing the machine 1100 to perform any one or more of the methodologies discussed herein may be executed.
- the instructions 1116 may cause the machine 1100 to execute any one or more operations of any one or more of the method 800.
- the instructions 1116 may cause the machine 1100 to implement portions of the functionality illustrated in any one or more of FIGs. 4-8.
- the instructions 1116 transform a general, non- programmed machine into a particular machine 1100 (e.g., the compute service manager 108, the execution platform 110, and the data storage devices 206) that is specially configured to carry out any one of the described and illustrated functions in the manner described herein.
- the machine 1100 operates as a standalone device or may be coupled (e.g., networked) to other machines.
- the machine 1100 may operate in the capacity of a server machine or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment.
- the machine 1100 may comprise, but not be limited to, a server computer, a client computer, a personal computer (PC), a tablet computer, a laptop computer, a netbook, a smart phone, a mobile device, a network router, a network switch, a network bridge, or any machine capable of executing the instructions 1116, sequentially or otherwise, that specify actions to be taken by the machine 1100. Further, while only a single machine 1100 is illustrated, the term “machine” shall also be taken to include a collection of machines 1100 that individually or jointly execute the instructions 1116 to perform any one or more of the methodologies discussed herein.
- the machine 1100 includes processors 1110, memory 1130, and input/output (I/O) components 1150 configured to communicate with each other such as via a bus 1102.
- the processors 1110 e.g., a central processing unit (CPU), a reduced instruction set computing (RISC) processor, a complex instruction set computing (CISC) processor, a graphics processing unit (GPU), a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a radio-frequency integrated circuit (RFIC), another processor, or any suitable combination thereof
- the processors 1110 may include, for example, a processor 1112 and a processor 1114 that may execute the instructions 1116.
- processor is intended to include multi -core processors 1110 that may comprise two or more independent processors (sometimes referred to as “cores”) that may execute instructions 1116 contemporaneously.
- FIG. 11 shows multiple processors 1110, the machine 1100 may include a single processor with a single core, a single processor with multiple cores (e.g., a multi-core processor), multiple processors with a single core, multiple processors with multiple cores, or any combination thereof.
- the memory 1130 may include a main memory 1132, a static memory 1134, and a storage unit 1136, all accessible to the processors 1110 such as via the bus 1102.
- the main memory 1132, the static memory 1134, and the storage unit 1136 store the instructions 1116 embodying any one or more of the methodologies or functions described herein.
- the instructions 1116 may also reside, completely or partially, within the main memory 1132, within the static memory 1134, within the storage unit 1136, within at least one of the processors 1110 (e.g., within the processor’s cache memory), or any suitable combination thereof, during execution thereof by the machine 1100.
- the I/O components 1150 include components to receive input, provide output, produce output, transmit information, exchange information, capture measurements, and so on.
- the specific I/O components 1150 that are included in a particular machine 1100 will depend on the type of machine. For example, portable machines such as mobile phones will likely include a touch input device or other such input mechanisms, while a headless server machine will likely not include such a touch input device. It will be appreciated that the I/O components 1150 may include many other components that are not shown in FIG. 11.
- the I/O components 1150 are grouped according to functionality merely for simplifying the following discussion and the grouping is in no way limiting. In various example embodiments, the I/O components 1150 may include output components 1152 and input components 1154.
- the output components 1152 may include visual components (e.g., a display such as a plasma display panel (PDP), a light emitting diode (LED) display, a liquid crystal display (LCD), a projector, or a cathode ray tube (CRT)), acoustic components (e.g., speakers), other signal generators, and so forth.
- visual components e.g., a display such as a plasma display panel (PDP), a light emitting diode (LED) display, a liquid crystal display (LCD), a projector, or a cathode ray tube (CRT)
- acoustic components e.g., speakers
- the input components 1154 may include alphanumeric input components (e.g., a keyboard, a touch screen configured to receive alphanumeric input, a photo- optical keyboard, or other alphanumeric input components), point-based input components (e.g., a mouse, a touchpad, a trackball, a joystick, a motion sensor, or another pointing instrument), tactile input components (e.g., a physical button, a touch screen that provides location and/or force of touches or touch gestures, or other tactile input components), audio input components (e.g., a microphone), and the like.
- alphanumeric input components e.g., a keyboard, a touch screen configured to receive alphanumeric input, a photo- optical keyboard, or other alphanumeric input components
- point-based input components e.g., a mouse, a touchpad, a trackball, a joystick, a motion sensor, or another pointing instrument
- tactile input components e.g., a physical button, a
- the I/O components 1150 may include communication components 1164 operable to couple the machine 1100 to a network 1180 or devices 1170 via a coupling 1182 and a coupling 1172, respectively.
- the communication components 1164 may include a network interface component or another suitable device to interface with the network 1180.
- the communication components 1164 may include wired communication components, wireless communication components, cellular communication components, and other communication components to provide communication via other modalities.
- the devices 1170 may be another machine or any of a wide variety of peripheral devices (e.g., a peripheral device coupled via a universal serial bus (USB)).
- USB universal serial bus
- the machine 1100 may correspond to any one of the compute service manager 108, the execution platform 110, and the devices 1170 may include the data storage device 206 or any other computing device described herein as being in communication with the network-based data warehouse system 102 or the storage platform 104.
- Example l is a database system comprising: at least one hardware processor; and at least one memory storing instructions that cause the at least one hardware processor to perform operations comprising: receiving a query directed at a source table organized into a set of batch units, the query including a pattern matching predicate specifying a search pattern; generating a set of N- grams based on the search pattern; accessing a pruning index associated with the source table, the pruning index comprising a set of filters that index distinct N- grams in each column of the source table; identifying, using the set of N-grams generated based on the search pattern, a subset of batch units to scan for matching data based on the pruning index associated with the source table; and processing the query by scanning the subset of batch units.
- Example 2 includes the database system of example 1, wherein: the operations further comprise preprocessing the search pattern before generating the set of N-grams, and the preprocessing of the search pattern includes generating one or more preprocessed variants of the search pattern.
- Example 3 includes the database system of any one or more of examples 1 or 2, wherein the preprocessing of the search pattern includes generating a case-agnostic variant of the search pattern.
- Example 4 includes the database system of any one or more of examples 1-3, wherein the preprocessing of the search pattern includes generating one or more misspelled variants of the search pattern.
- Example 5 includes the database system of any one or more of examples 1-4, wherein the preprocessing of the search pattern includes generating one or more synonymous variants corresponding to synonyms of the search pattern.
- Example 6 includes the database system of any one or more of examples 1-5, wherein the preprocessing of the search pattern includes generating a variant with one or more special characters to mark a start and end of the search pattern.
- Example 7 includes the database system of any one or more of examples 1-6, wherein identifying the subset of batch units comprises: generating a set of fingerprints based on the set of N-grams; and comparing the set of fingerprints to the pruning index.
- Example 8 includes the database system of any one or more of examples 1-7, wherein generating the set of fingerprints based on the set of N- grams comprises computing a hash for each N-gram in the set of N-grams.
- Example 9 includes the database system of any one or more of examples 1-8, wherein identifying the subset of batch units further comprises: identifying one or more values in the pruning index that match one or more fingerprints in the set of fingerprints; and identifying the subset of batch units based on the one or more values.
- Example 10 includes the database system of any one or more of examples 1-9, wherein the pruning index comprises a set of filters, each filter in the set of filters corresponding to one batch unit in the set of batch units.
- Example 11 is a method comprising: receiving a query directed at a source table organized into a set of batch units, the query including a pattern matching predicate specifying a search pattern; generating a set of N-grams based on the search pattern; accessing a pruning index associated with the source table, the pruning index comprising a set of filters that index distinct N-grams in each column of the source table; identifying, using the set of N-grams generated based on the search pattern, a subset of batch units to scan for matching data based on the pruning index associated with the source table; and processing the query by scanning the subset of batch units.
- Example 12 includes the method of example 11, wherein: the method further comprises preprocessing the search pattern before generating the set of N-grams, wherein the preprocessing of the search pattern includes generating one or more preprocessed variants of the search pattern.
- Example 13 includes the method of any one or more of examples 11 or 12, wherein the preprocessing of the search pattern includes generating a case-agnostic variant of the search pattern.
- Example 14 includes the method of any one or more of examples Il ls, wherein the preprocessing of the search pattern includes generating one or more misspelled variants of the search pattern.
- Example 15 includes the method of any one or more of examples 11- 14, wherein the preprocessing of the search pattern includes generating one or more synonymous variants corresponding to synonyms of the search pattern.
- Example 16 includes the method of any one or more of examples Il ls, wherein the preprocessing of the search pattern includes generating a variant with one or more special characters to mark a start and end of the search pattern.
- Example 17 includes the method of any one or more of examples 11-
- identifying the subset of batch units comprises: generating a set of fingerprints based on the set of N-grams; and comparing the set of fingerprints to the pruning index.
- Example 18 includes the method of any one or more of examples 11-
- generating the set of fingerprints based on the set of N-grams comprises computing a hash for each N-gram in the set of N-grams.
- Example 19 includes the method of any one or more of examples Il ls, wherein identifying the subset of batch units further comprises: identifying one or more values in the pruning index that match one or more fingerprints in the set of fingerprints; and identifying the subset of batch units based on the one or more values.
- Example 20 includes the method of any one or more of examples 11- 19, wherein the pruning index comprises a set of filters, each filter in the set of filters corresponding to one batch unit in the set of batch units.
- Example 21 is a computer-storage medium comprising instructions that, when executed by one or more processors of a machine, configure the machine to perform operations comprising: receiving a query directed at a source table organized into a set of batch units, the query including a pattern matching predicate specifying a search pattern; generating a set of N-grams based on the search pattern; accessing a pruning index associated with the source table, the pruning index comprising a set of filters that index distinct N-grams in each column of the source table; identifying, using the set of N-grams generated based on the search pattern, a subset of batch units to scan for matching data based on the pruning index associated with the source table; and processing the query by scanning the subset of batch units.
- Example 22 includes the computer-storage medium of example 21, wherein: the operations further comprise preprocessing the search pattern before generating the set of N-grams, and the preprocessing of the search pattern includes generating one or more preprocessed variants of the search pattern.
- Example 23 includes the computer-storage medium of any one or more of examples 21 or 22, wherein the preprocessing of the search pattern includes generating a case-agnostic variant of the search pattern.
- Example 24 includes the computer-storage medium of any one or more of examples 21-23, wherein the preprocessing of the search pattern includes generating one or more misspelled variants of the search pattern.
- Example 25 includes the computer-storage medium of any one or more of examples 21-24, wherein the preprocessing of the search pattern includes generating one or more synonymous variants corresponding to synonyms of the search pattern.
- Example 26 includes the computer-storage medium of any one or more of examples 21-25, wherein the preprocessing of the search pattern includes generating a variant with one or more special characters to mark a start and end of the search pattern.
- Example 27 includes the computer-storage medium of any one or more of examples 21-26, wherein identifying the subset of batch units comprises: generating a set of fingerprints based on the set of N-grams; and comparing the set of fingerprints to the pruning index.
- Example 28 includes the computer-storage medium of any one or more of examples 21-27, wherein generating the set of fingerprints based on the set of N-grams comprises computing a hash for each N-gram in the set of N- grams.
- Example 29 includes the computer-storage medium of any one or more of examples 21-28, wherein identifying the subset of batch units further comprises: identifying one or more values in the pruning index that match one or more fingerprints in the set of fingerprints; and identifying the subset of batch units based on the one or more values.
- Example 30 includes the computer-storage medium of any one or more of examples 21-29, wherein the pruning index comprises a set of filters, each filter in the set of filters corresponding to one batch unit in the set of batch units.
- the various memories may store one or more sets of instructions 1116 and data structures (e.g., software) embodying or utilized by any one or more of the methodologies or functions described herein. These instructions 1116, when executed by the processor(s) 1110, cause various operations to implement the disclosed embodiments.
- the terms “machine-storage medium,” “device storage medium,” and “computer-storage medium” mean the same thing and may be used interchangeably in this disclosure.
- the terms refer to a single or multiple storage devices and/or media (e.g., a centralized or distributed database, and/or associated caches and servers) that store executable instructions and/or data.
- the terms shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media, including memory internal or external to processors.
- machine-storage media examples include non-volatile memory, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), field-programmable gate arrays (FPGAs), and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
- semiconductor memory devices e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), field-programmable gate arrays (FPGAs), and flash memory devices
- magnetic disks such as internal hard disks and removable disks
- magneto-optical disks magneto-optical disks
- CD-ROM and DVD-ROM disks examples include CD-ROM and DVD-ROM disks.
- one or more portions of the network 1180 may be an ad hoc network, an intranet, an extranet, a virtual private network (VPN), a local-area network (LAN), a wireless LAN (WLAN), a wide-area network (WAN), a wireless WAN (WWAN), a metropolitan-area network (MAN), the Internet, a portion of the Internet, a portion of the public switched telephone network (PSTN), a plain old telephone service (POTS) network, a cellular telephone network, a wireless network, a Wi-Fi® network, another type of network, or a combination of two or more such networks.
- VPN virtual private network
- LAN local-area network
- WLAN wireless LAN
- WAN wide-area network
- WWAN wireless WAN
- MAN metropolitan-area network
- PSTN public switched telephone network
- POTS plain old telephone service
- the network 1180 or a portion of the network 1180 may include a wireless or cellular network
- the coupling 1182 may be a Code Division Multiple Access (CDMA) connection, a Global System for Mobile communications (GSM) connection, or another type of cellular or wireless coupling.
- CDMA Code Division Multiple Access
- GSM Global System for Mobile communications
- the coupling 1182 may implement any of a variety of types of data transfer technology, such as Single Carrier Radio Transmission Technology (lxRTT), Evolution-Data Optimized (EVDO) technology, General Packet Radio Service (GPRS) technology, Enhanced Data rates for GSM Evolution (EDGE) technology, third Generation Partnership Project (3 GPP) including 3G, fourth generation wireless (4G) networks, Universal Mobile Telecommunications System (UMTS), High-Speed Packet Access (HSPA), Worldwide Interoperability for Microwave Access (WiMAX), Long Term Evolution (LTE) standard, others defined by various standard-setting organizations, other long-range protocols, or other data transfer technology.
- lxRTT Single Carrier Radio Transmission Technology
- GPRS General Packet Radio Service
- EDGE Enhanced Data rates for GSM Evolution
- 3 GPP Third Generation Partnership Project
- 4G fourth generation wireless (4G) networks
- Universal Mobile Telecommunications System (UMTS) Universal Mobile Telecommunications System
- HSPA High-Speed Packet Access
- WiMAX Worldwide Interoperability
- the instructions 1116 may be transmitted or received over the network 1180 using a transmission medium via a network interface device (e.g., a network interface component included in the communication components 1164) and utilizing any one of a number of well-known transfer protocols (e.g., hypertext transfer protocol (HTTP)). Similarly, the instructions 1116 may be transmitted or received using a transmission medium via the coupling 1172 (e.g., a peer-to-peer coupling) to the devices 1170.
- a network interface device e.g., a network interface component included in the communication components 1164
- HTTP hypertext transfer protocol
- the instructions 1116 may be transmitted or received using a transmission medium via the coupling 1172 (e.g., a peer-to-peer coupling) to the devices 1170.
- the terms “transmission medium” and “signal medium” mean the same thing and may be used interchangeably in this disclosure.
- transmission medium and “signal medium” shall be taken to include any intangible medium that is capable of storing, encoding, or carrying the instructions 1116 for execution by the machine 1100, and include digital or analog communications signals or other intangible media to facilitate communication of such software.
- transmission medium and “signal medium” shall be taken to include any form of modulated data signal, carrier wave, and so forth.
- modulated data signal means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal.
- machine-readable medium means the same thing and may be used interchangeably in this disclosure.
- the terms are defined to include both machine-storage media and transmission media.
- the terms include both storage devices/media and carrier waves/modulated data signals.
- the various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations.
- the methods described herein may be at least partially processor-implemented.
- at least some of the operations of the method 800 may be performed by one or more processors.
- the performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but also deployed across a number of machines.
- the processor or processors may be located in a single location (e.g., within a home environment, an office environment, or a server farm), while in other embodiments the processors may be distributed across a number of locations.
- inventive subject matter may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed.
- inventive subject matter may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed.
- inventive subject matter merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US16/932,462 US10942925B1 (en) | 2019-12-26 | 2020-07-17 | Database query processing using a pruning index |
US202063084394P | 2020-09-28 | 2020-09-28 | |
US17/086,228 US10997179B1 (en) | 2019-12-26 | 2020-10-30 | Pruning index for optimization of pattern matching queries |
PCT/US2021/070808 WO2022016170A1 (en) | 2020-07-17 | 2021-06-30 | Pruning index for optimization of pattern matching queries |
Publications (2)
Publication Number | Publication Date |
---|---|
EP4182808A1 true EP4182808A1 (en) | 2023-05-24 |
EP4182808A4 EP4182808A4 (en) | 2024-01-17 |
Family
ID=79554309
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP21841334.2A Pending EP4182808A4 (en) | 2020-07-17 | 2021-06-30 | Pruning index for optimization of pattern matching queries |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP4182808A4 (en) |
WO (1) | WO2022016170A1 (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11308090B2 (en) | 2019-12-26 | 2022-04-19 | Snowflake Inc. | Pruning index to support semi-structured data types |
US11681708B2 (en) | 2019-12-26 | 2023-06-20 | Snowflake Inc. | Indexed regular expression search with N-grams |
US10997179B1 (en) | 2019-12-26 | 2021-05-04 | Snowflake Inc. | Pruning index for optimization of pattern matching queries |
US11372860B2 (en) | 2019-12-26 | 2022-06-28 | Snowflake Inc. | Processing techniques for queries where predicate values are unknown until runtime |
US11567939B2 (en) | 2019-12-26 | 2023-01-31 | Snowflake Inc. | Lazy reassembling of semi-structured data |
US10769150B1 (en) | 2019-12-26 | 2020-09-08 | Snowflake Inc. | Pruning indexes to enhance database query processing |
US11880369B1 (en) | 2022-11-21 | 2024-01-23 | Snowflake Inc. | Pruning data based on state of top K operator |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8271499B2 (en) * | 2009-06-10 | 2012-09-18 | At&T Intellectual Property I, L.P. | Incremental maintenance of inverted indexes for approximate string matching |
WO2015086824A1 (en) * | 2013-12-13 | 2015-06-18 | Danmarks Tekniske Universitet | Method of and system for information retrieval |
US10705809B2 (en) * | 2017-09-08 | 2020-07-07 | Devfactory Innovations Fz-Llc | Pruning engine |
US10691753B2 (en) * | 2018-04-25 | 2020-06-23 | Oracle International Corporation | Memory reduced string similarity analysis |
-
2021
- 2021-06-30 WO PCT/US2021/070808 patent/WO2022016170A1/en unknown
- 2021-06-30 EP EP21841334.2A patent/EP4182808A4/en active Pending
Also Published As
Publication number | Publication date |
---|---|
WO2022016170A1 (en) | 2022-01-20 |
EP4182808A4 (en) | 2024-01-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10997179B1 (en) | Pruning index for optimization of pattern matching queries | |
US11803551B2 (en) | Pruning index generation and enhancement | |
US11016975B1 (en) | Scan set pruning for pattern matching queries | |
US11593379B2 (en) | Join query processing using pruning index | |
US11893025B2 (en) | Scan set pruning for queries with predicates on semi-structured fields | |
EP4182808A1 (en) | Pruning index for optimization of pattern matching queries | |
US11816107B2 (en) | Index generation using lazy reassembling of semi-structured data | |
US11989184B2 (en) | Regular expression search query processing using pruning index |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20230217 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
A4 | Supplementary search report drawn up and despatched |
Effective date: 20231218 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06F 16/22 20190101ALI20231212BHEP Ipc: G06F 16/2455 20190101AFI20231212BHEP |