Array DBMS: Difference between revisions

Revision as of 09:49, 18 December 2014

Revision as of 15:31, 28 February 2015

Line 131:

=== Query processing ===

A tile-based storage structure suggests a tile-by-tile processing strategy (in [[rasdaman]] called ''tile streaming''). A large class of practically relevant queries can be evaluated by loading tile after tile, thereby allowing servers to process arrays orders of magnitude beyonedbeyond their main memory.

[[File:Sample heuristic optimization of array query.png|thumb|400px|alt=Sample rule for heuristic array query optimization|Sample rule for heuristic array query optimization]]