Sciweavers

253 search results - page 33 / 51
» Close pair queries in moving object databases
Sort
View
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
15 years 5 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 12 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
DBPL
1991
Springer
98views Database» more  DBPL 1991»
15 years 3 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
MDM
2007
Springer
195views Communications» more  MDM 2007»
15 years 5 months ago
BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Isab...
EDBT
2009
ACM
174views Database» more  EDBT 2009»
15 years 6 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...