Sciweavers

39 search results - page 1 / 8
» Efficient Algorithm for determining the Optimal Execution St...
Sort
View
SEBD
1996
94views Database» more  SEBD 1996»
13 years 6 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
DPD
2002
168views more  DPD 2002»
13 years 4 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
14 years 5 months ago
Execution strategies for SQL subqueries
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
César A. Galindo-Legaria, Milind Joshi, Mos...
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 8 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
13 years 2 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...