Using Partitions and Superstrings for Lossless Compression of Pattern Databases

Ethan Schreiber; Richard Korf

doi:10.1609/aaai.v25i1.8047

Using Partitions and Superstrings for Lossless Compression of Pattern Databases

Authors

Ethan Schreiber University of California, Los Angeles
Richard Korf University of California, Los Angeles

DOI:

https://doi.org/10.1609/aaai.v25i1.8047

Abstract

We present an algorithm for compressing pattern databases (PDBs) and a method for fast random access of these com-pressed PDBs. We demonstrate the effectiveness of our technique by compressing two 6-tile sliding-tile PDBs by a factor of 12 and a 7-tile sliding-tile PDB by a factor of 24.

Downloads

Published

2011-08-04

How to Cite

Schreiber, E., & Korf, R. (2011). Using Partitions and Superstrings for Lossless Compression of Pattern Databases. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 1814-1815. https://doi.org/10.1609/aaai.v25i1.8047