Sap Se

Other

Jane Jung Lee

Juchang Lee

Kyu Hwan Kim

Ki Hong Kim

Jaeyoung Choi

Sung Heun Wi

Deok Hoe Kim

JunGyoung Seong

Jung Kook Lee

Chae Kwang Lee

Di Wu

Sang Kyun Cha

Joo Yeon Lee

Chul Won Lee

Joo Young Yoon

Taehyung Lee

Hyeong Seog Kim

Sangyong Hwang

Jin Uk Bae

Dan Bi Park

Marcel Birn

Won Wook Hong

Zhi Qiao

Jiyoung Yoo

Sehee Shim

Yoseob Kim

Younkyoung Lee

The present disclosure provides techniques and solutions for executing requests for database operations involving a remote data source in a system that includes an anchor node and one or more non-anchor nodes. A first request for one or more database operations is received, where at least a first database operation includes a data request for a remote data object. It is determined that the first database operation is not an insert, delete, or update operation, and therefore is assignable to the anchor node or one of the non-anchor nodes. The first database operation is assigned to a non-anchor node for execution. In a particular implementation, for a particular set of requests for a database operation, once an insert, delete, or update operation is received for the remote data object, subsequent operations for the remote data object in the set of requests are assigned to the anchor node for execution.

Flexible routing of database operations accessing remote tables

Technologies are described for routing structured query language (SQL) statements to elastic compute nodes (ECNs) using workload classes within a distributed database environment. The elastic compute nodes do not store persistent database tables. For example, a SQL statement can be received for execution within the distributed database environment. A workload class can be identified that matches properties of the SQL statement. Based on the workload class, a routing location hint can be obtained that identifies a set of elastic compute nodes. The SQL statement can then be routed to one of the identified elastic compute nodes for execution. Execution of the SQL statement at the elastic compute node can involve retrieving database data from other nodes which store persistent database tables.

Routing SQL statements to elastic compute nodes using workload class

Technologies are described for managing multiple cache specifications for a single view in a database environment. For example, a plurality of caches can be crated for the single view. Each of the plurality of caches can have a different cache specification. A query can then be received that operates on the single view. One of the plurality of caches can be selected for processing the query based at least in part on the cache specifications. The query can be processed using the selected cache. Results of processing the query can be output.

Managing multiple cache specifications within a database environment

A system includes determination, for a first partitioned physical query operator in a query operator tree, of a partition-wise placement cost based on a cost of each table partition associated with the first partitioned physical query operator and a partition-wise placement cost of any child physical query operator of the first partitioned physical query operator, determination of a placement cost for the first partitioned physical query operator physical query operator for each of a plurality of operator execution locations based on the determined partition-wise placement cost, determination, for a logical query operator associated with the first partitioned physical query operator, of a merged placement cost for each of the plurality of operator execution locations, and determination an execution location for the first partitioned physical query operator based on the determined partition-wise placement cost.

Partition-wise processing distribution

A system includes determination of a first partition-wise operation on a first database table partition of a first table located at a first server node and a first database table partition of a second table located at a second server node, determination of a first cost to execute the first partition-wise operation on the first server node, and a second cost to execute the first partition-wise operation on the second server node, determination of a second partition-wise operation on a result of the first partition-wise operation, determination of a third cost to execute the second partition-wise operation on the first server node based on the first cost and the second cost, and a fourth cost to execute the second partition-wise operation on the second server node based on the first cost and the second cost, determination of one of the first server node and the second server node to execute the second partition-wise operation based on the third cost and the fourth cost, and determination of one of the first server node and the second server node to execute the first partition-wise operation based on the third cost and the fourth cost.

Determination of query operator execution location

In one aspect there is a method. The method may include associating a query received from an application with a hint, wherein the hint modifies an execution of the query. The method may further include an optimizer to compile the query according to the hint to produce a second query plan. When no hint is associated with the query, the optimizer may produce a first query plan. The method may further include storing the hint in a persistent table to enable state preservation during a database restart or binary upgrade, and/or executing the query using the second query plan.

Query plan optimization by persisting a hint table

A computer implemented method for initializing a first image of a first database from a recovery image; modifying the first image of the first database by replaying transaction logs of a second database; establishing a connection with a client; receiving a query via the connection, the query including a transaction to be executed on the first database; and rejecting the query when the transaction would cause any one of: updating of the first image of the first database; generating a new transaction log; and modifying the recovery image. Related apparatus, systems, techniques and articles are also described.

Write access control in a database

Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans.

Optimal operator placement for distributed query processing

An automatic bean curd manufacturing apparatus includes a main body provided with a bean grinding chamber and a bean juice heating chamber, a driving motor installed in the main body, a rotational container removably and rotatably installed in the grinding chamber of the main body and provided at an inner bottom with a grinding blade, a rotation suppressing member for selectively suppressing a rotation of the rotational container, a clutch installed on a bottom of the rotational container to rotatably support the grinding blade, a rotational container cover for closing an opened top of the rotational container, a grinding container removably installed in the rotational container to grind the beans, a rotational container fixing member for preventing the rotational container from moving, a heating container removably installed in the heating chamber to heat the bean juice dispensed from the rotational container through a bean juice guide, and a heating container cover for closing an opened top of the heating container.

Automatic bean curd manufacturing apparatus

Growing community of inventors

Seoul, South Korea

Jane Jung Lee