公开(公告)号：US20220222254A1

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

申请号：US17707643

申请日：2022-03-29

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  Zhe Wu ,  Andrew Witkowski

IPC: G06F16/2453 ,  G06F16/901

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.

公开(公告)号：US11334567B2

公开(公告)日：2022-05-17

申请号：US16543258

申请日：2019-08-16

Applicant: Oracle International Corporation

Inventor： Mohamed Ziauddin ,  Zhe Wu ,  Andrew Witkowski

IPC: G06F16/2453 ,  G06F16/901

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.

公开(公告)号：US20210109930A1

公开(公告)日：2021-04-15

申请号：US16653639

申请日：2019-10-15

Applicant: Oracle International Corporation

Inventor： Sabina Petride ,  Mohamed Ziauddin ,  Praveen T.J. Kumar ,  Huagang Li ,  Andrew Witkowski ,  Sankar Subramanian

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/242 ,  G06F16/23

Abstract: Techniques are described for storing and maintaining, in a materialized view, bitmap data that represents a bitmap of each possible distinct value of an expression and rewriting a query for a count of distinct values of the expression using the materialized view. The materialized view contains bitmap data that represents a bitmap of each possible distinct value of a first expression, and aggregate values of additional expressions, and is stored in memory or on disk by a database system. The database system receives a query that requests a number of distinct values, of the first expression, and an aggregate value for an additional expression. In response, the database system, rewrites the query to: compute the number of distinct values by counting the bits in the bitmap data of the materialized view that are set to the first value, and obtains the aggregate value for the additional expression in the materialized view.

公开(公告)号：US10719516B2

公开(公告)日：2020-07-21

申请号：US16113633

申请日：2018-08-27

Applicant: Oracle International Corporation

Inventor： Venkatesh Sakamuri ,  Huagang Li ,  Sankar Subramanian ,  Andrew Witkowski

IPC: G06F16/00 ,  G06F16/2455 ,  G06F7/24

Abstract: A method and system for processing database queries containing aggregate functions. The query may specify fewer groups than there are processes available to process the queries. Further, the queries may target a set of rows and specify a sort-by key and a group-by key. The method and system further includes determining that the queries specify application of the aggregate function to each of a plurality of groups that may correspond to a plurality of distinct values of the group-by key and determining that plurality of processes are available to process the queries. The method and system also includes determining the plurality of ranges of a composite key that may be formed by combining the group-by key and the sort-by key and assigning each range of the plurality ranges to a corresponding process to calculate the aggregate function.

公开(公告)号：US20170116266A1

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

申请号：US15268519

申请日：2016-09-16

Applicant: Oracle International Corporation

Inventor： Janaki Latha Lahorani ,  You Jung Kim ,  Andrew Witkowski ,  Sankar Subramanian

IPC: G06F17/30

CPC classification number: G06F16/24532 ,  G06F16/24539 ,  G06F16/24561

Abstract: Techniques are provided herein for processing a query using in-memory cursor duration temporary tables. The techniques involve storing a part of the temporary table in memory of nodes in a database cluster. A part of the temporary table may be stored in disk segments of nodes in the database cluster. Writer threads running on a particular node writes data for the temporary table to the memory of the particular node. Excess data may be written to the disk segment of the particular node. Reader threads running on the particular node reads data for the temporary table from the memory of the particular node and the disk segment of the particular node.

公开(公告)号：US20150199407A1

公开(公告)日：2015-07-16

申请号：US14671510

申请日：2015-03-27

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中确定和维护。 对于在分区列上包含过滤谓词的查询，可以将谓词值与该分区列的区域维护的最小值和最大值进行比较，以确定是否可以跳过该区域的磁盘块扫描。

公开(公告)号：US20250036623A1

公开(公告)日：2025-01-30

申请号：US18227284

申请日：2023-07-27

Applicant: Oracle International Corporation

Inventor： Mihajlo Tekic ,  Praveen Tupati Jaganath Kumar ,  Murali Thiyagarajah ,  Andrew Witkowski

