Tiling databases
… tile the area of the tile in the database. A collection of (possibly overlapping) tiles constitutes
a tiling (… ; the large tile mining problem which asks for all tiles in the database each having at …
a tiling (… ; the large tile mining problem which asks for all tiles in the database each having at …
Tiling large geographical databases
MF Goodchild - Symposium on large spatial databases, 1989 - Springer
… We assume that digital geographical databases will be largely archival, and … tiles, and
illustrate its role in traditional systems of tile indexing. For global databases, we propose a tiling …
illustrate its role in traditional systems of tile indexing. For global databases, we propose a tiling …
Ranked tiling
… technique that searches for a set of tiles (that is, a tiling) in a 0/1 … A tile is then a subset of
the rows and columns of the matrix, … to find a maximal ranked tile, ie, a tile with relatively highly …
the rows and columns of the matrix, … to find a maximal ranked tile, ie, a tile with relatively highly …
[PDF][PDF] Image Data Handling in Spatial Databases.
… and there is no more space available, the least recently used tile is discarded. In case of
any modification of the pixel values, the tile is updated in the database before being discarded. …
any modification of the pixel values, the tile is updated in the database before being discarded. …
Tiling strategies for distributed point cloud databases
… tiling of data is crucial to minimize cross-server communication and balance IO and processing
load. We propose histogrambased tiling algorithms, a hierarchical tiling … of these tiling …
load. We propose histogrambased tiling algorithms, a hierarchical tiling … of these tiling …
Deficiencies of sheets and tiles: building sheetless databases
NR Chrisman - International Journal of Geographical Information …, 1990 - Taylor & Francis
… To create a tile, primitive chains and polygons are split to incorporate the tiling boundary
as the limit of each independent database. Splitting objects creates a number of problems, …
as the limit of each independent database. Splitting objects creates a number of problems, …
Pattern databases
JC Culberson, J Schaeffer - Computational Intelligence, 1998 - Wiley Online Library
… in the pattern database, with the maximum cost over all lookups being the lower bound. For
sliding tile puzzles, the database enumerates all possible patterns containing N tiles and, for …
sliding tile puzzles, the database enumerates all possible patterns containing N tiles and, for …
Searching with pattern databases
JC Culberson, J Schaeffer - … Intelligence: 11th Biennial Conference of the …, 1996 - Springer
… For sliding tile puzzles, the database enumerates all possible patterns containing N tiles and,
for … We refer to the tiles by their labels 0 < i < 15, where 0 indicates the empty tile. A move …
for … We refer to the tiles by their labels 0 < i < 15, where 0 indicates the empty tile. A move …
Tiling multi-dimensional arrays
JP Sharp - … Symposium on Fundamentals of Computation Theory, 1999 - Springer
… We consider two particular partitioning problems which have applications to databases and
… array A and tile limit p, we will obtain a tiling with at most p tiles, with each tile having weight …
… array A and tile limit p, we will obtain a tiling with at most p tiles, with each tile having weight …
An information-theoretic approach to finding informative noisy tiles in binary databases
KN Kontonasios, T De Bie - Proceedings of the 2010 SIAM international …, 2010 - SIAM
… itemset in a binary database was formalized by its support in the database. However, it is …
of informativeness for noisy itemsets in binary databases within the formalism of tiles [6]. We …
of informativeness for noisy itemsets in binary databases within the formalism of tiles [6]. We …