Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kendallgclark
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
Announcing Release of Stardog 5: World's Leading Knowledge Graph Platform
(stardog.com)
1 points
by
kendallgclark
9y ago
|
0 comments
62.
▲
Stardog graph db says goodbye to Java GC
(blog.stardog.com)
10 points
by
kendallgclark
10y ago
|
0 comments
63.
▲
Controlling chaos in an HA cluster
(blog.stardog.com)
4 points
by
kendallgclark
10y ago
|
0 comments
64.
▲
by
kendallgclark
10y ago
What a weird coincidence that a very close election was lost because of the writer's pre-existing hobby horse.
65.
▲
by
kendallgclark
10y ago
All of our customers; see http://stardog.com/ for the notable ones. (Hint: it's a quietly useful mature technology.)
66.
▲
by
kendallgclark
11y ago
Wow. That's just patently false. Good job bro!
67.
▲
by
kendallgclark
11y ago
We sell Developer licenses to developers, indie or not, all the time. Send email to sales@complexible.com! :)
68.
▲
by
kendallgclark
11y ago
http://stardog.com/
69.
▲
by
kendallgclark
11y ago
It supports both property graphs and semantic graphs seamlessly, plus a bunch of other powerful features Neo4j can't touch like virtual graphs ( http://docs.stardog.com/#_virtual_graphs ), integrity constraints ( http:&#
70.
▲
by
kendallgclark
11y ago
Combines property graph (Apache TinkerPop 3 and Gremlin) with RDF, SPARQL, OWL, and rules... Graph all teh things!
71.
▲
Stardog 4: Polyglot Graph Database
(stardog.com)
14 points
by
kendallgclark
11y ago
|
4 comments
72.
▲
by
kendallgclark
11y ago
Supports semantic graphs (RDF, SPARQL, OWL, rules) and TinkerPop 3, Gremlin, property graphs interchangeably.
73.
▲
Stardog 4: Polyglot Graph Database
(stardog.com)
7 points
by
kendallgclark
11y ago
|
2 comments
74.
▲
Stardog 3.1: Enterprise Graph Database
(stardog.com)
2 points
by
kendallgclark
11y ago
|
1 comments
75.
▲
by
kendallgclark
12y ago
Wait and see! :)
76.
▲
by
kendallgclark
12y ago
TOMI Celeste is a lot more interesting.
77.
▲
by
kendallgclark
12y ago
Well, I'm a vendor in the space so I like my implementation: http://stardog.com/ -- and yes we've "tried it" with 10s of billions of edges. Worst cases are prevented from DOSing by having query managemen
78.
▲
by
kendallgclark
12y ago
You can do this with user-defined rules in some RDF databases. Stardog(.com) supports it nicely.
79.
▲
by
kendallgclark
12y ago
Aristotelian distinction between essential and accidental properties is probably what yr thinking about here, but that's not really the same distinction as the one between data and metadata.
80.
▲
by
kendallgclark
12y ago
Large-scale, complex information integration at big companies every day. The forgotten "V" of Big Data, Variety, i.e., schema complexity, is the sweet spot of semantic technology.
81.
▲
by
kendallgclark
12y ago
SPARQL is similar to non-recursive Datalogˆnot, but that's a subset of full Prolog. SPARQL is a query language, not a full-on programming language as Prolog is.
82.
▲
by
kendallgclark
12y ago
That's false. Several practical implementations of OWL and RDF are based on OWA. At least one is based on CWA and OWA.
83.
▲
by
kendallgclark
12y ago
SPARQL is PSPACE-complete. Worst case complexity and "fast in practice" aren't really the same thing at all. I suspect average case complexity for SPARQL is much better, which is backed up by several reasonably peformant impl