Sciweavers

38 search results - page 7 / 8
» V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor...
Sort
View
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 8 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras
ESWS
2008
Springer
13 years 8 months ago
Query Answering and Ontology Population: An Inductive Approach
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 8 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
DKE
2006
123views more  DKE 2006»
13 years 7 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...