Sciweavers

Share
296 search results - page 1 / 60
» Efficiently Processing Continuous k-NN Queries on Data Strea...
Sort
View
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
10 years 13 days 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,...
VLDB
2007
ACM
191views Database» more  VLDB 2007»
9 years 11 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
10 years 13 days ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
PVLDB
2008
154views more  PVLDB 2008»
8 years 10 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
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
9 years 11 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...
books