• Corpus ID: 10997907

Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory

@inproceedings{Korf2016ComparingSA,
  title={Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory},
  author={Richard E. Korf},
  booktitle={IJCAI},
  year={2016}
}
  • R. Korf
  • Published in IJCAI 9 July 2016
  • Computer Science
We compare sorting and hashing for implicit graph search using disk storage. We first describe efficient pipelined implementations of both algorithms, which reduce disk I/O. We then compare the two algorithms and find that hashing is faster, but that sorting requires less disk storage. We also compare disk-based with in-memory search, and surprisingly find that there is little or no time overhead associated with disk-based search. We present experimental results on the sliding-tile puzzles… 

Tables from this paper

Revisiting Immediate Duplicate Detection in External Memory Search
TLDR
It is shown that A*-IDD, an external search variant of A* that uses segmented compression-based IDD, significantly improves upon previous open-addressing based IDD and can outperform DDD-based A* on some domains in domain-independent planning.
Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search
TLDR
This work shows that classic best-first algorithms like A* can be applied to large real-world problems by exploiting disk storage and parallel processing and, in some cases, slightly relaxing the strict best- first node expansion order.
Presented at SoCS 2016 in the Previously Published Paper Track
s of Papers Presented at SoCS 2016 in the Previously Published Paper Track Jorge Baier and Adi Botea Editors

References

SHOWING 1-10 OF 18 REFERENCES
Linear-time disk-based implicit graph search
TLDR
This work performs delayed duplicate detection without sorting, which runs in time linear in the number of nodes in practice, and performs the first complete breadth-first searches of the 2 × 7, 3 × 5, 4 &times 4, and 2 ×× 8 sliding-tile Puzzles, verifying the radius of the 4 × 4 puzzle and determining theradius of the others.
Large-Scale Parallel Breadth-First Search
TLDR
This work introduces several improvements to the best of these best-first search algorithms, including parallel processing, to reduce their storage and time requirements, and presents a linear-time algorithm for bijectively mapping permutations to integers in lexicographic order.
Best-First Frontier Search with Delayed Duplicate Detection
TLDR
The main contributions of this paper are to provide a scalable implementation of DDD, to combine it with frontier search, and to extend it to more general best-first searches such as A*.
Minimizing Disk I/O in Two-Bit Breadth-First Search
TLDR
Using TBBFS, complete breadth-first searches of the original pancake problem with 14 and 15 pancakes, and the burned pancakes problem with 11 and 12 pancakes are performed, determining the diameter of these problem spaces for the first time.
Structured Duplicate Detection in External-Memory Graph Search
TLDR
A new approach to duplicate detection in graph search is developed that localizes memory references by partitioning the search graph based on an abstraction of the state space, and expanding the frontier nodes of the graph in an order that respects this partition.
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
TLDR
A survey of disk-based techniques side-by-side, for the first time, allows researchers to choose from a menu of techniques, and also to create new hybrid algorithms from the building blocks presented here.
A computational study of external-memory BFS algorithms
TLDR
It is demonstrated that some rather simple external-memory BFS algorithms perform significantly better (minutes as compared to hours) than internal- memory BFS, even if more than half of the input resides internally.
Frontier search
The critical resource that limits the application of best-first search is memory. We present a new class of best-first search algorithms that reduce the space complexity. The key idea is to store
Minimizing Writes in Parallel External Memory Search
TLDR
The Write-Minimizing Breadth-First Search (WMBFS) algorithm which is designed to minimize the number of writes performed in an external-memory BFS is introduced and the results suggest the machine and state-space properties necessary for WMBFS to perform well.
Parallel Structured Duplicate Detection
TLDR
It is shown that structured duplicate detection can also be used to reduce the number of slow synchronization operations needed in parallel graph search, and several techniques for integrating parallel and external-memory graph search in an efficient way are described.
...
...