Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020136407 - EVALUATING JOIN PATHS FOR LARGE DATABASES

Publication Number WO/2020/136407
Publication Date 02.07.2020
International Application No. PCT/IB2018/060596
International Filing Date 25.12.2018
IPC
G06F 16/00 2019.1
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
CPC
G06F 16/2453
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
24Querying
245Query processing
2453Query optimisation
Applicants
  • SHARMA, Pratik [IN]/[IN]
Inventors
  • SHARMA, Pratik
Priority Data
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) EVALUATING JOIN PATHS FOR LARGE DATABASES
(FR) √ČVALUATION DE CHEMINS DE JONCTION POUR DE GRANDES BASES DE DONN√ČES
Abstract
(EN)
In this invention we have databases with large number of tables. We first compute the common attributes or columns for different pairs of tables in the database and thus from this we build different sets of columns to be used to evaluate different join paths in the database using transitive closure. Also to make sure a column for a given set have distinct values we use hyperloglog algorithm to solve for cardinality estimation problem. Now on the above sets of columns with distinct values for each column, we compute the cardinality of intersection or union of such columns in the same set which can be used to evaluate different join paths for the set of columns or their corresponding tables.
(FR)
. . . .
Latest bibliographic data on file with the International Bureau