The R-file: an efficient access structure for proximity queries

In many nonstandard database applications, spatial access to geometric objects is very important. A new access structure, the R-file, is presented for geometric objects in a dynamic environment. An extensive performance evaluation reveals that the R-file, which is based on handling axis-parallel rectangles in secondary storage, has higher storage space utilization and a more compact directory, and turns out to be more efficient in exact match and window queries than comparable schemes, e.g. R-trees or grid file variants, for example, for maintaining geometric objects