An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes
暂无分享,去创建一个
We give an upper bound on the buffer size with no page reaccess when the access paths available are nonclustered indexes on the joining attributes. The upper bound implies that there is a method of the join operation which needs at most this number of buffer;
[1] Sakti Pramanik,et al. Use of graph-theoretic models for optimal relational database accesses to perform join , 1985, TODS.
[2] Myunghwan Kim,et al. Hybrid Join: An Improved Sort-Based Join Algorithm , 1989, Inf. Process. Lett..
[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[4] Edward Omiecinski. Heuristics for Join Processing Using Nonclustered Indexes , 1989, IEEE Trans. Software Eng..