Blocking for external graph searching
SIGMOD/PODS93: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD Washington D.C. USA May, 1993(1996)
摘要
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented any number of times on the disk in order to take advantage of redundancy. We give matching upper and lower bounds for completed-ary trees andd-dimensional grid graphs, as well as for classes of general graphs that intuitively speaking have a close to uniform number of neighbors around each vertex. We also show that, for the special case of grid graphs blocked with isothetic hypercubes, there is a provably better speed-up if even a small amount of redundancy is permitted.
更多查看译文
关键词
External searching,Isothetic hypercubes,Blocking,Input/output complexity,Redundancy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要