Sciweavers

208 search results - page 4 / 42
» Indexing range sum queries in spatio-temporal databases
Sort
View
ADBIS
2000
Springer
117views Database» more  ADBIS 2000»
13 years 11 months ago
Multiversion Linear Quadtree for Spatio-Temporal Data
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present th...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
VLDB
2012
ACM
360views Database» more  VLDB 2012»
12 years 3 months ago
An adaptive updating protocol for reducing moving object database workload
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
Su Chen, Beng Chin Ooi, Zhenjie Zhang
PODS
2002
ACM
154views Database» more  PODS 2002»
14 years 7 months ago
How to Evaluate Multiple Range-Sum Queries Progressively
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
Rolfe R. Schmidt, Cyrus Shahabi
GIS
2010
ACM
13 years 5 months ago
Energy-efficient processing of spatio-temporal queries in wireless sensor networks
Research on Moving Object Databases (MOD) has resulted in sophisticated query mechanisms for moving objects and regions. Wireless Sensor Networks (WSN) support a wide range of app...
Markus Bestehorn, Klemens Böhm, Erik Buchmann...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 1 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao