Lower Latency Graph Queries in Cypher with Redis GraphRoi Lipman, Redis LabsTim Davis, Texas A&M U
Channel:Redis · Length:46:05 · Published:2018-05-24 · Views:3466
Summary
Redis Labs and Tim Davis present RedisGraph, which uses GraphBLAS to treat graph queries in Cypher as sparse linear algebra for lower latency.
Why HN recommends it
Recommended in graph database threads as a mind-blowing case for expressing graph analysis as linear algebra.
I think you'll find this presentation on GraphBLAS positively mind-blowing — HN, 2023
Databases & storage · Algorithms & data structures
Subtitles (excerpt)
all right hello everyone my name is Li Lippmann I work at Redis labs and I've been working for the past almost two years on Redis graph and this talk is about matrices or JSON C matrices and linear algebra and how we can use these ideas within graph databases so just to make sure that everybody here is on the same page let's give a formal definition of what a graph is so a graph basically is just a set of nodes where each node basically can represent some entity and a set of edges connecting those nodes where each edge can represent some relation so take for example Facebook where nodes basically represents users and edges represents friendship connections between those users and so once you have a graph you have couple of options of how you would store that graph within memory or on disk so there are non traditional or non formal ways that would be using tables like sequel tables or JSON documents like the one has to store graphs obviously those structures were not meant to store graphs but you can use them to hold your graphs and there are those for always like adjacency list and adjacency matrix this talk will focus on adjacency matrices and so the idea behind an adjacency matrix is that you have this matrix where the rows and the
On Hacker News
> If you want to be my hero, find a way to fix this problem: [LINK] Let me (try to) be your hero, Marzi. (Insert favorite reference to famous cheezy pop music song, if you like.) Couldn't you use GraphBLAS algorithms, like they do in RedisGraph (which supports Cypher, btw) to fix that problem with "death star" queries? Those algorithms are based on linear algebra and matrix operations on sparse m… — redbar0n, 2023-01
Thanks for this link, very interesting talk from the graphblas author: [VIDEO] I've never seen any advantage to graphdbs over relational models until I saw this talk. Raising graph analysis to the level of linear algebra is brilliant. — michelpp, 2018-12
On a related note, this upcoming paper on succinct graph representations will be presented at PACT next month ( [LINK] ) -- it's more data model than database, but I think you'll find it interesting... Log(Graph): A Near-Optimal High-Performance Graph Representation [pdf] [LINK] For something more database specific, check out the new RedisGraph module [1] implemented with GraphBLAS [2] by the ven… — espeed, 2018-09
This paper on succinct graph data structures will be presented at PACT ( [LINK] ) next month. To put it in the broader context of relational database programming and why it's significant now for software developers in general, here are some thoughts from a thread I posted yesterday [0] on the convergence of ideas that have been in the works for the last 10+ years on the graph database front and t… — espeed, 2018-09
Hi Emil - I don't understand this comment. Last year, the MIT team showed the GraphBLAS/D4M model can achieve 100M inserts per second on a cluster [1], and it's improved since then. The GraphBLAS [2] standard has been in the works for more than 10 years. It's the culmination of the initial D4M matrix model design by Jeremy Kepner [3] and his team at MIT Lincoln Laboratory Supercomputing Center, w… — espeed, 2018-11
Related videos
- The Banach–Tarski Paradox · Vsauce · 24:13
- Salman Khan TED Talk 2011 (from ted.com) · Khan Academy · 20:27
- Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010 · MIT OpenCourseWare · 44:09
- Reading Silicon: How to Reverse Engineer Integrated Circuits · HACKADAY · 31:51
- 17. Succinct Structures I · MIT OpenCourseWare · 1:20:11
- Meaningful Play: Getting Gamification Right · Google TechTalks · 49:57
- Alan Kay - Programming and Scaling · Colin McDonnell · 56:38
- Times Tables, Mandelbrot and the Heart of Mathematics · Mathologer · 13:36
- Stanford Seminar: Beyond Floating Point: Next Generation Computer Arithmetic · Stanford Online · 1:31:28
- Your Brain at Work · Google TechTalks · 55:02
- Essence of linear algebra preview · 3Blue1Brown · 5:09
- Special Topics - The Kalman Filter (1 of 55) What is a Kalman Filter? · Michel van Biezen · 5:55
- Stop Writing Classes · Next Day Video · 27:29
- Noether's Theorem and The Symmetries of Reality · PBS Space Time · 13:01
- Evan Czaplicki - Let's be mainstream! User focused design in Elm - Curry On · Curry On! · 58:23
- "Testing Distributed Systems w/ Deterministic Simulation" by Will Wilson · Strange Loop Conference · 40:20