Focused crawls are collections of frequently-updated webcrawl data from narrow (as opposed to broad or wide) web crawls, often focused on a single domain or subdomain.
@@ -123,7 +123,7 @@ All the instructions below are based on a Debian/Ubuntu system.
Download and install [Go 1.6 from here](https://golang.org/dl/).
###Install RocksDB
DGraph depends on [RocksDB](https://github.com/facebook/rocksdb) for storing posting lists.
Dgraph depends on [RocksDB](https://github.com/facebook/rocksdb) for storing posting lists.
```
# First install dependencies.
@@ -143,8 +143,8 @@ This would install RocksDB library in `/usr/local/lib`. Make sure that your `LD_
export LD_LIBRARY_PATH="/usr/local/lib"
```
###Install DGraph
Now get [DGraph](https://github.com/dgraph-io/dgraph) code. DGraph uses `govendor` to fix dependency versions. Version information for these dependencies is included in the `github.com/dgraph-io/dgraph/vendor` directory under the `vendor.json` file.
###Install Dgraph
Now get [Dgraph](https://github.com/dgraph-io/dgraph) code. Dgraph uses `govendor` to fix dependency versions. Version information for these dependencies is included in the `github.com/dgraph-io/dgraph/vendor` directory under the `vendor.json` file.
```
go get -u github.com/kardianos/govendor
@@ -221,7 +221,7 @@ using SSD persistent disk. Instance 2 took a bit longer, and finished in 15 mins
Note that `stw_ram_mb` is based on the memory usage perceived by Golang. It currently doesn't take into account the memory usage by RocksDB. So, the actual usage is higher.
###Server
Now that the data is loaded, you can run the DGraph servers. To serve the 3 shards above, you can follow the [same steps as here](#multiple-distributed-instances).
Now that the data is loaded, you can run the Dgraph servers. To serve the 3 shards above, you can follow the [same steps as here](#multiple-distributed-instances).
Now you can run GraphQL queries over freebase film data like so:
```
curl localhost:8080/query -XPOST -d '{
@@ -284,7 +284,7 @@ Consecutive runs of the same query took much lesser time (80 to 100ms), due to p
##Queries and Mutations
You can see a list of [sample queries here](https://discuss.dgraph.io/t/list-of-test-queries/22).
DGraph also supports mutations via GraphQL syntax.
Dgraph also supports mutations via GraphQL syntax.
Because GraphQL mutations don't contain complete data, the mutation syntax uses [RDF NQuad format](https://www.w3.org/TR/n-quads/).
```
mutation {
@@ -298,7 +298,7 @@ mutation {
```
You can batch multiple NQuads in a single GraphQL query.
DGraph would assume that any data in `<>` is an external id (XID),
Dgraph would assume that any data in `<>` is an external id (XID),
and it would retrieve or assign unique internal ids (UID) automatically for these.
You can also directly specify the UID like so: `_uid_: 0xhexval` or `_uid_: intval`.
@@ -320,7 +320,7 @@ query {
The query portion is executed after the mutation, so this would return `greg` as one of the results.
##Contributing to DGraph
##Contributing to Dgraph
- See a list of issues [that we need help with](https://github.com/dgraph-io/dgraph/issues?q=is%3Aissue+is%3Aopen+label%3Ahelp_wanted).
- Please see [contributing to Dgraph](https://discuss.dgraph.io/t/contributing-to-dgraph/20) for guidelines on contributions.
-*Alpha Program*: If you want to contribute to Dgraph on a continuous basis and need some Bitcoins to pay for healthy food, talk to us.
@@ -334,5 +334,5 @@ The query portion is executed after the mutation, so this would return `greg` as
- [Lightening Talk](http://go-talks.appspot.com/github.com/dgraph-io/dgraph/present/sydney5mins/g.slide#1) on 29th Oct, 2015 at Go meetup, Sydney.
##About
I, [Manish R Jain](https://twitter.com/manishrjain), the author of DGraph, used to work on Google Knowledge Graph.
I, [Manish R Jain](https://twitter.com/manishrjain), the author of Dgraph, used to work on Google Knowledge Graph.
My experience building large scale, distributed (Web Search and) Graph systems at Google is what inspired me to build this.
This is a post to announce DGraph, an open source, distributed, scalable native graph database. DGraph is designed to handle terabytes of structured data, over commodity hardware.
This is a post to announce Dgraph, an open source, distributed, scalable native graph database. Dgraph is designed to handle terabytes of structured data, over commodity hardware.
The design and inspiration is drawn from my experiences working in Google Knowledge Infra group. DGraph is under active development, and is looking to hire talented engineers.
The design and inspiration is drawn from my experiences working in Google Knowledge Infra group. Dgraph is under active development, and is looking to hire talented engineers.
You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.
We use optional third-party analytics cookies to understand how you use GitHub.com so we can build better products.
Learn more.
We use optional third-party analytics cookies to understand how you use GitHub.com so we can build better products.
You can always update your selection by clicking Cookie Preferences at the bottom of the page.
For more information, see our Privacy Statement.
Essential cookies
We use essential cookies to perform essential website functions, e.g. they're used to log you in.
Learn more
Always active
Analytics cookies
We use analytics cookies to understand how you use our websites so we can make them better, e.g. they're used to gather information about the pages you visit and how many clicks you need to accomplish a task.
Learn more