package Tree::M;

use Carp;
use DynaLoader;

BEGIN {
   $VERSION = 0.01;
   @ISA = qw(DynaLoader);
   bootstrap Tree::M, $VERSION;
}

=head1 NAME

Tree::M - implement M-trees for efficient "multimedia-searched"

=head1 SYNOPSIS

  use Tree::M;

=head1 DESCRIPTION

(not yet)

Ever had the problem of managing multi-dimensional (spatial) data but your
database only had one-dimensional indices (b-tree etc.)? Queries like

 select data from table where latitude > 40 and latitude < 50
                          and longitude> 50 and longitude< 70;

are quite inefficient, unless longitude and latitude are part of the same
spatial index (e.g. a r-tree).

An M-tree etc.. etc...

=head2 THE Tree::M CLASS

=over 4

=item $M = new Tree::M arg => value, ...

...

   distance => specify a distance function. the default distance
               method uses this function in some way.
   keyof    => the keyof method uses this argument to determine
               the key of an object
   min      => the minimum number of objects stored in a node
   max      => the maximum number of objects stored in a node

=cut

=back

=head1 AUTHOR

Marc Lehmann <pcg@goof.com>.

=head1 SEE ALSO

perl(1), L<DBIx::SpatialKeys>.

=cut

1;