Pruning Index for Geospatial Query Optimization

The patent divides the large table into multiple micro-partitions and creates pruning indexes for each micro-partition. This segmentation allows the query processor to evaluate predicates at the micro-partition level and eliminate entire micro-partitions that cannot satisfy the query conditions, rather than scanning every row in the table. The segmentation principle directly resolves the contradiction by maintaining query accuracy through systematic evaluation while dramatically reducing the time and resources needed compared to full table scans.

The patent performs preliminary actions by pre-computing pruning indexes that store metadata about each micro-partition's data characteristics. Before executing a query, the system has already organized and indexed the data in a way that enables rapid predicate evaluation. This preliminary organization allows the system to quickly determine which micro-partitions can be skipped, resolving the contradiction by preparing the data structure in advance to enable fast, accurate query processing without full table scans.

The patent segments the table into micro-partitions with associated pruning indexes, enabling resource-efficient query processing. By evaluating geospatial predicates at the micro-partition level using pre-computed index data, the system avoids the exponential resource consumption of full table scans while maintaining complete data coverage where needed. This segmentation allows selective processing that preserves data coverage reliability while dramatically reducing computing resource usage.

The patent applies partial action by processing only the necessary micro-partitions that can potentially satisfy the query conditions, rather than performing excessive full table scans. The pruning index enables the system to identify and process only the relevant subset of data, achieving complete coverage of relevant data while avoiding wasteful processing of irrelevant micro-partitions, thus resolving the contradiction between data coverage and resource consumption.

The patent segments the indexing task into manageable micro-partition-level indexes rather than requiring a single complex global index. Each micro-partition has its own pruning index, which simplifies the maintenance burden compared to a monolithic index structure. This segmentation allows parallel index maintenance operations and reduces the complexity of index updates, resolving the contradiction by making the indexing system more manageable while still achieving fast query execution.

The patent introduces pruning indexes as intermediary structures between the raw table data and the query processing logic. These indexes serve as a middle layer that pre-computes and stores metadata about micro-partitions, allowing the query processor to make rapid decisions about which micro-partitions to scan without directly analyzing the raw data. This intermediary structure reduces query execution time while keeping maintenance complexity manageable by isolating the complexity in the index layer rather than in the core query processing logic.