643 search results - page 75 / 129 » Dynamic prioritization of database queries |
SIGMOD
2009
ACM
15 years 4 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
186
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
IDEAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
119
click to vote
PODS
1995
ACM
15 years 1 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...