Sciweavers

253 search results - page 35 / 51
» Close pair queries in moving object databases
Sort
View
EDBT
2006
ACM
194views Database» more  EDBT 2006»
15 years 12 months ago
Hermes - A Framework for Location-Based Data Management
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...
Nikos Pelekis, Yannis Theodoridis, Spyros Vosinaki...
80
Voted
EDBT
2008
ACM
118views Database» more  EDBT 2008»
15 years 12 months ago
Robustness in automatic physical database design
Automatic physical database design tools rely on "what-if" interfaces to the query optimizer to estimate the execution time of the training query workload under differen...
Kareem El Gebaly, Ashraf Aboulnaga
DEXAW
2000
IEEE
92views Database» more  DEXAW 2000»
15 years 4 months ago
Consistent Queries over Cardinal Directions across Different Levels of Detail
Current models for cardinal directions, such as north and northeast, are either point-based or region-based, but no models exist that apply equally, independent of the geometric d...
Roop K. Goyal, Max J. Egenhofer
GIS
2009
ACM
16 years 25 days ago
On-Line Discovery of Flock Patterns in Spatio-Temporal Data
With the recent advancements and wide usage of location detection devices, large quantities of data are collected by GPS and cellular technologies in the form of trajectories. Whi...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
DKE
2006
123views more  DKE 2006»
14 years 11 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...