Oracle International Corporation

Facebook, Inc.

Venkateshwaran Venkataramani

Karl Dias

Venkatasiva Prasad Chakkabala

Mark V Marchukov

George Cabrera, Iii

Jonathan D Klein

Leonidas Galanis

Yujun Wang

Mark Charles Ramacher

Graham Wood

Dmitri Petrov

Benoit Dageville

Uri Shaft

Leng Leng Tan

Juan R Loaiza

Shivani Gupta

Gary C Ngai

Sanjay Kaluskar

John Mark Beresniewicz

Yair Sarig

Chao Liang

Marcus Fallen

Ajith Kumar Mysorenagarajarao

Sushil Kumar

Hailing Yu

Richard Sarwal

Mike Feng

Balasubrahmanya Kuchibhotla

Amir Valiani

Leng Tan

In one embodiment, a system includes a database operative to maintain a social graph of an online social network, a leader cache layer, a plurality of servers, and a follower cache layer comprising one or more follower cache clusters, where each follower cache cluster maintains at least a portion of the social graph, and where the follower cache layer is operative to receive a command from the servers with instructions for updating a portion of the social graph, send the command to one of the leader cache layers, receive an acknowledgment of the command from one of the leader cache layers and a request to update; and update one or more of the follower cache clusters storing the portion of the social graph associated with the command.

Distributed cache for graph data

In one embodiment, a system includes a database; and a cache layer comprising one or more leader cache nodes, the one or more leader cache nodes operative to: communicate graph information between a follower cache layer and the database; receive a request from one of the follower cache nodes to store graph information in the database; update the database storing the graph responsive to the request; and update one or more of the follower cache nodes storing the portion of the graph associated with the request.

In one embodiment, a system comprises a database operative to maintain a social graph, a leader cache layer comprising one or more leader cache clusters, and a follower cache layer comprising one or more follower cache clusters, wherein the leader cache layer is operative to, communicate social graph information between the follower cache cluster and the database, wherein each follower cache cluster maintains at least a portion of the social graph, receive a request from one of the follower cache clusters to store social graph information in the database, update the database storing the social graph responsive to the request, and update one or more of the follower cache clusters storing the portion of the social graph associated with the request.

In one embodiment, a system includes a database; and a cache layer comprising one or more cache nodes, the one or more cache nodes operative to: maintain in a memory one or more data structures storing association information describing associations between nodes in a graph a plurality of distributed cache clusters for storing information in the form of a graph, the graph comprising a plurality of nodes, each uniquely identified by a node identifier, and edge information indicating associations between nodes; respond to queries for associations between nodes in the graph by accessing the memory; and forward other queries to the database for processing.

In one embodiment, a system includes a database operative to maintain a social graph; and a cache layer comprising a plurality of data shards, the data shards being divided among a plurality of cache nodes of a cache layer, wherein each data shard is operative to: maintain at least a portion of the social graph; receive a request to store associations between a first graph node and a second graph node of the social graph, wherein the first and second graph nodes are identified by a first and second unique identifier, respectively, the first and second graph nodes each corresponding to a particular data shard of the plurality of data shards; and update, responsive to the request, the data shard corresponding to the first graph node and the data shard corresponding to the second graph node.

Distribution cache for graph data

A distributed caching system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

A method and apparatus for capturing database system workload and replaying that workload in a database system is provided. According to one aspect, in order to subject a test database system to the same workload to which the production database system actually would be subjected, a database server in the production system captures and records workload that the database server receives from external entities. This captured workload is processed. Processes external to a database server in the test database system send the processed workload to that database server. As a result, the test database system is subjected to the same workload to which the production database system originally was subjected. The foregoing technique permits a database administrator to determine how the production database system will fare if the difference that is present in the test database system is introduced into the production database system.

Filtering workload for database replay

Methods, systems, and computer program products for monitoring database queries and executions is disclosed. The query syntax may conform to the structured query language (SQL). The approach supports various performance statistics to be monitored at each step of the query statement's execution plan and for each row processed in order to meet requirements of a near real-time query monitoring solution. Such statistics include timing information plus some miscellaneous statistics like the number of rows processed, the amount of memory used, the amount of data spilled to disk, etc.

Method and mechanism for out-of-the-box real-time SQL monitoring

One or more usage models are provided for a database. Each usage model includes a set of rules that are used to analyze database performance. A usage model in one or more usage models is determined. Database information is determined based on the usage model. The database information is then analyzed based on rules associated with the usage model. One or more performance problems are determined based on the analysis.

Automatic database diagnostic usage models

Client-driven functionally equivalent database replay

Database workload capture and replay architecture

A diagnosability system for automatically collecting, storing, communicating, and analyzing diagnostic data for one or more monitored systems. The diagnosability system comprises several components configured for the collection, storage, communication, and analysis of diagnostic data for a condition detected in monitored system. The diagnosability system enables targeted dumping of diagnostic data so that only diagnostic data that is relevant for diagnosing the condition detected in the monitored system is collected and stored. This in turn enables first failure analysis thereby reducing the time needed to resolve the condition detected in the monitored system.

Diagnosability system

Growing community of inventors

Sunnyvale, CA, United States of America

Venkateshwaran Venkataramani