Sciweavers

418 search results - page 66 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 2 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
APWEB
2004
Springer
14 years 1 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 9 months ago
Collecting and Maintaining Just-in-Time Statistics
Traditional DBMSs decouple statistics collection and query optimization both in space and time. Decoupling in time may lead to outdated statistics. Decoupling in space may cause s...
Amr El-Helw, Ihab F. Ilyas, Wing Lau, Volker Markl...