Sciweavers

619 search results - page 25 / 124
» Query Planning in Infomaster
Sort
View
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 8 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
108
Voted
FOCS
2008
IEEE
15 years 8 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
247
Voted
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
17 years 1 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
201
Voted
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 3 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
134
Voted
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 7 months ago
Single-Query Entropy-Guided Path Planning
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...
Brendan Burns, Oliver Brock