Hi Alex,
On Wed, Oct 4, 2017 at 3:03 AM, Alex wrote:
> Well, maybe I am too optimistic...
>
> Regarding the rules, I am investigating the following (not impressive):
> https://github.com/threatgrid/naga
>
Atomese is definitely inspired by datalog. About 10 years ago, we actually
had a datalog A
Well, maybe I am too optimistic...
Regarding the rules, I am investigating the following (not impressive):
https://github.com/threatgrid/naga
https://link.springer.com/chapter/10.1007/978-3-319-21542-6_14
https://www.google.com/patents/US20150302300
Rules over graph database is far less popular t
On 10/03/2017 08:29 PM, Alex wrote:
source projects and tools for matcher in miner and I have found even one
open source project for rule engine that is implemented on top of graph
Interesting, which one?
I just wanted to say that maybe relying on (and contributing to) open
source projects f
> Ou focus is NOT to be "just" a graph storage system, but a graph storage
> system with many additional services (the MMT page lists many of these)
>
> Our big ones are:
> * the pattern matcher
> * the pattern miner
> * the rule engine
>
> Our smaller ones are:
> * a sparse matrix subsystem
> *
Oh, and I forgot to mention: opencog atoms are small -- maybe a few hundred
bytes or so. The performance of most popular web databases totally sucks
when the data is that small -- they are tuned for storing mp3's and jpeg
files, which are megabytes each, and they are great for that - but they
suck
Hi Amirouche,
Let me top-post, it will be easier. First: bulk load and bulk save of the
atomspace is part of the API, but it's very blunt and ugly and useless. I
never-ever bulk-load or bulk-save my data.
The more fine-grained API allows:
* Specific atoms to be loaded (i.e. the values, truthval
Héllo all,
On Sun, Oct 1, 2017 at 6:09 AM Linas Vepstas wrote:
> Hi Ed,
>
> Here's my experience and I would love to get help with it. I am now
> building graphs that are so large, that they no longer fit into RAM (on a
> machine with 256GB RAM). I'm slowly moving to algorithms that can page i
Hi Ed,
Thanks. It turns out that I have glanced at JanusGraph in the past. The
main landing page for JanusGraph does make it sound very impressive.
Here's my experience and I would love to get help with it. I am now
building graphs that are so large, that they no longer fit into RAM (on a
machin
JanusGraph is just a graph store. It has no available reasoners.
It is best developed for Java and is weak for Python. As far as I can tell
there is no QA process.
JanusGraph is developed largely by IBM and Google as a replacement for
Titan which has been taken proprietary.
IBM would benefi
