Sciweavers

383 search results - page 2 / 77
» Common Subexpressions in Constraint Models of Planning Probl...
Sort
View
PODS
2001
ACM
143views Database» more  PODS 2001»
14 years 5 months ago
Pipelining in Multi-Query Optimization
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plan...
Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. ...
FLAIRS
2008
13 years 7 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 5 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
CP
2011
Springer
12 years 5 months ago
CP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
Samba Ndojh Ndiaye, Christine Solnon
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
13 years 9 months ago
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan