Paypal, Inc.

Ebay, Incorporated

Xiaohan Yun

Jun Zhang

Fei Li

Yang Yu

Zhijun Ling

Chao B Zhang

Pengshan Zhang

Frédéric Tu

Quin Zuo

Wei Zhang

Yunfeng Li

Libin Sun

Xin Li

Zhenyin Yang

Yuehao Wu

Ying Yue

Haoran Zhang

Meng Zang

Ke Zheng

Christopher Tang

Feng Chen

Bin Li

Chun Kiat Ho

Lin Song

Kai Xie

Srinivasan Manoharan

Karl Anton Hennig

Thomas Anthony Doran

Uri Arad

Junhua Zhao

Zhe Huang

Rey Neo

Junshi Guo

Jin Yao

Vadim Kutsyy

Chaoyi Chen

Weijia Deng

Shuan Yang

Junsheng Tan

Wenbing Zhu

Siddarth Anand

Mikhail Kourjanski

Adrian Oliver Suciu

Jerry Tso

Xin Chen

Zehong Tan

Tingjie Jia

Qinghai Fu

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

Aspects of the present disclosure involve systems, methods, devices, and the like for generating highly scalable temporal graph databases. In one embodiment, a novel architecture is presented that enables the identification of mutation or changes in graphs. For the identification a combination of graph-based modeling and journal entry is used. Events occurring are consumed and changes are ingested, transformed for use by a graph simulation system. The changes are journaled using a vertex centric temporal journaling schema.

System and method for generating highly scalable temporal graph database

A first graph that includes a plurality of containers is accessed. The containers each contain one or more rules that each have corresponding computer code. The containers are configured for sequential execution by a rule engine. The computer code corresponding to the one or more rules in each of the containers is electronically scanned. Based on the electronic scan, an interdependency among the rules is determined. Based on the determined interdependency, a second graph is generated. The second graph includes all of the rules of the containers, but not the containers themselves. At least some of the rules are configured for parallel execution by the rule engine.

Rule engine optimization via parallel execution

Techniques are disclosed relating to accessing, by an evaluation computer system, transaction details from a subset of current transactions being processed by a production version of a transaction processing service that is implemented on a production computer system. The evaluation computer system may perform, in real-time, tests on a particular product using the transaction details. The evaluation computer system may then store output from the tests that are performed using the transaction details.

Product evaluation using transaction details from a production system

Methods and systems are presented for testing software applications in a production-like environment that simulates real-world failures of production environments. A production environment has production applications and databases configured to process user requests from users for conducting transactions with a service provider. A testing system provides an intermediate interface that enables a software application operating in the test environment to access at least one of a production application or a production database. The intermediate interface can be configured based on different failure configurations to simulate production component failures in the production environment. Failure injection and randomized failure modes can be employed, including for network-related failures (latency, dropped packets, connections, etc.) that might occur in the production environment.

Systems and methods for testing software applications

Systems and methods that describe a graph database system with an online component and an offline component, are provided. Write events that modify a first graph in a real-time graph database included in the online component are received. Graph logs that include changes to the first graph in the real-time graph database caused by the write events are generated. The graph logs are transmitted to an offline component of the graph database system in a chronological order. A second graph in the offline component is modified using the graph logs. The first graph and the second graph are instantiated using a graph schema.

Graph database system

Techniques are disclosed relating to scheduling program tasks in a server computer system. An example server computer system is configured to maintain first and second sets of task queues that have different performance characteristics, and to collect performance metrics relating to processing of program tasks from the first and second sets of task queues. Based on the collected performance metrics, the server computer system is further configured to update a scheduling algorithm for assigning program tasks to queues in the first and second sets of task queues. In response to receiving a particular program task associated with a user transaction, the server computer system is also configured to select the first set of task queues for the particular program task, and to assign the particular program task in a particular task queue in the first set of task queues.

Adaptive program task scheduling to blocking and non-blocking queues

Methods and systems for processing incoming data in real-time are described herein. The incoming data is processed in real-time to generate data records that may be improved over time, for example, by automatically correcting inaccurate data in the records. In some embodiments, when data is received, a real-time process is initially performed on the received data under a first time constraint to produce first data for a data record. Subsequently, one or more non-real-time processes are then performed on the received data under a second time constraint to produce second data for the data record. The second data may be used to update the data record, for example, to correct any inaccuracy caused by the real-time process of the received data. Preferably, the second time constraint is longer than the first time constraint.

Self-healing real-time data processing

A method is provided that includes accessing, by a server provider server of a service provider, a database storing associations between network addresses and locations. Additionally, the method includes determining a subset of the database corresponding to a first network address, each association included in the subset corresponding to an association between the first network address and a respective location. The method also includes in response to determining that the subset of the database satisfies one or more clustering criteria, calculating a representative location corresponding to the first network address, and storing an association between the first network address and the representative location in a second database.

Efficient risk model computations

Technologies relating to determining data variable dependencies to facilitate code execution are disclosed. An example method includes: identifying a set of programming statements having a plurality of data parameters; identifying first data parameters associated with a first programming statement in the set of programming statements; determining one or more parameter dependencies associated with the first data parameters; and determining, based on the one or more parameter dependencies, a first execution performance of the first programming statement. The method may further include: determining a second execution performance of the second programming statement and scheduling execution of the first programming statement and of the second programming statement based on the first and second execution performances. For example, at least a portion of the first programming statement is executed in parallel to executing the second programming statement, or the first programming statement and the second programming statement are executed in a predefined sequence.

Automatically determining data dependencies to facilitate code execution

A system and method for providing an interactive shopping experience via webcam is disclosed. A particular embodiment includes enabling a user to select from a plurality of items of virtual apparel; obtaining an image of a user via a web-enabled camera (webcam); using a data processor to perform facial detection on the image to isolate an image of a face of the user; estimating the user's position according to a position and a size of the image of the user's face; modifying an image corresponding to the selected item of virtual apparel based on the size of the image of the user's face; and auto-fitting the modified image corresponding to the selected item of virtual apparel to the image of the user's face.

System and method for providing an interactive shopping experience via webcam

Growing community of inventors

Palo Alto, CA, United States of America

Xiaohan Yun