Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
semihsalihoglu
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
61.
▲
Factorization and Great Ideas from Database Theory Part 1
(kuzudb.com)
16 points
by
semihsalihoglu
4y ago
|
0 comments
62.
▲
by
semihsalihoglu
4y ago
I agree. As I say in the blog, there is no perfect data model. RDF is great fit for certain things, e.g., when storing dbpedia-like datasets, and doing "automatic" advanced OWL reasoning over it by implementing OWL rules. For exam
63.
▲
by
semihsalihoglu
4y ago
provide a lesson -> provide a proof.
64.
▲
by
semihsalihoglu
4y ago
I can't say something very insightful as I don't know it closely. My shallow understanding was that it is a modern json/xml-like dbms supporting a nested object (tree-like) model and path-expression-based query languages of s
65.
▲
by
semihsalihoglu
4y ago
This is actually a very good point and unfortunately formal verification is not the current norm when developing DMBSs or complex systems software. If you asked how do you know DBMS X is correctly implementing snapshot isolation, no one wil
66.
▲
by
semihsalihoglu
4y ago
I tried to talk about "what it should do" at a higher-level. As a comparison, if you want to read something that is similar in spirit but discusses "how GDBMSs should do" certain things, you can look at the link I have i
67.
▲
by
semihsalihoglu
4y ago
We are building one ( https://github.com/kuzudb/kuzu )! :)
68.
▲
by
semihsalihoglu
4y ago
Interesting. I think the required computation is different for 2 different cases you have in your post. Case 1: If you have = relationships (let's call the type of the relationship eq). Then what you need is to identify weak connectivi
69.
▲
by
semihsalihoglu
4y ago
Yes, this will be interesting to see. This is the SQL/PGQ extension that's coming in 2023. On the one hand, as I articulate in my post, GDBMSs are based on relational principles, so building a system that can seamlessly query in r
70.
▲
by
semihsalihoglu
4y ago
Agreed.
71.
▲
by
semihsalihoglu
4y ago
I realized, I forgot to complete my sentence here: "...because of this every semi-structured graph model historically has been extended with a schema." Examples include, XML and RDF. More relevant to this discussion: there is an o
72.
▲
by
semihsalihoglu
4y ago
I don't quite follow the question here but to clarify one thing: Kùzu is currently integrating Arrow not as a core storage structure but as a file format from which we can ingest data. We are writing Kùzu's entire storage, so it&#
73.
▲
by
semihsalihoglu
4y ago
I think it's a mistake for any DBMS to not support a schema. I bet this hurts Neo4j a lot and no question that this is a mistake. In fact some GDBMS, including Kùzu or TigerGraph supports a schema. I think MemGraph does too, though I m
74.
▲
by
semihsalihoglu
4y ago
When you insert the Transfer records in my example, you indicate that they are "edges/relationships" between "Account" node records. The system interprets the values in those records implicitly as foreign keys to th
75.
▲
What Every Competent Graph DBMS Should Do
(kuzudb.com)
85 points
by
semihsalihoglu
4y ago
|
35 comments