Skip to content
Snippets Groups Projects
Commit 7b647f70 authored by Manish R Jain's avatar Manish R Jain
Browse files

small typos

parent 20f43611
Branches
Tags
No related merge requests found
...@@ -37,7 +37,7 @@ DGraph is an open source, distributed, low-latency graph serving system written ...@@ -37,7 +37,7 @@ DGraph is an open source, distributed, low-latency graph serving system written
Handle shard splits, shard merges, and shard movement. Handle shard splits, shard merges, and shard movement.
- *Highly*Availability*: Automatic data replication and failover. - *Highly*Availability*: Automatic data replication and failover.
- *Resilience*: Automatically handle server failures, and reassignment to healthy servers. - *Resilience*: Automatically handle server failures, and shard reassignment to healthy servers.
* Implementation * Implementation
...@@ -71,7 +71,7 @@ DGraph is an open source, distributed, low-latency graph serving system written ...@@ -71,7 +71,7 @@ DGraph is an open source, distributed, low-latency graph serving system written
[Network call] [Network call]
- Pick server serving posting list `name`. - Pick server serving posting list `name`.
- For each uid_i, seek to `name,`uid_i`, and return. - For each uid_i, seek to `name, uid_i`, and return.
- 3 RT network calls in total - 3 RT network calls in total
- Network calls: O(m) where m = depth + attributes in query - Network calls: O(m) where m = depth + attributes in query
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment