Sciweavers

360 search results - page 1 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
VLDB
2001
ACM
138views Database» more  VLDB 2001»
13 years 9 months ago
Indexing the Distance: An Efficient Method to KNN Processing
Cui Yu, Beng Chin Ooi, Kian-Lee Tan, H. V. Jagadis...
PVLDB
2008
154views more  PVLDB 2008»
13 years 4 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 6 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
CVDB
2004
ACM
13 years 10 months ago
Nearest Neighbor Search on Multimedia Indexing Structures
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
Thomas Seidl
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 5 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...