Sciweavers

297 search results - page 20 / 60
» Polynomial heuristics for query optimization
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
CIA
2007
Springer
14 years 1 months ago
Who Works Together in Agent Coalition Formation?
Coalitions are often required for multi-agent collaboration. In this research, we consider tasks that can only be completed with the combined efforts of multiple agents using appro...
Vicki H. Allan, Kevin Westwood
ISCAS
2006
IEEE
119views Hardware» more  ISCAS 2006»
14 years 1 months ago
Scheduling and binding for low gate leakage nanoCMOS datapath circuit synthesis
In this paper we present two polynomial time-complexity heuristic algorithms for optimization of gate-oxide leakage (tunneling current) during behavioral synthesis through simulta...
Saraju P. Mohanty, Elias Kougianos, Ramakrishna Ve...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 9 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
VLDB
2005
ACM
125views Database» more  VLDB 2005»
14 years 1 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu