资源分类
》 资源 》论文》Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory

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

2019-11-22 | |  50 |   76 |   0
Abstract 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, Rubik’s Cube, and the 4-peg Towers of Hanoi.

上一篇：Counting Linear Extensions of Sparse Posets?

下一篇：Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...