Sciweavers

552 search results - page 37 / 111
» On the Complexity of Join Predicates
Sort
View
IJCAI
2003
15 years 8 days ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
15 years 11 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SPIN
2005
Springer
15 years 4 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
ADBIS
2006
Springer
135views Database» more  ADBIS 2006»
15 years 2 months ago
Interactive Discovery and Composition of Complex Web Services
Among the most important expected benefits of a global service oriented architecture leveraging web service standards is an increased level of automation in the discovery, composit...
Sergey A. Stupnikov, Leonid A. Kalinichenko, St&ea...
127
Voted
DEBS
2008
ACM
15 years 20 days ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch