公开(公告)号：US20170116272A1

公开(公告)日：2017-04-27

申请号：US15268522

申请日：2016-09-16

Applicant: Oracle International Corporation

Inventor： Janaki Latha Lahorani ,  Mohamed Ziauddin ,  You Jung Kim

IPC: G06F17/30

Abstract: Techniques are presented herein for storing cursor duration temporary tables in memory of nodes in a clustered database system in association with iterations of an iterative query operation. The techniques involve associating a portion of memory with one or more iteration values. The iteration values indicate which iterations correspond to data that is stored in the portion of memory. When data is requested for a particular iteration, portions of memory are checked to determine if it stores the particular iteration.

公开(公告)号：US08996544B2

公开(公告)日：2015-03-31

申请号：US13629907

申请日：2012-09-28

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  Andrew Witkowski

IPC: G06F17/30

CPC classification number: G06F17/30492 ,  G06F17/30584 ,  G06F17/30592 ,  G06F17/30598

Abstract: Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.

Abstract translation: 提供了用于生成“维度zonemap”的技术，允许数据库服务器基于限定一个或多个维度表的查询中的过滤器谓词来扫描事实表的磁盘块。 zonemap将事实表划分为被称为“区域”的连续磁盘块的集合。 对于每个区域，维度表的一个或多个“分区”列中的每一个的最小值和最大值在zonemap中确定和维护。 对于在分区列上包含过滤谓词的查询，可以将谓词值与该分区列的区域维护的最小值和最大值进行比较，以确定是否可以跳过该区域的磁盘块扫描。

公开(公告)号：US11797534B2

公开(公告)日：2023-10-24

申请号：US17707643

申请日：2022-03-29

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  Zhe Wu ,  Andrew Witkowski

IPC: G06F16/901 ,  G06F16/2453

CPC classification number: G06F16/24535 ,  G06F16/9024

Abstract: Embodiments generate random walks through a directed graph that is represented in a relational database table. Each row of the graph table represents a directed edge in the graph and includes a source vertex and a destination vertex. Each row is further augmented to (a) indicate the number of outbound edges starting from the destination vertex in the row and (b) include an identifier that distinguishes the edge from other outbound edges starting from the same source vertex. An SQL query may be executed on the augmented graph table. Starting from a source vertex (starting vertex or the destination vertex of the previously selected hop) the query randomly selects a row of the graph table representing one of the outbound edges from the source vertex and adds the selected outbound edge as a row in a random walk table that represents the next hop in the random walk.

公开(公告)号：US11429606B2

公开(公告)日：2022-08-30

申请号：US16726597

申请日：2019-12-24

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Sabina Petride ,  Mohamed Ziauddin ,  Praveen T.J. Kumar

IPC: G06F16/00 ,  G06F16/2453 ,  G06F16/22

Abstract: Techniques are provided for bitmap-based computation of a COUNT(DISTINCT) function, where the bitmaps are generated based on ranks of target expression values. According to an embodiment, the ranks are computed using the DENSE_RANK function. The bitmaps may be maintained in a materialized view. Bitmap data that represents the ranks for target expression values occurring in data for a given group is divided across multiple bucket bitmaps, each corresponding to a distinct sub-range of the ranks. According to an embodiment, target expression value ranks are computed relative to partitions of the target expression values. When these partitions correspond to a subset (not necessarily strict) of the target query grouping keys for a query rewrite, the resulting bitmaps allow computation of multiple levels of aggregation from the single set of bitmaps.

公开(公告)号：US20220114195A1

公开(公告)日：2022-04-14

申请号：US17068357

申请日：2020-10-12

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  You Jung Kim ,  Venkatesh Sakamuri ,  Sankar Subramanian

IPC: G06F16/28 ,  G06F16/22

Abstract: Techniques for the automatic creation and maintenance of zone maps are provided. In one technique, a set of data sets is identified. For each data set, a data set width is determined based on a maximum value in the data set and a minimum value in the data set. One or more zones within the data set are identified. For each zone, a zone width is determined based on a difference between a maximum value in that zone and a minimum value in that zone. An aggregate zone width is generated that is based on the zone width of each zone. Based on the data set width and the aggregate zone width, it is determined whether to automatically generate a zone map for the data set.

公开(公告)号：US10223422B2

公开(公告)日：2019-03-05

申请号：US14671510

申请日：2015-03-27

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  Andrew Witkowski

IPC: G06F17/30

Abstract: Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.

公开(公告)号：US20150286682A1

公开(公告)日：2015-10-08

申请号：US14245934

申请日：2014-04-04

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin

IPC: G06F17/30

CPC classification number: G06F17/30486 ,  G06F17/30339 ,  G06F17/30463

