Paypal, Inc.

Shanghai Jiaotong University

Junsheng Tan

Jian Li

Wei Zhang

Jun Zhang

Fei Li

Chao B Zhang

Xin Li

Xiaohan Yun

Haibing Guan

Pengshan Zhang

Zhenyin Yang

Ruhui Ma

Ying Yue

Zhengwei Qi

Haoran Zhang

Quin Zuo

Techniques are disclosed for storing an arranging data in a database. A method includes a computer system storing, in a database, data indicative of a graph data structure having a plurality of nodes connected by a plurality of edges. The method further includes the computer system determining that a number of edges connected to a first node satisfies a threshold number. In response to the determining, the computer system may store an index in an index row associated with the first node. The index identifies a first row having first and second ranges of values stored in first and second rows, respectively. The values in the first and second rows correspond to edges connected to the first node. The values in the first and second ranges are usable to indicate properties of corresponding ones of the plurality of edges.

Graph storage in a database

The method includes the following steps: step 1. obtaining NUMA topology information of a host machine, and monitoring virtual machine performance events by using a kernel PMU; step 2. implementing a greedy algorithm, and a scheduling decision is obtained; step 3. scheduling, according to the scheduling decision, a virtual CPU (VCPU) and a memory of a virtual machine; step 4. after the scheduling of the virtual machine is complete, redirecting to step 1 to continue performing performance monitoring of the virtual machine.

Apparatus and method for virtual machine scheduling in non-uniform memory access architecture

Growing community of inventors

Shanghai, China

Junsheng Tan