Sciweavers

253 search results - page 36 / 51
» Close pair queries in moving object databases
Sort
View
ICDT
2009
ACM
130views Database» more  ICDT 2009»
16 years 14 days ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
CIKM
2009
Springer
15 years 6 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
15 years 12 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
GIS
2010
ACM
14 years 10 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
TKDE
2011
266views more  TKDE 2011»
14 years 3 months ago
Continuous Monitoring of Distance Based Range Queries
Given a positive value r, a distance based range query returns the objects that lie within the distance r of the query location. In this paper, we focus on the distance based rang...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...