61 search results - page 3 / 13 » Blocking for External Graph Searching |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
VLDB
1999
ACM
14 years 23 days ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
AAAI
2006
13 years 10 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that i...