Sciweavers

151 search results - page 21 / 31
» Materializing views with minimal size to answer queries
Sort
View
PLDI
1995
ACM
15 years 3 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
15 years 12 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
EDBT
2002
ACM
139views Database» more  EDBT 2002»
15 years 11 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
ICDE
2001
IEEE
115views Database» more  ICDE 2001»
16 years 1 months ago
Incremental Computation and Maintenance of Temporal Aggregates
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
Jun Yang 0001, Jennifer Widom
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 11 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau