Sciweavers

94 search results - page 5 / 19
» Verifying spatial queries using Voronoi neighbors
Sort
View
GIS
2004
ACM
14 years 8 months ago
Supporting spatial aggregation in sensor network databases
Sensor networks are unattended deeply distributed systems whose schema can be conceptualized using the relational model. Aggregation queries on the data sampled at each ode are th...
Mehdi Sharifzadeh, Cyrus Shahabi
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 7 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
14 years 9 months ago
Enabling Query Processing on Spatial Networks
A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such a...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 2 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 7 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...