ggleason

5 ms·

1.
LLM Classifier Bootstrapping(vectorlink.ai)
1 points by ggleason 2y ago|1 comments
2.
by ggleason 2y ago
How to use supervised learned classifiers without a training set by using LLMs.
3.
by ggleason 2y ago
It would be extremely handy to have a document store / graph database which had row polymorphism. I started writing a prototype, but unfortunately never got there. I wonder if any such things already exist?
4.
by ggleason 3y ago
Those are all interesting ideas. For the index structure itself you can use succinct dynamic data structures to reduce the size. The bulk loading approach is particularly amenable to use of succinct data structures as the node-vectors in a
5.
by ggleason 3y ago
TerminusDB founder here. TerminusDB is now at the absolute outer edge of compact data representation. Neo4j is literally 10 times more space for the same data meaning that you'll need 10 times as much memory for a big graph. Succinct d
6.
by ggleason 3y ago
Oh, I should probably mention a blog I wrote describing how it works: https://github.com/terminusdb/technical-blogs/blob/main/blog...
7.
by ggleason 3y ago
I was looking at various forms of indexing solutions to solve search and clustering problems with TerminusDB for clients. When I compared solutions against embeddings from LLMs, they LLMs were just far easier to work with and got much bette
8.
by ggleason 3y ago
TerminusDB represents the data using succinct data structures which reduces the required memory substantially over many other representations. Each branch needs to be capable of being loaded into memory completely - but individual revisions
9.
by ggleason 3y ago
Yeah, it's really unfortunate that these amazing advances in datalog don't make it into general purpose languages.
10.
by ggleason 3y ago
> Datomic Cloud is slow, expensive, resource intensive, designed in the baroque style of massively over-complicated CloudFormation astronautics. Hard to diagnose performance issues. Impossible to backup. You should give TerminusDB a go (
11.
by ggleason 4y ago
Hi this is Gavin and I founded TerminusCMS (terminusdb.com). CMS stands for "content management system" and headless means API-based, with no restrictions over where you use the content. Devs are you folks. Existing headless CMS t
12.
TerminusDB Internals Part 3: Sorting Every Sort of Thing(terminusdb.com)
1 points by ggleason 4y ago|1 comments
13.
by ggleason 4y ago
This blog gives some details of how to order a wide variety of different data types using lexical embeddings. This is very useful for TerminusDB as we use dictionary structures to represent ids, but it would also be relevant in radix trees
14.
by ggleason 4y ago
Yes, but the low level memory layout and search iterators are written in rust.
15.
by ggleason 4y ago
Quite speedy, especially when looking at relatively long chains in the graph.
16.
TerminusDB Internals: Mutation in a Graph Database(terminusdb.com)
25 points by ggleason 4y ago|6 comments
17.
by ggleason 4y ago
This is my account of how we took the idea of succinct data structures, and added mutability, thereby getting something which allows for git-like functionality, but also fast query and compact memory footprint.
18.
by ggleason 4y ago
Well, I do know SPARQL :D TerminusDB uses a datalog under the hood, but GraphQL can expose a lot of datalog like power with the right interface. Ultimately we want to have named parameteric queries in datalog exposing "pseudo-edges&quo
19.
GraphQL RDF Bridge in TerminusDB Using Rust's Juniper Library(terminusdb.com)
31 points by ggleason 4y ago|5 comments
20.
by ggleason 4y ago
Juniper helped us implement a GraphQL / RDF bridge in about two weeks.
21.
by ggleason 4y ago
I am of the same opinion. TerminusDB uses a data log for query and update. I think it will catch on. And in the future we will even be able to add constraints - which can be a real superpower in querying graphs.
22.
by ggleason 4y ago
Well, in one sense the are directly interconvertable. The documents in TerminusDB are elaborated to JSON-LD internally during type-checking and inference. However, it's not just a question of whether one can be made into another. The u
23.
by ggleason 4y ago
I wrote it from scratch 2 days ago.
24.
by ggleason 4y ago
That's discussed in the article though. The open world assumption is untenable. Having shareable interoperable schemata that can refer to each-other safely would be a god send however. And that's what is currently very hard but ne
25.
by ggleason 4y ago
That's a very good point re SAT/SMT. F* ( https://www.fstar-lang.org/ ) has done truly amazing things by making use of them, and it's great to be able to get sophisticated correctness checks while doing basical
26.
by ggleason 4y ago
Prolog is still the best query language out there. If it had as much attention as other languages like python or javascript, we'd have some real space-age programming systems.
27.
by ggleason 4y ago
TerminusDB CTO here. Echoing what triska said, CLP(ℤ) and friends are some of the most under-appreciated aspects of prolog implementations. I'm amazed that programmers still don't have access to CLP when trying to do scheduling an
28.
by ggleason 5y ago
But actually git does use diff and patch. It just doesn't store objects as diffs and patches. Whenever you do a cherry pick operation or rebase operation it synthesises patches. You can try yourself by cherry-picking a merge commit.
29.
by ggleason 5y ago
It absolutely does sound like Operational Transforms! There are a lot of similarities, and in many cases patch re-ordering for specific ordered fields will require the sort of index manipulations that are common in OT - a sort of commutator
30.
by ggleason 5y ago
We use JSON-patch/diff internally for our rebase operation. We looked at implementing it on rfc6902 but it turned out to be awkward because of the path descriptions, and insufficiently rich for the kinds of patches that we needed. We c

More ›