Direct spatial search on pictorial databases using packed R-trees

Pictorial databases require efficient and duect spatml search based on the analog form of spatial obJects and relatlonshlps instead of search based on some cumbersome alphanumeric encodings of the pmtures R-trees (two-dimensional B-trees) are excellent devices for indexing spatial ObJects and relationships found on pictures Their most important feature 1s that they provide high level ObJect onented search rather than search based on the low level elements of spatial ObJects This paper presents an efficient initial packing technique for creatmg R-trees to index spatial ObJects Since pictorial databases are not update mtensive but rather static, the beneflts of this technique are very significant 1.