Abstract: Techniques for using zone map information for post index access pruning. In one embodiment, for example, a method for using zone map information for post index access pruning comprises: receiving a query statement comprising a first filter predicate on an indexed column of a database table and a second filter predicate on a zoned column of a database table; identifying zero or more pruneable zones of a zone map based on a value for the zoned column in the second filter predicate; obtaining a set of data record addresses from an index on the indexed column based on a value for the indexed column in the first filter predicate; and pruning, from access paths for processing the query statement, any data records, corresponding to data record addresses in the set of data record addresses, that are physically located in one of the pruneable zones.

Abstract translation: 使用区域地图信息进行后索引访问修剪的技术。 在一个实施例中，例如，用于使用区域映射信息用于后索引访问修剪的方法包括：在数据库表的索引列上接收包括第一过滤谓词的查询语句，以及在数据库的分区列上的第二过滤谓词 表; 基于第二过滤谓词中分区列的值，识别区域映射的零个或多个可修剪区域; 基于第一个过滤谓词中的索引列的值，从索引列索引获取一组数据记录地址; 并且从用于处理查询语句的访问路径修剪对应于物理位于可修剪区域之一的数据记录地址集合中的数据记录地址的任何数据记录。

公开(公告)号：US20150286681A1

公开(公告)日：2015-10-08

申请号：US14245909

申请日：2014-04-04

Applicant: Oracle International Corporation

Inventor： Hermann Baer ,  Mohamed Ziauddin ,  Ananth Raghavan

IPC: G06F17/30

CPC classification number: G06F17/30486 ,  G06F17/30339 ,  G06F17/30463

Abstract: Techniques for partition pruning based on aggregated zone map information. In one embodiment, for example, a method for pruning partitions based on aggregated zone map information comprises: receiving a query statement comprising a filter predicate on a column of a database table; and pruning one or more partitions of the database table from access paths for processing the query statement based on determining, based on aggregated zone map information associated with the one or more partitions, that the filter predicate cannot be satisfied by data stored in the one or more partitions.

Abstract translation: 基于聚合区域地图信息的分割修剪技术。 在一个实施例中，例如，基于聚合的区域映射信息来修剪分区的方法包括：在数据库表的列上接收包括过滤谓词的查询语句; 以及基于根据与所述一个或多个分区相关联的聚合区域映射信息确定所述过滤谓词不能由存储在所述一个或多个分区中的数据来满足所述数据库表的一个或多个分区，以从所述访问路径修剪所述数据库表的一个或多个分区，以处理所述查询语句 更多的分区。

公开(公告)号：US20140095520A1

公开(公告)日：2014-04-03

申请号：US13629907

申请日：2012-09-28

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Mohamed Ziauddin ,  Andrew Witkowski

IPC: G06F17/30

CPC classification number: G06F17/30492 ,  G06F17/30584 ,  G06F17/30592 ,  G06F17/30598

Abstract: Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.

Abstract translation: 提供了用于生成“维度zonemap”的技术，允许数据库服务器基于限定一个或多个维度表的查询中的过滤器谓词来扫描事实表的磁盘块。 zonemap将事实表划分为被称为“区域”的连续磁盘块的集合。 对于每个区域，维度表的一个或多个“分区”列中的每一个的最小值和最大值在zonemap中确定和维护。 对于在分区列上包含过滤谓词的查询，可以将谓词值与该分区列的区域维护的最小值和最大值进行比较，以确定是否可以跳过该区域的磁盘块扫描。

公开(公告)号：US20140095502A1

公开(公告)日：2014-04-03

申请号：US13629897

申请日：2012-09-28

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Mohamed Ziauddin ,  Andrew Witkowski

IPC: G06F17/30

CPC classification number: G06F17/30592 ,  G06F17/30289 ,  G06F17/30584 ,  G06F17/30598

Abstract: Techniques are provided that address the problems associated with prior approaches for clustering a fact table in a relational database management system. According to one aspect of the invention, a database server clusters a fact table in a database based on one or more dimension tables. More specifically, rows are stored in the fact table in a sorted order and the order in which the rows are sorted is based on values in one or more columns of one or more of the dimension tables. A user specifies the columns of the dimension tables on which the sorted order is based in “clustering criteria”. The database server uses the clustering criteria to automatically store the rows in the fact table in the sorted order in response to certain user-initiated database operations on the fact-table.

Abstract translation: 提供了解决与在关系数据库管理系统中聚类事实表的先前方法相关联的问题的技术。 根据本发明的一个方面，数据库服务器基于一个或多个维度表将数据库中的事实表聚类。 更具体地说，行以排序的顺序存储在事实表中，并且行被排序的顺序基于一个或多个维度表的一个或多个列中的值。 用户在“聚类标准”中指定排序顺序所基于的维度表的列。 数据库服务器使用聚类标准来按照排序顺序自动将事务表中的行存储在事实表中的某些用户启动的数据库操作上。