Download as PDF, PPTX
![PRESENTED BY
MATCH (X:person)-[:visit]->(S:state)
WHERE state.population > 9M
RETURN DISTINCT X, count(S) AS C
ORDER BY C DESC](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-35-320.jpg)
![PRESENTED BY
MATCH
TraverseScan
(X)
(X)-[:visit]->(S)](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-36-320.jpg)
![PRESENTED BY
MATCH ( a )-[ X ]->( b )-[ Y ]->( c )
RETURN a,c](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-47-320.jpg)
![PRESENTED BY
( a )-[ X ]->( b )-[ Y ]->( c )](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-48-320.jpg)
![PRESENTED BY
( a )-[ X ]->( b )](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-49-320.jpg)
![PRESENTED BY
X
[
. 1 .
1 . 1
1 . . ]
( a )
( b )](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-50-320.jpg)
![PRESENTED BY
( b )-[ Y ]->( c )](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-51-320.jpg)
![PRESENTED BY
Y
[
. 1 1
. . 1
. 1 . ]
( b )
( c )](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-52-320.jpg)
![PRESENTED BY
MATCH ( a )-[ X ]->( b )-[ Y ]->( c )
RETURN a,c](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-53-320.jpg)
![PRESENTED BY
Y
[
. 1 1
. . 1
. 1 . ]
b
c
[
. 1 .
1 . 1
1 . . ]
X
b
a](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-54-320.jpg)
![PRESENTED BY
[
. . 1
. 1 1
. 1 1]
XY
c
a](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-55-320.jpg)
![PRESENTED BY
MATCH ( a )-[ X ]->( b )-[ Y ]->( c )
RETURN a,c](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-62-320.jpg)
![PRESENTED BY
MATCH ( a )-[ X ]->( b )-[ Y ]->( c )
RETURN a,b,c](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-63-320.jpg)
![PRESENTED BY
[AB] * [BC] * [CD]](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-66-320.jpg)
![PRESENTED BY
[AB] * [BC]
[CD]
1
2](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-67-320.jpg)
![PRESENTED BY
[AB] * [BC]
A
B
C](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-68-320.jpg)
![PRESENTED BY
[C] [CD]
C
D](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-69-320.jpg)
![PRESENTED BY
()-[X]->()<-[Y]-()](https://image.slidesharecdn.com/03roilipman-190508035529/85/RedisGraph-Internals-Roi-Lipman-70-320.jpg)
Uploaded byRedis Labs
RedisGraph Internals: Roi Lipman
The document appears to be a presentation on RedisGraph internals and query execution. It discusses topics like query transmission, AST construction, execution plan construction, optimization of execution plans, and result filtering and scanning. Various examples of graph queries and their corresponding execution plans are shown.
More Related Content
Similar to RedisGraph Internals: Roi Lipman
RedisGraph Internals: Roi Lipman
- 1. PRESENTED BY RedisGraph internals RoiLipman RedisLabs, Lead developer
- 2.
- 3.
- 4.
- 5.
- 6. PRESENTED BY Result Filter Scan Execution planconstruction
- 7.
- 8.
- 9. PRESENTED BY 1 Unwrap 2Heat 3 Enjoy Popcorn
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17. PRESENTED BY MATCH (n ) WHERE n.score > 85 RETURN n
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32. PRESENTED BY Execution planconstruction
- 33. PRESENTED BY Result Filter Scan MATCH (n ) WHERE n.score > 85 RETURN n
- 34. PRESENTED BY 1 Startsimple 2 Optimise Execution plan construction
- 35. PRESENTED BY MATCH (X:person)-[:visit]->(S:state) WHEREstate.population > 9M RETURN DISTINCT X, count(S) AS C ORDER BY C DESC
- 36.
- 37.
- 38.
- 39.
- 40. PRESENTED BY ORDER BY Aggregate CDESC Distinct Sort
- 41. PRESENTED BY Aggregate DistinctSortFilterTraverseScan Naive Execution plan
- 42. PRESENTED BY Aggregate DistinctSortFilterTraverseScan Redundant
- 43. PRESENTED BY Redundancy removed AggregateSortFilterTraverseScan
- 44. PRESENTED BY Reverse traversal (X)->(S)(X)S.P > 9M FilterTraverseScan
- 45. PRESENTED BY Reverse traversal (S)S.P > 9M Filter (S)->(X) TraverseScan
- 46.
- 47. PRESENTED BY MATCH (a )-[ X ]->( b )-[ Y ]->( c ) RETURN a,c
- 48. PRESENTED BY ( a)-[ X ]->( b )-[ Y ]->( c )
- 49. PRESENTED BY ( a)-[ X ]->( b )
- 50. PRESENTED BY X [ . 1. 1 . 1 1 . . ] ( a ) ( b )
- 51. PRESENTED BY ( b)-[ Y ]->( c )
- 52. PRESENTED BY Y [ . 11 . . 1 . 1 . ] ( b ) ( c )
- 53. PRESENTED BY MATCH (a )-[ X ]->( b )-[ Y ]->( c ) RETURN a,c
- 54. PRESENTED BY Y [ . 11 . . 1 . 1 . ] b c [ . 1 . 1 . 1 1 . . ] X b a
- 55. PRESENTED BY [ . .1 . 1 1 . 1 1] XY c a
- 56. PRESENTED BY Reversed traversal AggregateSortTraverseFilterScan
- 57. PRESENTED BY Utilise index AggregateSortTraverseFilterScan (S) S.P > 9M
- 58. PRESENTED BY Optimised executionplan Aggregate SortTraverse Index Scan
- 59. PRESENTED BY Naive VSOptimised 0 12.5 25 37.5 50 Naive Redundant Distinct Early filter Utilise Index
- 60.
- 61.
- 62. PRESENTED BY MATCH (a )-[ X ]->( b )-[ Y ]->( c ) RETURN a,c
- 63. PRESENTED BY MATCH (a )-[ X ]->( b )-[ Y ]->( c ) RETURN a,b,c
- 64. PRESENTED BY 1 Singleexpression 2 Break down Expression construction
- 65. PRESENTED BY MATCH ( a)->( b )->( c )->( d ) RETURN a,c,d
- 66. PRESENTED BY [AB] *[BC] * [CD]
- 67. PRESENTED BY [AB] *[BC] [CD] 1 2
- 68. PRESENTED BY [AB] *[BC] A B C
- 69.
- 70.
- 71.
- 72. PRESENTED BY 1 Section1 Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium. 2 Section 2 Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium. 3 Section 3 Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium. Agenda:
- 73. PRESENTED BY 1 Queryparsing 2 AST enrichment, modification & validation 3 Execution plan construction, optimisation & invocation Steps 4 Result-set compaction & transmission