Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

SIGMOD
1997
ACM

102views Database» more SIGMOD 1997»

The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries

15 years 7 months ago

The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries

Download www.ri.cmu.edu

Norio Katayama, Shin'ichi Satoh

Real-time Traffic

Database | SIGMOD 1997 |

claim paper

Related Content

» On Optimizing Nearest Neighbor Queries in HighDimensional Data Spaces

» Nearest Neighbor Search on Vertically Partitioned HighDimensional Data

» PAC Nearest Neighbor Queries Approximate and Controlled Search in HighDimensional and Metr...

» Quality and efficiency in high dimensional nearest neighbor search

» A Cost Model For Nearest Neighbor Search in HighDimensional Data Space

» Fast Nearest Neighbor Search in HighDimensional Space

» The Colored Sector Search Tree A Dynamic Data Structure for Efficient High Dimensional Nea...

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» Vector Approximation based Indexing for Nonuniform High Dimensional Data Sets

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	SIGMOD
Authors	Norio Katayama, Shin'ichi Satoh

Comments (0)