Sciweavers

6004 search results - page 177 / 1201
» Parallelizing query optimization
Sort
View
104
Voted
ADBIS
2005
Springer
116views Database» more  ADBIS 2005»
15 years 6 months ago
A Formal Model for the Problem of View Selection for Aggregate Queries
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
105
Voted
ICDE
2010
IEEE
292views Database» more  ICDE 2010»
16 years 16 days ago
Exploring Power-Performance Tradeoffs in Database Systems
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...
Zichen Xu, Yi-Cheng Tu, Xiaorui Wang
133
Voted
COMGEO
2008
ACM
15 years 26 days ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
118
Voted
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
14 years 10 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...
PPOPP
2009
ACM
16 years 1 months ago
Exploiting global optimizations for openmp programs in the openuh compiler
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...
Lei Huang, Deepak Eachempati, Marcus W. Hervey, Ba...