公开(公告)号：US20190205446A1

公开(公告)日：2019-07-04

申请号：US15861212

申请日：2018-01-03

Applicant: Oracle International Corporation

Inventor： Anantha Kiran Kandukuri ,  Seema Sundara ,  Sam Idicula ,  Pit Fender ,  Nitin Kunal ,  Sabina Petride ,  Georgios Giannikis ,  Nipun Agarwal

IPC: G06F17/30 ,  H04L29/08 ,  G06F17/27

Abstract: Techniques related to distributed relational dictionaries are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method involves generating, by a query optimizer at a distributed database system (DDS), a query execution plan (QEP) for generating a code dictionary and a column of encoded database data. The QEP specifies a sequence of operations for generating the code dictionary. The code dictionary is a database table. The method further involves receiving, at the DDS, a column of unencoded database data from a data source that is external to the DDS. The DDS generates the code dictionary according to the QEP. Furthermore, based on joining the column of unencoded database data with the code dictionary, the DDS generates the column of encoded database data according to the QEP.

公开(公告)号：US11023430B2

公开(公告)日：2021-06-01

申请号：US15819891

申请日：2017-11-21

Applicant: Oracle International Corporation

Inventor： Georgios Giannikis ,  Seema Sundara ,  Sabina Petride ,  Nipun Agarwal

IPC: G06F17/00 ,  G06F16/21 ,  G06F16/22 ,  G06F16/23 ,  H03M7/30 ,  H03M7/00

Abstract: Techniques related to a sparse dictionary tree are disclosed. In some embodiments, computing device(s) execute instructions, which are stored on non-transitory storage media, for performing a method. The method comprises storing an encoding dictionary as a token-ordered tree comprising a first node and a second node, which are adjacent nodes. The token-ordered tree maps ordered tokens to ordered codes. The ordered tokens include a first token and a second token. The ordered codes include a first code and a second code, which are non-consecutive codes. The first node maps the first token to the first code. The second node maps the second token to the second code. The encoding dictionary is updated based on inserting a third node between the first node and the second node. The third node maps a third token to a third code that is greater than the first code and less than the second code.

公开(公告)号：US10810195B2

公开(公告)日：2020-10-20

申请号：US15861212

申请日：2018-01-03

Applicant: Oracle International Corporation

Inventor： Anantha Kiran Kandukuri ,  Seema Sundara ,  Sam Idicula ,  Pit Fender ,  Nitin Kunal ,  Sabina Petride ,  Georgios Giannikis ,  Nipun Agarwal

IPC: G06F17/00 ,  G06F16/2453 ,  H04L29/08 ,  G06F16/22 ,  G06F16/174 ,  G06F40/242 ,  G06F16/23

Abstract: Techniques related to distributed relational dictionaries are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method involves generating, by a query optimizer at a distributed database system (DDS), a query execution plan (QEP) for generating a code dictionary and a column of encoded database data. The QEP specifies a sequence of operations for generating the code dictionary. The code dictionary is a database table. The method further involves receiving, at the DDS, a column of unencoded database data from a data source that is external to the DDS. The DDS generates the code dictionary according to the QEP. Furthermore, based on joining the column of unencoded database data with the code dictionary, the DDS generates the column of encoded database data according to the QEP.

公开(公告)号：US20190155925A1

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

申请号：US15819891

申请日：2017-11-21

Applicant: Oracle International Corporation

Inventor： Georgios Giannikis ,  Seema Sundara ,  Sabina Petride ,  Nipun Agarwal

IPC: G06F17/30

Abstract: Techniques related to a sparse dictionary tree are disclosed. In some embodiments, computing device(s) execute instructions, which are stored on non-transitory storage media, for performing a method. The method comprises storing an encoding dictionary as a token-ordered tree comprising a first node and a second node, which are adjacent nodes. The token-ordered tree maps ordered tokens to ordered codes. The ordered tokens include a first token and a second token. The ordered codes include a first code and a second code, which are non-consecutive codes. The first node maps the first token to the first code. The second node maps the second token to the second code. The encoding dictionary is updated based on inserting a third node between the first node and the second node. The third node maps a third token to a third code that is greater than the first code and less than the second code.