{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:28Z","timestamp":1725552208864},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642126581"},{"type":"electronic","value":"9783642126598"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12659-8_24","type":"book-chapter","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T11:20:05Z","timestamp":1271676005000},"page":"323-336","source":"Crossref","is-referenced-by-count":2,"title":["Out-of-Core Parallel Frontier Search with MapReduce"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Reinefeld","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Sch\u00fctt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-61291-2_68","volume-title":"Advances in Artificial Intelligence","author":"J. Culberson","year":"1996","unstructured":"Culberson, J., Schaeffer, J.: Searching with pattern databases. In: McCalla, G.I. (ed.) Canadian AI 1996. LNCS, vol.\u00a01081, pp. 402\u2013416. Springer, Heidelberg (1996)"},{"key":"24_CR2","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplifed data processing on large clusters. In: OSDI (2004)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Kettner, L., Sanders, P.: STXXL: Standard template library for XXL data sets. In: 13th Annual European Symp. on Algorithms, pp. 640\u2013651 (2005)","DOI":"10.1007\/11561071_57"},{"key":"24_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-540-30221-6_18","volume-title":"KI 2004: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"2004","unstructured":"Edelkamp, S., Jabbar, S., Schr\u00f6dl, S.: External A*. In: Biundo, S., Fr\u00fchwirth, T., Palm, G. (eds.) KI 2004. LNCS (LNAI), vol.\u00a03238, pp. 226\u2013240. Springer, Heidelberg (2004)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","volume":"63","author":"O. Hansson","year":"1992","unstructured":"Hansson, O., Mayer, A., Yung, M.: Critizising solutions to relaxed models yields powerful admissible heuristics. Information Sciences\u00a063, 207\u2013227 (1992)","journal-title":"Information Sciences"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cyber.\u00a04(2) (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 97\u2013109 (1985)","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"24_CR8","unstructured":"Korf, R.E.: Divide-and-conquer bidirectional search: First results. In: IJCAI 1999, pp. 1184\u20131189 (1999)"},{"key":"24_CR9","unstructured":"Korf, R.E., Zhang, W.: Divide-and-conquer frontier search applied to optimal sequence alignment. In: AAAI 2000, pp. 910\u2013916 (2000)"},{"key":"24_CR10","unstructured":"Korf, R.E., Schultze, P.: Large-scale parallel breadth-first search. In: AAAI 2005, pp. 1380\u20131385 (2005)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. J. ACM\u00a052(5) (2005)","DOI":"10.1145\/1089023.1089024"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: Linear-time disk-based implicit graph search. J. ACM\u00a055(6) (2009)","DOI":"10.1145\/1455248.1455250"},{"key":"24_CR13","unstructured":"Reinefeld, A., Schnecke, V.: AIDA* \u2013 Asynchronous Parallel IDA*. In: Canadian Conf. Artificial Intelligence, pp. 295\u2013302 (1994)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Romein, J.W., Bal, H.E., Schaeffer, J., Plaat, A.: A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search. IEEE Trans. Parallel and Distributed Systems\u00a013(5) (2002)","DOI":"10.1109\/TPDS.2002.1003855"},{"key":"24_CR15","unstructured":"Zhang, Y., Hansen, E.A.: Parallel breadth-first heuristic search on a shared-memory architecture. In: Workshop on heuristic search, memory-based heuristics and their appl. (2006)"},{"key":"24_CR16","unstructured":"Zhou, R., Hansen, E.A.: Breadth-first heuristic search. In: 14th Intl. Conf. on Automated Planning and Scheduling, ICAPS 2004 (2004)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, R., Hansen, E.A.: Structured duplicate detection in external memory graph search. In: AAAI 2004, pp. 683\u2013688 (2004)","DOI":"10.1016\/B0-12-657410-3\/00743-1"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing Systems and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12659-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:05Z","timestamp":1606186565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12659-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126581","9783642126598"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12659-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}