995 search results - page 92 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
130
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
102
click to vote
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
122
click to vote
VLDB
2001
ACM
15 years 7 months ago
2001
ACM
imizer Communication using Abstract Plans in Sybase ASE Query optimizers are error prone, due to both their nature and the increased search space that modern query processing requ...
130
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...