公开(公告)号：US20240143594A1

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

申请号：US18211613

申请日：2023-06-20

Applicant: Oracle International Corporation

Inventor： ARNAUD DELAMARE ,  IRFAN BUNJAKU ,  VASILEIOS TRIGONAKIS ,  CALIN IORGULESCU ,  TOMAS FALTIN ,  SUNGPACK HONG ,  HASSAN CHAFI

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

CPC classification number: G06F16/24552 ,  G06F16/22 ,  G06F16/2343 ,  G06F16/24542

Abstract: A storage manager for offloading graph components to persistent storage for reducing resident memory in a distributed graph processing engine is provided. The storage manager identifies a set of graph components required to execute a graph processing operation on a graph in a graph processing engine of a database system and reserves an amount of memory needed to load the set of graph components into memory. The storage manager loads the set of graph components into memory and initiates execution of the graph processing operation using the set of graph components in memory. The storage manager evicts one or more unused graph components from memory in response to receiving a request to free a requested amount of memory from memory.

公开(公告)号：US20210064619A1

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

申请号：US16555974

申请日：2019-08-29

Applicant: Oracle International Corporation

Inventor： PIT FENDER ,  ALEXANDER ULRICH ,  LAURENT DAYNES ,  MATTHIAS BRANTNER ,  BASTIAN HOSSBACH ,  BENJAMIN SCHLEGEL ,  HASSAN CHAFI

IPC: G06F16/2453 ,  G06F16/2455 ,  G06F8/41

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

公开(公告)号：US20210064613A1

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

申请号：US16556760

申请日：2019-08-30

Applicant: Oracle International Corporation

Inventor： PIT FENDER ,  HARSHAD KASTURE ,  ALEXANDER ULRICH ,  BENJAMIN SCHLEGEL ,  MATTHIAS BRANTNER ,  HASSAN CHAFI

IPC: G06F16/242 ,  G06F8/30 ,  G06F16/25

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

公开(公告)号：US20190340284A1

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

申请号：US15971664

申请日：2018-05-04

Applicant: Oracle International Corporation

Inventor： ANANTHA KIRAN KANDUKURI ,  LAURENT DAYNES ,  HASSAN CHAFI

IPC: G06F17/30

Abstract: Database techniques are provided that use state machines to manage polyglot subroutine bindings for database commands. In an embodiment, a computer receives a database command that contains call sites (CSs). Each CS is associated with a user defined logic (UDL). The computer associates an initial operational state with each of the CSs. During a first invocation of a particular CS, the CS becomes initialized and transitions to an optimized state that is configured for streamlined invocation of the UDL. The UDL is invoked to contribute data to a partial result for the database command. Eventually, command execution stalls and causes the CS to transition to an unready state, which entails releasing shared resources. Later execution resumes and during another invocation of the CS, resources are reacquired, the CS is made ready and transitioned back to the optimized state. The CS may again be repeatedly invoked while revisiting the optimized state.

公开(公告)号：US20170339209A1

公开(公告)日：2017-11-23

申请号：US15159263

申请日：2016-05-19

Applicant: Oracle International Corporation

Inventor： KORBINIAN SCHMID ,  SUNGPACK HONG ,  FELIX KASER ,  ALEXANDER WELD ,  HASSAN CHAFI

IPC: H04L29/08 ,  G06F17/30

Abstract: Techniques herein decouple available results, from graph analysis execution, to adapt to various deployment configurations. In an embodiment, a graph engine is deployed that has multiple mutually-exclusive configuration modes that include being embedded within a software application, centrally serving software applications, or distributed amongst a cluster of computers. Based on a current configuration mode of the graph engine, a software application receives or generates an analysis request to process a graph. The software application provides the analysis request to the graph engine in exchange for access to a computational future, of the graph engine, that is based on the analysis request and the graph. Based on a proxy of said computational future, the software application accesses a result of the analysis request. In an embodiment, a remote proxy exchanges representational state transfer (REST) messages. Network mechanisms, such as transport control protocol (TCP) and hypertext transfer protocol (HTTP), provide enhanced remoting.