Future Wei Technologies, Inc.

Symantec Operating Corporation

Symantec Corporation

Huawei Technologies Co., Limited

Ron-Chung Hu

Jian Li

Masood Mortazavi

Jiafeng Zhu

HanCheng Hsiung

Mengmeng Chen

Lei Rao

Qiang Li

Barry Holroyd

Chi Young Ku

Mingyi Zhang

Xuan Song

Aniket Adnaik

Chi Yong Ku

Ahmad Ghazal

Amrish K Lal

Vivek M Chandran

Min Qiu

Ravil A Desai

Fang Cao

Zijia Wang

Guangyu Shi

A query processing device includes a communication interface accessing a database and database catalog, a memory storing instructions, and a processor coupled to the memory and the communication interface. The processor executes the instructions to parse a query and generate first and second execution plans for the query, retrieve respective previously determined cardinality values for previously executed logical steps of the first and second execution plans from the database catalog, select an execution plan from the first execution plan or the second execution plan, the selected execution plan having a lower cost based on the previously determined cardinality values, and execute the selected execution plan on data accessed from the database. The query processing system stores actual cardinality values determined during the execution of the logical steps in the database catalog for use by subsequent queries. The query processing device, therefore, re-uses previously determined cardinality values.

Query processing using logical query steps having canonical forms

A method includes traversing a query plan tree having multiple nodes, each node representative of an operation on data that is the subject of a query, to extract multiple pipelines from the query plan tree, identify dependencies between the multiple extracted pipelines, and provide a pipeline dependent tree based on the dependencies between the multiple extracted pipelines for execution of the query by multiple processors.

Pipeline dependent tree query optimizer and scheduler

A method for updating a column store database and includes establishing a row store database, wherein each row comprises a plurality of attributes. The method includes establishing a column store database including attribute vectors corresponding to at least one attribute in the row store, wherein each attribute vector includes data used to satisfy at least one of previously received analytic queries. The method includes collecting a SQL change statements beginning from a synchronization point indicating when the row store database and the column store database are synchronized, and continuing until an analytic query is received. The method includes sending the plurality of SQL change statements to the column store database upon receipt of the analytic query for updating the column store database for purposes of satisfying the query, wherein the analytic query is directed to a queried range of primary key attributes in the plurality of attributes.

Statement based migration for adaptively building and updating a column store database from a row store database based on query demands using disparate database systems

A method implemented in a network element (NE) configured to operate as an Ensemble Information Broker (EIB) within a distributed data and energy storage internet architecture comprising collecting energy data indicating a flow of energy, an amount of energy consumed and generated by devices; collecting human presence data; collecting human activity data; predicting future energy consumption requirements and generation by employing prediction algorithms and analyzing the collected data; generating a set of control commands based on the predicted future energy consumption requirements and energy generation as applied to a cost function; transmitting the set of control commands to the corresponding devices; transmitting a broadcast message to determine an external NE to establish as a friend connection based on a user preference; transmitting a request to establish a friend connection with the determined NE; and transmitting the human presence data to the external NE when the friend connection is established.

Communication between distributed information brokers within a data and energy storage internet architecture

A method of dynamically computing an optimal materialization schedule for each column in a column oriented RDBMS. Dynamic column-specific materialization scheduling in a distributed column oriented RDBMS is optimized by choosing a materialization strategy based on execution cost including central processing unit (CPU), disk, and network costs for each individual exchange operator. The dynamic programming approach is computationally feasible because the optimal schedule for a sub-plan is path independent.

System and method for column-specific materialization scheduling

A system and method for performing self-learning for adaptively achieving passenger comfort enhancement in an autonomous vehicle. The system comprises a plurality of sensor inputs. Each sensor input provides data representative of voice responses and image responses from a passenger in the vehicle. A controller is coupled to the plurality of sensor inputs. The controller generates and updates a reward function that includes a plurality of driving state transitions. The reward function is updated based on destination information and the data representative of the voice and image responses. The controller further generates a goal function that determines an optimized driving state transition updates the goal function based on the updated reward function and a previous goal function. The controller also generates a vehicle speed control signal, based on the updated goal function, to control the speed of the autonomous vehicle.

Adaptive passenger comfort enhancement in autonomous vehicles

A multiple disk loader apparatus includes a plurality of rods. Each rod has a pair of pins extending radially from a side of the rod. The pair of pins are spaced circumferentially around the rod with respect to each other. Each pin has a top surface wherein the top surface of a first pin is longitudinally separated from the top surface of a second pin by a predetermined gap. A rotation device is coupled to the plurality of rods. The rotation device rotates the plurality of rods individually through a respective predetermined arc and in a respective rotational direction in order to extract a disk stack from storage and to separate a disk from the stack to load into a drive.

Multiple disk loader apparatus

Procedures and systems may be used for assigning data partitions to data-processing host computers, for example, to initially assign data partitions at the outset of a large data-processing job or during failover measures taken in response to a failed host in a share-nothing database management system (SN-DBMS). In one implementation, a method of managing exclusive access to a data partition within a database system assesses a first host and a second host that have exclusive access to a first and second data partition, respectively, within a database system. The method assigns exclusive access of the data partition to one of the first and second hosts based on factors that may include the processing powers of first and second the hosts, and on processing requirements (such as data quantity and data criticalness) for data on the first and second data partitions.

Automated optimal workload balancing during failover in share-nothing database systems

A method for increasing the QoS in a data center. The method can be employed in first and second components of the data center. In one embodiment, the method includes a first component of the data center receiving first and second requests. The first component generates first and second priority values corresponding to the first and second requests, respectively. The first component processes the first and second requests to generate third and fourth requests, respectively, wherein the first request is processed before the second request if the first priority value is numerically greater than the second priority value, or the first request is processed after the second request if the first priority value is numerically less than the second priority value. A second component of the data center receives the third and fourth requests. The second component generates third and fourth priority values corresponding to the third and fourth requests, respectively. The second component processes the third and fourth requests wherein the third request is processed before the fourth request if the third priority value is numerically greater than the fourth priority value, or the third request is processed after the fourth request if the third priority value is numerically less than the fourth priority value. In one preferred embodiment, if the first priority value is numerically greater than the second priority value, then the third priority value generated by the second component should not be numerically less than the fourth priority value generated by the second component.

Model and method of an N-tier quality-of-service (QOS)

Determining an application user as a source of database activity is disclosed. A communication is received. A thread that is configured to handle the communication is associated with an application user with which the communication is associated. The application user is associated with a database query generated by the thread.

Growing community of inventors

Palo Alto, CA, United States of America

Ron-Chung Hu