106 search results - page 7 / 22 » Query Optimization by Predicate Move-Around |
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
BTW
2009
Springer
14 years 9 days ago
2009
Springer
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
ICDE
2010
IEEE
14 years 29 days ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
VLDB
2001
ACM
14 years 2 days ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...