Direct Spatial Search on Pictorial Databases Using Packed R-Trees.
Daniel Leifker
Nick Roussopoulos
ACM SIGMOD Conference
1985
14
4
17
31
Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. R-trees (two-dimensional B-trees) are excelle