Invention Grant
- Patent Title: Automatically avoiding unconstrained cartesian product joins
- Patent Title (中): 自动避免无约束的笛卡儿产品连接
-
Application No.: US12466845Application Date: 2009-05-15
-
Publication No.: US08417690B2Publication Date: 2013-04-09
- Inventor: Monty C. Poppe , Christian Richter
- Applicant: Monty C. Poppe , Christian Richter
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: DeLizio Gilliam, PLLC
- Main IPC: G06F17/30
- IPC: G06F17/30

Abstract:
Database queries for retrieving data from database tables, that do not impose any constraints on the data to be retrieved, result in Cartesian product joins. Such unconstrained database queries when executed impose a significant load on resources, take a long time to execute, and may produce inaccurate and misleading results. Functionality can be implemented to reduce the amount of data retrieved by constraining database queries resulting in Cartesian product joins before they are executed. This can be done by leveraging referential constraints that depict relationships between the tables to be joined to limit the results produced by executing the Cartesian product join. Automatically detecting and preventing execution of Cartesian product joins by leveraging the referential constraints can reduce the processing load on the machine, reduce the time spent in executing the database query, minimize the number of query results, and prevent inaccurate results from being displayed.
Public/Granted literature
- US20100293161A1 AUTOMATICALLY AVOIDING UNCONSTRAINED CARTESIAN PRODUCT JOINS Public/Granted day:2010-11-18
Information query