Structured Duplicate Detection in External-Memory Graph Search
Abstract
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations, we develop a new approach to duplicate detection in graph search 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. We demonstrate the effectiveness of this approach both analytically and empirically.
Cite
Text
Zhou and Hansen. "Structured Duplicate Detection in External-Memory Graph Search." AAAI Conference on Artificial Intelligence, 2004.Markdown
[Zhou and Hansen. "Structured Duplicate Detection in External-Memory Graph Search." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/zhou2004aaai-structured/)BibTeX
@inproceedings{zhou2004aaai-structured,
title = {{Structured Duplicate Detection in External-Memory Graph Search}},
author = {Zhou, Rong and Hansen, Eric A.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2004},
pages = {683-689},
url = {https://mlanthology.org/aaai/2004/zhou2004aaai-structured/}
}