什么是 CSR 索引作为连接优化技术？
What is CSR indexing as a join optimization technique?
Spark Graphx 论文在以下上下文中提到了 CSR 索引：
GraphX recasts system optimizations developed in the context of graph
processing systems as join optimizations (e.g., CSR indexing, join
elimination, and join-site specification) and materialized view
maintenance (e.g., vertex mirroring and delta updates)
然而当我用谷歌搜索
CSR indexing join optimization
结果与
相关
Corporate Social Responsibility.
现在我确定我们都支持 ;) 但是，我对更多与技术相关的首字母缩略词和语义的信息感兴趣。
好的，我在矩阵运算论文里面找到了它：它是
Compressed Sparse Row
详情：
CSR permits indexed access to rows. Similar to COO, CSR storage
structure also consists of three sparse vectors, non-zero vector,
column vector and row vector. Index structure differs in the formation
of row vector. In CSR row vector consists of pointers to each row of
the matrix.
稀疏矩阵算法比较：
http://ir.cs.georgetown.edu/publications/downloads/SCI-Journal-CameraReady-Goharian.pdf
Spark Graphx 论文在以下上下文中提到了 CSR 索引：
GraphX recasts system optimizations developed in the context of graph processing systems as join optimizations (e.g., CSR indexing, join elimination, and join-site specification) and materialized view maintenance (e.g., vertex mirroring and delta updates)
然而当我用谷歌搜索
CSR indexing join optimization
结果与
相关Corporate Social Responsibility.
现在我确定我们都支持 ;) 但是，我对更多与技术相关的首字母缩略词和语义的信息感兴趣。
好的，我在矩阵运算论文里面找到了它：它是
Compressed Sparse Row
详情：
CSR permits indexed access to rows. Similar to COO, CSR storage structure also consists of three sparse vectors, non-zero vector, column vector and row vector. Index structure differs in the formation of row vector. In CSR row vector consists of pointers to each row of the matrix.
稀疏矩阵算法比较：
http://ir.cs.georgetown.edu/publications/downloads/SCI-Journal-CameraReady-Goharian.pdf