Hacker News Reader

Comment by semihsalihoglu | Hacker News Reader

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 don't see them resolving major performance bottlenecks. I think on the indices side, one interesting topic is to find more update-friendly disk-based CSR-based indices for graph DBMSs.

View on HN

Do you know of any research papers wrt "more update-friendly disk-based CSR-based indices"?

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: https://dl.acm.org/doi/abs/10.14778/3447689.3447708, and Packed Memory Arrays Rewired: https://ieeexplore.ieee.org/abstract/document/8731468. In Kuzu, I/we will be implementing a pma version of our disk-based CSR-baed join indices, which we also use to store relationship properties, so stay tuned for that!

Thanks for the pointers, I'll look into them. I read your blog post series yesterday and found it very well written and interesting. Gonna read the CIDR paper, too. Fyi, I'm the author of https://github.com/s1ck/graph where we use a read-only CSR and my day job is https://github.com/neo4j/graph-data-science which is built on top of a read-only, compressed CSR. Maybe we can have a chat at some point :)

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.

Reply on news.ycombinator.com