semihsalihoglu

7 ms·

31.
by semihsalihoglu 3y ago
The worry is still easy to understand I think. Suppose you are a programmer or a project manager and you have come to think that your skills are valuable, i.e., they are rare and someone will pay for those skills so you find opportunities t
32.
by semihsalihoglu 3y ago
I think the sentiment roughly translates to AI, one way or another, replacing whatever it is you were doing for work and making your contribution obsolete. It is surprising that he genuinely seems to worry that even his contributions can be
33.
Musk: How do we find meaning in life if A.I. can do your job better?(cnbc.com)
3 points by semihsalihoglu 3y ago|6 comments
34.
by semihsalihoglu 3y ago
I tend to find the discussion around AI, AGI, ChatGPT doomsday somewhat incoherent and try not to follow them. But, I found Elon Musk's reaction in this interview to the question of "What would be your advice to children in the er
35.
by semihsalihoglu 3y ago
If you want to listen to a very illuminating episode on law firms hiring based on a handful of firms, how bad this is, I highly recommend this episode of Malcolm Gladwell's podcast: https://www.pushkin.fm/podcasts/
36.
by semihsalihoglu 3y ago
I hadn't heard for this but this sounds very similar to the definition of polynomial hierarchy: https://en.wikipedia.org/wiki/Polynomial_hierarchy What has fascinated me (if I'm not mistaken) when I was learn
37.
Remembering Edsger Dijkstra on His Birthday 05/11(amturing.acm.org)
3 points by semihsalihoglu 3y ago|1 comments
38.
by semihsalihoglu 3y ago
Dijkstra is a big figure in CS and will be taught on campuses for the foreseeable future. Just ran into this link from ACM's Twitter. The bio contains interesting quotes from him, e.g.: "The question of whether computers can think
39.
by semihsalihoglu 3y ago
I recently ran into this seminal 1973 paper again after more than a decade from the first time I had read it, and think it is a very interesting read for people interested in historical CS reading. This is research conducted at IBM in 70s o
40.
Logical Reversibility of Computation and Its Energy Implications [pdf](dna.caltech.edu)
2 points by semihsalihoglu 3y ago|1 comments
41.
by semihsalihoglu 3y ago
I wonder if anyone has studied how the average frequency of personal computer buying, i.e., average number of years for a person to buy a new computer, has changed over time since 80s, 90s, and what factors explain the differences. I think
42.
Kùzu Graph DBMS v0.0.3(kuzudb.com)
3 points by semihsalihoglu 4y ago|1 comments
43.
by semihsalihoglu 4y ago
We just released Kùzu v0.0.3. One of the main features that comes with the new release is support for Pytorch Geometric's Remote Backend support to train GNNs out of memory. If you want to train a large GNN models on a machine that has
44.
by semihsalihoglu 4y ago
Of course :) Please feel free to write to me when you'd like to have a meeting. Happy to chat anytime! I'll also check out your graph library.
45.
by semihsalihoglu 4y ago
I think Dean De Leo's work in this space is good. It's certainly the right place to start. This work is on using packed memory arrays (pma) but is focused on in-memory versions of pma. I can recommend these two papers: Teseo: htt
46.
by semihsalihoglu 4y ago
Indeed pretty much everything is doable in every DBMS, graph or relational, simply because all DBMSs from enough distance are very similar in terms of their core features: a high-level query language that compiles to relational operators, s
47.
by semihsalihoglu 4y ago
That's a topic quite separate from new join algorithms. I also don't know enough frankly but I don't yet see them being integrated in the systems that I'm aware of. I would be hesitant to put them inside KuzuDB since I d
48.
by semihsalihoglu 4y ago
This is a good paper. It's likely to especially useful for people using GPUs in DBMSs. There is tons of research on this: https://www.nowpublishers.com/article/Details/DBS-076 . It will be exciting to see when
49.
by semihsalihoglu 4y ago
I see, that's for sure. That's what every system does in one way or another. Both of the papers I have listed there describe different ways to do it: the Graphflow paper (and Kuzu) currently does this inside their dynamic programm
50.
by semihsalihoglu 4y ago
Not sure what you mean by lazily but in general this sub-optimality can't be fixed by joining relations 2 at a time. You need a different algorithmic step that takes > 2 relations and joins them "column by column". That&#x
51.
by semihsalihoglu 4y ago
Please do :). We're a bit early but very actively developing the system!
52.
by semihsalihoglu 4y ago
If you have any good ideas about how to implement Tetris in a practical way, you can make a good impact here. This is the only work that I know that tried to implement these: https://arxiv.org/pdf/1503.04169.pdf (and e
53.
by semihsalihoglu 4y ago
Can you clarify what you mean by byte-sized implementations? There are several systems now that implement these algorithms, KuzuDB, Umbra, LogicBlox (the earliest was this) are examples I know. I'm sure more will come.
54.
by semihsalihoglu 4y ago
You are welcome :)
55.
by semihsalihoglu 4y ago
Interesting. I think there are groups that does quite interesting work on linear algebra that intersects with wcoj algorithms: This keynote abstract should give some pointers on this group's work: https://www.vldb.org/p
56.
Graph DBMSs need new join algorithms: Story of worst-case optimal joins(kuzudb.com)
138 points by semihsalihoglu 4y ago|26 comments
57.
by semihsalihoglu 4y ago
I wrote about a (relatively) new class of join algorithms for DBMSs that are called "worst-case optimal join algorithms". This is a topic that has kept me very busy for the last 5 6 years and the post aims to explain the simple id
58.
Why Graph Databases Need New Join Algorithms: Story of Worst-Case Optimal Joins(kuzudb.com)
13 points by semihsalihoglu 4y ago|0 comments
59.
Kùzu Graph DBMS 0.0.2: PyG and NetworkX Export and Arrow and Parquet Import(kuzudb.com)
22 points by semihsalihoglu 4y ago|0 comments
60.
by semihsalihoglu 4y ago
echoing _frkl: yes, kuzu aims to fill exactly this space. an easy to use dbms that gives you the ability to model your records as a graph, do common querying and transformations, and extractions all in a high-level graph-specific query lang

More ›