Sql 与指数联接的代价

Sql 与指数联接的代价,sql,relational-database,b-tree,b-tree-index,Sql,Relational Database,B Tree,B Tree Index,鉴于以下情况: blocksize = 4K relation students(S#, Sname, Age,....) relation taken(S#, C#, Grade) Number of student records = 10,000 Number of taken records = 50,000 Size of student records = 200 bytes Size of taken records = 50 bytes 如果take的#上有一个B树索引,并且“

鉴于以下情况:

blocksize = 4K
relation students(S#, Sname, Age,....)
relation taken(S#, C#, Grade)
Number of student records = 10,000
Number of taken records = 50,000
Size of student records = 200 bytes
Size of taken records = 50 bytes
如果take的#上有一个B树索引,并且“students JOIN take”是使用该索引完成的,那么执行JOIN需要多少成本


假设每个B-树节点包含多达4K的数据(=块大小)。

你所说的“成本”到底是什么意思?你是在问逻辑读取吗?@SamD应该有某种公式(块传输+搜索)