| Sellis, T. K. (1988). Multiple-query optimization. ACM Transactions on Database Systems, 13 (1), 23--52. |
....computation, tend to fit in memory, and can reduce I O costs significantly. Furthermore, grouping on selection predicates can eliminate a large number of unnecessary query invocations. Our grouping technique is distinguished from previous multiple query optimization approaches [CM86] RC88] [Sel86] [RSSB00] in that we use an incremental grouping strategy. These earlier strategies focused on finding an optimal global plan for a small number of queries submitted in advance. A naive approach for grouping continuous queries would be to apply these methods directly by re optimizing all queries ....
T. Sellis, "Multiple query optimization," ACM Transactions on Database Systems, 10(3), 1986.
....plan is minimized. In general, the union of locally optimal plans does not necessarily form a globally optimal plan. Hence, we cannot find the globally optimal plan by simply combining locally optimal plans. A heuristic algorithm is often needed in searching for a globally optimal plan. In [19] and [20] a heuristic search algorithm is proposed, which only examines a fraction of all possible global processing plans. Some potentially good plans may be lost. By using the evolutionary approach, our algorithms are capable of carrying out global search and looking into all possible ....
T. K. Sellis, "Multiple-query optimization," ACM Trans. Database Syst., vol. 13, no. 1, pp. 23--52, Mar. 1988.
No context found.
Sellis, T. K. (1988). Multiple-query optimization. ACM Transactions on Database Systems, 13 (1), 23--52.
No context found.
T. Sellis: "Multiple query optimization", ACM Transactions on Database Systems, vol.13, no.1, pp.23-52, 1988.
No context found.
SELLIS, T. 1988a. Multiple-query optimization. ACM Trans. Datab. Syst. 13, 1, 23--52.
No context found.
T. K. Sellis. "Multiple Query Optimization." In ACM TODS, 13(1):23-52, Mar. 1988.
No context found.
T. K. Sellis. Multiple-Query Optimization. ACM TODS, 13(1):23--52, 1988.
No context found.
T. Sellis. Multiple query optimization. ACM TODS, 13(1):23--52, 1988.
No context found.
T. K. Sellis. "Multiple Query Optimization." In ACM TODS, 13(1):23-52, Mar. 1988.
No context found.
T. Sellis. Multiple-query optimization. TODS, 1988.
No context found.
T. Sellis, "Multiple Query Optimization", ACM Trans. on Database Systems, 13(1), March 1988.
No context found.
T. K. Sellis. Multiple-query optimization. ACM Trans. on Database Systems, 13(1):23--52, Mar. 1988.
No context found.
T. K. Sellis. Multiple-query optimization. ACM TODS, March 1988.
No context found.
Timos K. Sellis. Multiple-Query Optimization. TODS, 13(1), 1988.
No context found.
T. K. Sellis. Multiple Query Optimization. TODS 13(1): 2352 (1988)
No context found.
T. K. Sellis. Multiple-Query Optimization. TODS, 13(1), 1988.
No context found.
T. K. Sellis. Multiple-query optimization. ACM TODS, March 1988.
No context found.
T. K. Sellis. Multiple-query optimization. TODS, 1988.
No context found.
T. K. Sellis. Multiple-query optimization. ACM TODS, March 1988.
No context found.
Sellis, T., "Multiple query optimization," ACM Transactions on Database Systems, vol. 10, no. 3, 1986.
No context found.
T. K. Sellis. Multiple-Query Optimization. TODS, 13(1), 1988.
No context found.
T. Sellis. Multiple query optimization. ACM Trans. Database Systems, 13:23--52, 1988.
No context found.
T.K. Sellis. "Multiple-Query Optimization." ACM Transactions on Database Systems, Vol. 13, No. 1, pp. 23-52, Mar 1988.
No context found.
T. Sellis, "Multiple Query Optimization", ACM Trans. on Database Systems, 13(1), March 1988.
No context found.
Timos K. Sellis. Multiple-query optimization. TODS, 13(1):23--52, 1988.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC