Sciweavers

11 search results - page 2 / 3
» An adaptive updating protocol for reducing moving object dat...
Sort
View
DEXA
2007
Springer
173views Database» more  DEXA 2007»
13 years 10 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
Fuyu Liu, Kien A. Hua, Tai T. Do
DEXA
2006
Springer
139views Database» more  DEXA 2006»
13 years 8 months ago
Distributed Continuous Range Query Processing on Moving Objects
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
SSD
2007
Springer
243views Database» more  SSD 2007»
13 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 4 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
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
13 years 8 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...