The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and senso...
Reynold Cheng, Benjamin C. M. Kao, Alan Kwan, Suni...
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...