Sciweavers

556 search results - page 5 / 112
» Evaluation of probabilistic queries in moving objects databa...
Sort
View
GIS
2007
ACM
14 years 7 months ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
14 years 5 days ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
GIS
2006
ACM
14 years 7 months ago
Representation of periodic moving objects in databases
In the real world, lots of objects with changing position can be found. Some of them repeat the same movement several times, called periodic movements. Examples include airplanes,...
Ralf Hartmut Güting, Thomas Behr, Victor Teix...
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 28 days ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
15 years 6 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...