Sciweavers

123 search results - page 8 / 25
» Query Processing Using Distance Oracles for Spatial Networks
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
15 years 11 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
13 years 2 months ago
Oracle in-database hadoop: when mapreduce meets RDBMS
Big data is the tar sands of the data world: vast reserves of raw gritty data whose valuable information content can only be extracted at great cost. MapReduce is a popular parall...
Xueyuan Su, Garret Swart
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 1 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
SEDE
2008
15 years 1 months ago
Energy-Efficient Processing of Spatial Alarms on Mobile Clients
In this paper we present an energy efficient framework for processing spatial alarms on mobile clients, while maintaining low computation and storage costs. Our approach to spatia...
Ling Liu
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 5 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi