Cornell D, Yu P (1989) Integration of buffer management and query optimization in relational database environment. In: Proc. of the 15th International VLDB Conference. Amsterdam, The Netherlands, pp 247--255  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of essentially introducing choose plan operators [GW89] The Starburst project has also considered incorporating a second optimization phase that chooses plans at run time [HP88] To the best of our knowledge, however, no technique has been developed to find those plans. Also, Cornell and Yu [CY89] use an integer programming model to optimize queries and their buffer allocations in a transaction environment. Even though their concern is different from ours, their technique still produces only one plan per query, and that plan is susceptible to changes in buffer allocations. Our work differs ....

Cornell D, Yu P (1989) Integration of buffer management and query optimization in relational database environment. In: Proc. of the 15th International VLDB Conference. Amsterdam, The Netherlands, pp 247--255

....Corporation through a Research Initiation Grant. An abridged version of this paper is to appear in the Proceedings of the 19th Int l VLDB Conference, Dublin, Ireland, Aug 1993. y Supported by an IBM Resident Study Fellowship. 1 large volume of ongoing research in this area [Chou 85, Sacco 86, Cornell 89, Robinson 90, Ng 91, Falou 91, Yu 93, O Neil 93] However, none of the previous work specifically addresses how memory management can be used to achieve per class performance objectives for a multiclass workload. There are two ways that memory can be used to improve DBMS performance: for ....

D. Cornell and P. Yu, "Integration of Buffer Management and Query Optimization in a Relational Database Environment," Proc. 15th Int'l VLDB Conf., Amsterdam, The Netherlands, Aug, 1989.

....[Trivedi79, Sun88, Cao94] In large integrated applications, more detailed knowledge may be available. The database community has long taken advantage of this for buffer management. The buffer manager can use the access plan for a query to help determine the number of buffers to allocate [Sacco85, Chou85, Cornell89, Ng91, Chen93]. Ng, Faloutsos and Sellis s work on marginal gains considered the question of how much benefit a query would derive from an additional buffer. Their work stimulated the development of our approach to 3 cache management. It also stimulated Chen and Roussopoulos in their work to supplement ....

Cornell, D. W., Yu, P. S., "Integration of Buffer Management and Query Optimization in Relational Database Environment," Proc. of the 15th Int. Conf. on Very Large Data Bases, Amsterdam, Aug. 1989, pp. 247-255. 23

....of essentially introducing choose plan operators [GW89] The Starburst project has also considered incorporating a second optimization phase that chooses plans at run time [HP88] To the best of our knowledge, however, no technique has been developed to find those plans. Also, Cornell and Yu [CY89] use an integer programming model to optimize queries in a transaction environment and their buffer allocations simultaneously. Nonetheless, as their concern is different from ours, still only one plan is produced per query, and that plan is susceptible to changes in the environment. Our work ....

D. Cornell and P. Yu. Integration of buffer management and query optimization in relational database environment. In Proc. of the 15th International VLDB Conference, pages 247--255, Amsterdam, The Netherlands, August 1989.

....of essentially introducing choose plan operators [GW89] The Starburst project has also considered incorporating a second optimization phase that chooses plans at run time [HP88] To the best of our knowledge, however, no technique has been developed to find those plans. Also, Cornell and Yu [CY89] use an integer programming model to optimize queries in a transaction environment and their buffer allocations simultaneously. Nonetheless, as their concern is different from ours, still only one plan is produced per query, and that plan is susceptible to changes in the environment. Our work ....

D. Cornell and P. Yu. Integration of buffer management and query optimization in relational database environment. In Proc. of the 15th International VLDB Conference, pages 247--255, Amsterdam, The Netherlands, August 1989.

....strategies in the second group consider exclusively the demand factor, or more specifically the access patterns of queries. They include the proposal by Kaplan[8] on the implementation of INGRES[16] the Hot Set model designed by Sacca and Schkolnick[13, 14] and the strategy used by Cornell and Yu[5] in the integration of buffer management with query optimization. This approach of buffer allocation is culminated in the work of Chou and DeWitt[3] They introduce the 3 2 1 output queries buffer manager CPU and Disk buffer pool Figure 1: Buffer Manager and Related Components access patterns ....

....ongoing research, we are investigating how to extend our predictors to systems with multiple disks, and how to set up analytic models for references with data sharing. We are also studying whether the flexible and predictor approach can be incorporated into the framework proposed by Cornell and Yu[5], in order to improve the quality of query plans generated by a query optimizer. Finally, we are interested in deriving formulas for computing marginal gains of more complex queries like sort merge joins. Acknowledgements. We would like to thank H. Chou and D. DeWitt for allowing us to use their ....

D. Cornell and P. Yu. Integration of Buffer Management and Query Optimization in Relational Database Environment, Proc. 15th Intern. Conference on Very Large Data Bases (1989).

.... decisions [SunOS vadvise] Database systems researchers have long recognized the opportunity to accurately prefetch based on application level knowledge [Stonebraker81] They have also extensively examined the opportunity to apply this knowledge through advice to buffer management algorithms [Sacco82, Chou85, Cornell89, Ng91] and for I O optimizations [Selinger79] We hope to extend these techniques to prefetching. Also, our work emphasizes a more solid partitioning of function between application and operating system. Many researchers have looked into prefetching based on access patterns inferred from the stream of ....

Cornell, D. W., Yu, P. S., "Integration of Buffer Management and Query Optimization in Relational Database Environment," Proc. of the 15th Int. Conf. on Very Large Data Bases, Amsterdam, Aug. 1989, pp. 247-255.

....[Trivedi79, Sun88, Cao94] In large integrated applications, more detailed knowledge may be available. The database community has long taken advantage of this for buffer management. The buffer manager can use the access plan for a query to help determine the number of buffers to allocate [Sacco82, Chou85, Cornell89, Ng91, Chen93]. Ng, Faloutsos and Sellis s work on marginal gains considered the question of how much benefit a query would derive from an additional buffer. Their work stimulated the development of our approach to cache management. It also stimulated Chen and Roussopoulos in their work to supplement knowledge ....

Cornell, D. W., Yu, P. S., "Integration of Buffer Management and Query Optimization in Relational Database Environment," Proc. of the 15th Int. Conf. on Very Large Data Bases, Amsterdam, Aug. 1989, pp. 247-255.

....search strategy to identify the dynamic plans and the places where the choose plan operator should 22 be placed. The Starburst project has also considered incorporating a second optimization phase that chooses plans at run time [23] but no technique has been developed to find those plans. Also, [13] uses an integer programming model to optimize queries in a transaction processing environment and their buffer allocations simultaneously. However, in the end, only one plan is produced per query, and that plan is susceptible to changes in the environment. The most recent work is presented in ....

D. Cornell and P. Yu. Integration of buffer management and query optimization in relational database environment. In Proc. 15th International Conference on Very Large Data Bases, pages 247--255, Amsterdam, The Netherlands, August 1989.

....queries timing requirements to ensure that queries receive their 8 required resources in time to meet their deadlines. In addition, the effectiveness of memory allocation in reducing individual queries response times should be considered so as to make the best use of the available memory [Corn89, Yu93]. This thesis introduces a priority cognizant algorithm that dynamically chooses a target multiprogramming level and a memory allocation strategy for queries to balance the demands on the system s memory, CPU, and disks. The algorithm is then augmented with a priority adaptation mechanism to ....

....studies have addressed real time transaction scheduling [e.g. Abbo88b, Hari90a, Huan89] and disk scheduling [Abbo89, Abbo90, Care89, Chen91, Kim91] to the best of our knowledge no work has dealt with query scheduling issues in RTDBSs. The work that is most relevant to our work here is reported in [Corn89, Yu93]. In that work, the authors examined the effect of memory allocations on query response times in traditional (non real time) database systems, and they concluded that giving some of the queries their maximum required memory, while allocating the minimum possible memory to the rest, leads to ....

[Article contains additional citation context not shown here]

D. Cornell, P. Yu, "Integration of Buffer Management and Query Optimization in a Relational Database Environment", Proc. of the 15th Int. Conf. on Very Large Data Bases, August 1989.

....of other concurrently executing queries and thus make localized decisions for each query. In addition, none of these algorithms handle the allocation of memory to hash joins. The only work, to our knowledge, that directly handles memory allocation among concurrently executing hash join queries is [Corn89, Yu93] The authors introduce the concepts of memory consumption and return on consumption which are used to study the overall reduction in response times due to additional memory allocation. A heuristic algorithm based on these ideas is proposed for memory allocation. The algorithm s performance ....

D. Cornell, P. Yu, "Integration of Buffer Management and Query Optimization in a Relational Database Environment", Proc. 15th Int'l VLDB Conf., Amsterdam, The Netherlands, Aug, 1989.

....and query optimization has focused on finding ways to give the buffer manager hints about the way that buffer pages will be used[74, 75, 17, 71, 30] These hints are used to control buffer page replacement. This kind of hinting has also been applied to indexing structures[13] Cornell and Yu[24] integrate buffer management with the query optimization process including by buffer residency and contention for buffers as a part of the optimization problem. Their techniques were developed in the context of the relational model and focus primarily on improving the performance of joins. 2.7 ....

Douglas W. Cornell and Philip S. Yu. Integration of buffer management and query optimization in relational database environment. In Apers and Wiederhold [6], pages 247--255.

No context found.

D. W. Cornell and P. S. Yu. Integration of buffer management and query optimization in relational datase environment. In Proceedings of the 15th VLDB Conference, pages 247--255, Amsterdam, Aug. 1989.

No context found.

D. Cornell and P. Yu, "Integration of Buffer Management and Query Optimization in a Relational Database Environment," Proc. 15th Int'l VLDB Conf., Amsterdam, The Netherlands, August 1989.

No context found.

Cornell, D., and Yu, P., "Integration of Buffer Management and Query Optimization in a Relational Database Environment", Proc. 15th Int'l VLDB Conf., Amsterdam, The Netherlands, Aug. 1989.

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