[MUD-Dev] R-trees &kin

[Cynbe ru Taren <cynbe#laurel,actlab.utexas.edu>]

Someone raised the topic of R-trees awhile back.
I just got a shipment of papers from my erstwhile
Northern haunts:  Here's a set of references
for anyone seriously interested.  Chronologically:

    A Guttman:  'R-trees, a dynamic index structure
    for spatial searching' Proc ACM SIGMOD Int Conf
    on Management of Data 47-57 1984

    Roussopoulos and Leifker: 'Direct Spatial Search on
    Pictorial Datases using Packed R-Trees' ACM SIGMOD
    Int Conf on Management of Data 17-31, 1985

    Faloutsos, Sellis, Roussopoulos: 'Analysis of
    Object Oriented Spatial Access Methods' 1987 ACM 
    (Covers both R-trees and R+ trees.)

    Seeger, Kriegel: 'Design and implementation of spatial
    access methods' Proc 14th Int Conf on Very Large
    Databases 360-37- 1988.

    D Green: 'An Implementation and Performance Analysis
    of Spatial Data Access Methods' Proc 5th Int Conf on
    Data Engineering 606-615 1989

    Beckmann, Kriegel, Schneider, Seeger: 'The R*-tree:
    An Efficient and Robust Access Method for Points
    and Rectangles' 1990 ACM

That list is dated and incomplete, but probably
good enough to get started with.

I've been playing a bit recently with ideas for
sorting sparse vectors in very high-dimensional
spaces using non-Euclidean metrics, but that
probably wouldn't interest anyone here. Or
possibly anywhere else, for that matter.  :)

 Cynbe