Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounds on the quality of approximate solutions to the group Steiner problem
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM (JACM)
Encoding Data Structures in Trees
Journal of the ACM (JACM)
Preserving average proximity in arrays
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Out-of-core rendering of massive geometric environments
Proceedings of the conference on Visualization '02
Clustering Techniques for Minimizing External Path Length
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Finding Generalized Path Patterns for Web Log Data Mining
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Journal of Experimental Algorithmics (JEA)
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Search-Optimized suffix-tree storage for biological applications
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
| Hi-index | 0.00 |
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 complete d-ary trees and d-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.