Sciweavers

556 search results - page 63 / 112
» Evaluation of probabilistic queries in moving objects databa...
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 1 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 1 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 1 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
ADC
2010
Springer
266views Database» more  ADC 2010»
14 years 8 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
VLDB
2001
ACM
108views Database» more  VLDB 2001»
15 years 5 months ago
Hyperqueries: Dynamic Distributed Query Processing on the Internet
In this paper we propose a new framework for dynamic distributed query processing based on so-called HyperQueries which are essentially query evaluation sub-plans “sitting behin...
Alfons Kemper, Christian Wiesner