Sciweavers

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

89

VLDB
2001
ACM

138views Database» more VLDB 2001»

Indexing the Distance: An Efficient Method to KNN Processing

15 years 7 months ago

Indexing the Distance: An Efficient Method to KNN Processing

Download www.vldb.org

Cui Yu, Beng Chin Ooi, Kian-Lee Tan, H. V. Jagadis

Real-time Traffic

VLDB 2001 |

claim paper

Related Content

» Indexing land surface for efficient kNN query

» Efficiently Processing Continuous kNN Queries on Data Streams

» Nearest Neighbor Search on Multimedia Indexing Structures

» Efficient kNN search on vertically decomposed data

» LDC Enabling Search By Partial Distance In A HyperDimensional Space

» ClosureTree An Index Structure for Graph Queries

» Indexing highdimensional data in dual distance spaces a symmetrical encoding approach

» Surface kNN Query Processing

» Querying highdimensional data in singledimensional space

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	VLDB
Authors	Cui Yu, Beng Chin Ooi, Kian-Lee Tan, H. V. Jagadish

Comments (0)