Optimal tiling for large cartographic databases

We define a tiling as a partitioning of a spatial database using geographical and thematic criteria. Several options for the ordering of tiles are seen to be analogs of traditional map indexing systems and to fall into a general class of digit interleaving schemes. A general scheme for generating indexes is proposed. Optimally in tile arrangement is defined through an objective function in a form of the quardatic assignment problem. Solutions are described for a number of simple arrangements under assumptions about device behavior and the nature of applications. -Author