IPC: G06F16/2453

Abstract: A method and one or more non-transitory storage media for materialized view-based query rewrite are provided. A plurality of materialized views is created based on a fact table and a dimension table. Each materialized view is based on a join between the dimension table and the fact table based on a respective foreign key column of the fact table. A database management system executes a query against the fact table and the dimension table, the query requiring one or more joins between the dimension table and the fact table based on one or more foreign key columns. For each given join of the one or more joins, responsive to the given join satisfying one or more rewrite criteria, the query is rewritten to replace the join between the dimension table and the fact table with a join between a respective materialized view for the given join and the fact table.

公开(公告)号：US12135719B2

公开(公告)日：2024-11-05

申请号：US17884917

申请日：2022-08-10

Applicant: Oracle International Corporation

Inventor： Rafi Ahmed ,  Randall Bello ,  Andrew Witkowski

IPC: G06F16/245 ,  G06F16/2453 ,  G06F16/2455

Abstract: In one technique, a definition of a materialized view is identified. Based on the definition, multiple candidate partitioning schemes are identified. A query is generated that indicates one or more of the candidate partitioning schemes. The query is then executed, where executing the query results in one or more partition counts, each corresponding to a different candidate partitioning scheme of the one or more candidate partitioning schemes. Based on the one or more partition counts, a candidate partitioning scheme is selected from among the plurality of candidate partitioning schemes. The materialized view is automatically partitioned based on the candidate partitioning scheme.

公开(公告)号：US20240126763A1

公开(公告)日：2024-04-18

申请号：US18099034

申请日：2023-01-19

Applicant: Oracle International Corporation

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Beda Christoph Hammerschmidt ,  Andrew Witkowski ,  Sankar Subramanian ,  Sabina Petride ,  Ajit Mylavarapu ,  Gerald Venzl

IPC: G06F16/2455 ,  G06F16/22

CPC classification number: G06F16/24565 ,  G06F16/221 ,  G06F16/24554

Abstract: Disclosed herein are techniques for storing, within a database system, metadata that indicates an intended usage (IU). Once created, an IU may be assigned to a column to (a) indicate how the column is intended to be used, and (b) affect how the database server behaves when database operations involve values from the column. The IU assigned to a column supplements, but does not replace, the datatype definition for the column. Each IU may have an IU-bundle. The IU-bundle of an IU indicates how the database server behaves with respect to any column that is assigned the IU. For example, the IU-bundle may indicate constraints that the database server must validate during operations on values from columns assigned to the IU. Techniques are also described for implementing multi-column IUs and flexible IUs.

公开(公告)号：US20240111790A1

公开(公告)日：2024-04-04

申请号：US18373082

申请日：2023-09-26

Applicant: Oracle International Corporation

Inventor： Teck Hua Lee ,  Hariharan Lakshmanan ,  Sujatha Muthulingam ,  Andrew Witkowski ,  Shasank Kisan Chavan ,  You Jung Kim ,  Sooyeon Jo ,  Yu Chieh Fu ,  Vicente Hernandez Jimenez ,  Tirthankar Lahiri

IPC: G06F16/28 ,  G06F16/22 ,  G06F16/25

CPC classification number: G06F16/285 ,  G06F16/2219 ,  G06F16/258

Abstract: Techniques are provided for optimizing storage of database records in segments using sub-segments. A base segment is a container used for storing records that belong to a database object. A database management system receives a request to load, into the database object, a first set of records that are in a first state. In response to receiving the request, the system generates a new sub-segment, which is a container that is separate from the base segment. The system stores the first set of records, in their first state, within the sub-segment. The system then monitors one or more characteristics of the database system. In response to the one or more characteristics satisfying criteria, the system performs a migration of one or more records of the first set of records from the sub-segment to the base segment. During the migration, the system converts the one or more records from the first state to a second state and stores the one or more records, in their second state, in the base segment.