Yu, P. S., Chen, M.-S., Wolf, J. L., Turek, J.: Parallel query processing, in: N.R. Adam, B.K. Bhargava, editors, Advanced Database Systems LNCS, Springer-Verlag, 759, 1993.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Load Balanced Query Evaluation in Shared-Everything.. - Manegold, Obermaier, Waas (1996) (Correct)
....servers is a potential for performance improvements. Hence, this paper concentrates on efficient evaluation of queries in a shared everything system. 1. 1 Parallel Query Processing In general, parallelism for the evaluation of database queries is classified into three main categories [24, 31]: inter query, inter operator, and intra operator parallelism. Inter query parallelism denotes the parallel evaluation of queries by concurrent transactions. Executing multiple operators concurrently achieves intra query parallelism. Inter operator parallelism with no execution dependencies ....
P. S. Yu, M.-S. Chen, J. L. Wolf and J. Turek. Parallel Query Processing. In N. R. Adam and B. K. Bhargava (editors), Advanced Database Systems, Volume 759 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
Data Threaded Query Evaluation in Shared-Everything.. - Manegold, Obermaier.. (1996) (Correct)
....performance improvements. Hence, this paper concentrates on efficient query evaluation in either a shared everything system or a sharedeverything cluster of a shared something system. In general, parallelism for the evaluation of database queries is classified into three main categories [SD90, YCWT93] inter query, inter operator, and intra operator parallelism. Interquery parallelism denotes the parallel evaluation of queries by concurrent transactions. Most commercial parallel database systems only use this form of parallelism [Val93a, Gra95] Executing multiple operators concurrently ....
P. S. Yu, M.-S. Chen, J. L. Wolf, and J. Turek. Parallel Query Processing. In N. R. Adam and B. K. Bhargava, editor, Advanced Database Systems, number 759 in LNCS. Springer-Verlag, 1993.
Load Balanced Query Evaluation in Shared-Everything.. - Manegold, Obermaier.. (1996) (Correct)
....is a potential for performance improvements. Hence, this paper concentrates on efficient evaluation of queries in a shared everything system. 1. 1 Parallel Query Processing Strategies In general, parallelism for the evaluation of database queries is classified into three main categories [SD90, YCWT93] inter query, inter operator, and intra operator parallelism. Inter query parallelism denotes the parallel evaluation of queries by concurrent transactions. Most commercial parallel database systems use only this form of parallelism [Val93a, Gra95] Executing multiple operators concurrently ....
P. S. Yu, M.-S. Chen, J. L. Wolf, and J. Turek. Parallel Query Processing. In N. R. Adam and B. K. Bhargava, editor, Advanced Database Systems, number 759 in LNCS. Springer-Verlag, 1993.
INS-R9711 December 31, 1997 - Report Ins-R Issn (Correct)
....a growing amount of data require higher performance of relational database systems. Hence, more and more commercial database vendors are integrating parallelism in their products [DG92, Gra95] In general, parallelism for the evaluation of database queries is classified into three main categories [SD90, YCWT93]: inter query, inter operator, and intra operator parallelism. Much research has been performed to determine which kind of parallelism to use for query processing. Database machines research concentrated on intra operator parallelism. Most commercial database systems have focused on inter query ....
P. S. Yu, M.-S. Chen, J. L. Wolf, and J. Turek. Parallel Query Processing. In N. R. Adam and B. K. Bhargava, editors, Advanced Database Systems, volume 759 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
An Equational Object-Oriented Data Model and its.. - Nishimura, Ohori, Tajima (1996) (1 citation) (Correct)
....collection of data is data parallelism, which is based on the mechanism of applying the same operation to each data item simultaneously. This paradigm works well for relational databases in which each relation is represented as a collection of independent tuples, and several parallel databases [DG92, YCWT93] have been developed based on this paradigm. However, object oriented databases seem to be difficult to be integrated with the paradigm of data parallelism because of the existence of navigation. For example, suppose a database of the ancestry trees of viruses is defined as a set of objects of the ....
Philip S. Yu, Ming-Syan Chen, Joel L. Wolf, and John Turek. Parallel query processing. In Nabil R. Adam and Bharat K. Bhargava, editors, Advanced Database Systems, LNCS vol. 759, chapter 12, pages 229--258, 1993.
Join Query Optimization in Parallel Database Systems - Jhingran, Padmanabhan, Shatdal (1993) (1 citation) (Correct)
.... past work on this topic has focused on finding heuristic algorithms [2, 7] or on outlining a general algorithm with high complexity [3] Also, there has been work on scheduling and processor allocation of query tasks assuming a optimal query plan has already been generated [1] Yu et al. [9] review some aspects of parallel query processing but have not studied the optimization problem in detail. Lanzelotte et al. [5] have studied some trade offs in cost of optimization and the quality of plans obtained in a parallel environment. In this paper, the parallel query optimization problem ....
Philip S. Yu, Ming-Syan Chen, Joel L. Wolf, and John J. Turek. Parallel query processing. Research Report RC 18903, IBM T. J. Watson Research Center, 1993.
Efficient Parallel Query Processing by Graph Ranking - Dereniowski, Kubale (2006) (Correct)
No context found.
Yu, P. S., Chen, M.-S., Wolf, J. L., Turek, J.: Parallel query processing, in: N.R. Adam, B.K. Bhargava, editors, Advanced Database Systems LNCS, Springer-Verlag, 759, 1993.
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