Sciweavers

291 search results - page 44 / 59
» Efficiently Processing Continuous k-NN Queries on Data Strea...
Sort
View
DKE
2007
153views more  DKE 2007»
13 years 7 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 9 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
TKDE
2010
151views more  TKDE 2010»
13 years 6 months ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
GIS
2004
ACM
14 years 8 months ago
Spatio-temporal aggregates over raster image data
Spatial, temporal and spatio-temporal aggregates over continuous streams of remotely sensed image data build a fundamental operation in many applications in the environmental scie...
Jie Zhang, Michael Gertz, Demet Aksoy
JCST
2008
175views more  JCST 2008»
13 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang