-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Upgrading Apache HttpClient from 4.0.1 to 4.1.1 eliminated the expect…
…-continue handshake which was causing script eval requests to take very much longer than they needed to. Jig is much snappier now.
- Loading branch information
Showing
4 changed files
with
47 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,36 @@ | ||
// Name of the triple store | ||
store.name | ||
|
||
// Number of triples in the store | ||
store.size | ||
|
||
// Look at a few triples | ||
g.triples.limit(10) | ||
|
||
// Labels (predicates) only | ||
g.triples.limit(10).label | ||
|
||
// Find more labels | ||
g.triples.limit(100000).label.distinct | ||
|
||
// Pick out a single label (rdf:type in this case) | ||
type = g.triples.limit(100000).label.distinct[6] | ||
|
||
// Find distinct types | ||
g.triples(null, type, null).head.limit(100000).distinct | ||
|
||
// Let's look at the "drugs" type | ||
drugs = g.triples(null, type, null).head.limit(100000).distinct[1] | ||
|
||
// Here are some instances of "drugs" | ||
d = g.v(drugs).inE(type).limit(10).tail | ||
|
||
// Pick a drug at random, find its neighborhood as a ranked list | ||
d0 = g.v(d[0]).nearby(2).aggr | ||
|
||
// Do the same for another node | ||
d9 = g.v(d[9]).nearby(2).aggr | ||
|
||
// Find the intersection (entry-wise product) of the two neighborhoods. | ||
// These are nodes "nearby" to both nodes in the graph | ||
intersect(d0, d9) |