Oracle International Corporation

Amadeus S.a.s.

Georgios Giannikis

Nipun Agarwal

Seema Sundara

Sabina Petride

Donald Kossmann

Dietmar Fauser

Gustavo Alonso

Cedric Florimond

Philipp Unterbrunner

Jeremy Meyer

Sam Idicula

Pit Fender

Nitin Kunal

Anantha Kiran Kandukuri

Cédric Florimond

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.

Sparse dictionary tree

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.

Distributed relational dictionaries

A distributed data store includes a storage layer comprised of a plurality of storage nodes, each storage node configured to receive and queue table operations, and an aggregation layer comprised of aggregator nodes configured to route table operations to storage nodes in the storage layer and merge results of table operations returned by storage nodes in the storage layer. Each storage node includes in part scan threads dedicated to continuous and full scanning of segments of a table that are respectively associated with processor cores upon which such scan threads are running.

Continuous full scan data store table and distributed data store featuring predictable answer time for unpredictable workload

A method for storing and retrieving data in a storage node of a data store and storage node of a data store, storing in main-memory at least one segment of a relational table. The storage node includes at least one computational core running at least one scan thread each dedicated to the scanning of one of the at least one segment. At least one scan thread uniquely, continuously and exhaustively scans the dedicated segment of the relational table. The storage node receives and processes batches of query and update operations for the at least one segment of the relational table. The query and update operations of a batch are re-indexed at beginning of each scan by the scan thread. Then, the indexed query and update operations of a batch are independently joined to data records of said segment that match with predicates of the indexed query and update operations.

Growing community of inventors

Zurich, Switzerland

Georgios Giannikis