Sciweavers

197 search results - page 3 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
13 years 9 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 4 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 5 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 5 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
EDBTW
2006
Springer
13 years 8 months ago
Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...
Jürgen Krämer, Yin Yang, Michael Cammert...