Article

Free access

Scheduling and mapping for parallel execution of extended SQL queries

Authors:

A. Hameurlain,

F. MorvanAuthors Info & Claims

CIKM '95: Proceedings of the fourth international conference on Information and knowledge management

Pages 197 - 204

https://doi.org/10.1145/221270.221567

Published: 02 December 1995 Publication History

PDF eReader

References

[1]

ALl, H H, ET AL A split graph based heuristic for task allocation in distributed systems. In 7th Intl. Conj. on Parallel and Distributed Computing Systems PDCS'94 (Oct 1994), pp. 336-342.

Google Scholar

[2]

BEERI, C, AND I'L#MAKRISHNAN, 1#. On the power of magic. in Proc. of the A CM SIGMOD Symposium on Principles oJ Database SystemsDistributed Systems (1987), pp. 269-283.

Digital Library

Google Scholar

[3]

BIrrON, D., Er hE Benchmarklng database systems- a systematic approach. In Proc. of the 1983 VLDB con/ (1983), pp. 8-19.

Digital Library

Google Scholar

[4]

CItEN, M., ET AL. Scheduling and processor allocation for parallel execution of multi-join queries. In Proc. 8th intl. Conj. Data Eng. (feb. 1992), i. C. S. Press, Ed., pp. 58-67.

Crossref

Google Scholar

[5]

CIIEN, M, ET AL Using segmented right-deep trees for the execution of pipelined hash joins. In 18th Int. Conj. VLDB, Val,couver (Sept. 1992), pp. 15-26.

Digital Library

Google Scholar

[6]

CONWAY, 1#, El" AL. The Theory of Scheduling. Addison- Wesley, 1967.

Google Scholar

[7]

I_)EPREZ. C Organisation et optimisation de la base de donnees relationnetle SIAM sur la machine parallele DBC 1012. Tech. Rep. IRIT/CTI 94, Lab. IRIT/ CTI Sud Toulouse, June 1994.

Google Scholar

[8]

DEwII'#', D, AND GRAY, d Database systems: The future of high performance database systems. Communicattons of the A CM 35, 6 (t992), 85-98.

Digital Library

Google Scholar

[9]

GARDARIN, G, AND V,XLDURI#.Z. P ESQL2: An objectoriented sql with f-logic semantics. In IEEE Int, conj. on Data Eng. (1992), pp. 320-327.

Digital Library

Google Scholar

[10]

HAMEURLAIN. A, E'F AL An analytical method to allocate processors in high performance parallel execution of recursive queries, in Intl. Conf. DEXA'92 (1992), S. Verlag, Ed., pp. 44-47.

Crossref

Google Scholar

[11]

HAMEURLAIN, A., AND _~1ORVAN, F Exploiting interoperation for SQL query optimization. In Intl. Conj. DEXA '94 (1994), L. Spring Verlag, Ed., pp. 759-768.

Crossref

Google Scholar

[12]

HAMEURLAIN, A., AND MORVAN, 1" Scheduling and parallelism for extended SQL query optimization. In 7th Intl. Conj. on Parallel and Distributed Computing Systems PDCS'94 (1994), pp. 466-471.

Google Scholar

[13]

HASAN, W., AND MOTWANI, 1-{,. Optimization algorithms for pipelined parallelism. In Intl. Con}, VLDB'94 (1994).

Digital Library

Google Scholar

[14]

HONO, W Exploiting inter-operation parallelism in XPRS. In A CM SIGMOD Intl. Conf. on Management o} Data (1992), pp. 19-28.

Digital Library

Google Scholar

[15]

IOANt#IDIS, Y. AND KONO. Y C, Randomized algorithms for optimizing large join queries. In Proc. of the 1990 A CM SIG- MOD Conf. on the Manag. of Data,. Atlantic City (1990), pp. 312-321.

Digital Library

Google Scholar

[16]

LANZELOTTE, 1-# S G., ET AL On the effectiveness of optimization search strategies for parallel execution spaces, in Proc. of the 19th VLDB Conf., Dublin (1993), pp. 493-504.

Digital Library

Google Scholar

[17]

Lit, H. ET AL. Query Processing tn Parallel RelationnaI Database Systems. IEEE Computer Society Press, 1994.

Digital Library

Google Scholar

[18]

SCHNEIDER, D., AND DEWITT, D. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In Proc, oJ the ACM SIGMOD Conf. (1989), pp. 110-121.

Digital Library

Google Scholar

[19]

SCHNEIDER, 1_). AND DEWITT, D Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In Proc. of thel 6th VLDB Conf., Brzsbane, Australia (1990), pp. 469-480.

Digital Library

Google Scholar

[20]

SWAMI, A. Optimization of large join queries : Combining heuristics and combinatorial techniques. In Proc. of the 1989 A CM-SIGMOD Conj. on Management of Data, Portland, USA (1989), vol. 18, pp. 367-376.

Crossref

Google Scholar

[21]

VALDURIEZ, P . AND KrlOSlqAI;IAN, S Parallel evaluation of the transitive closure of a database relation. Intl. Jo. of Parallel Programming 17, 1 (1988), 19-42.

Digital Library

Google Scholar

[22]

WOODSIDE, C M, AND MON#rFORTON, G G. Fast allocation of processes in distributed and parallel systems. 1EEE Trans. on Parallel and Distributed Systems 4, 2 (feb. 1993), 164- 174.

Digital Library

Google Scholar

[23]

ZIANE, M, ET AL Parallel query processing in DBS3. In 2nd Int. Conj. on Parallel and Distribued Information Systems (1993).

Digital Library

Google Scholar

Cited By

View all

Kosch H(2018)Managing the operator ordering problem in parallel databasesFuture Generation Computer Systems10.1016/S0167-739X(99)00080-116:6(665-676)Online publication date: 29-Dec-2018
https://dl.acm.org/doi/10.1016/S0167-739X%2899%2900080-1
Taniar DLeung CRahayu WGoel S(2008)BibliographyHigh‐Performance Parallel Database Processing and Grid Databases10.1002/9780470391365.biblio(511-539)Online publication date: 11-Mar-2008
https://doi.org/10.1002/9780470391365.biblio
Bouganim LFlorescu DDageville B(2005)Skew handling in the DBS3 parallel database systemParallel Computation10.1007/3-540-61695-0_9(98-109)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61695-0_9
Show More Cited By

Index Terms

Recommendations

Sql: Learn Basics of Queries and Implement Easily (sql programming, SQL 2016, sql database programming, sql for beginners, sql beginners guide, sql ... sql workbook, sql guide, MSSQL) (Volume 1)
Parallel job scheduling algorithms
Single machine parallel-batch scheduling with deteriorating jobs

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for ...

Comments

Information & Contributors

Information

Published In

CIKM '95: Proceedings of the fourth international conference on Information and knowledge management

December 1995

434 pages

ISBN:0897918126

DOI:10.1145/221270

Chairman:
Charles Nicholas
Univ. of Maryland, Baltimore
,
Editors:
Niki Pissinou,
Avi Silberschatz,
E. K. Park,
Kia Makki
Univ. of Nevada, Las Vegas

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 December 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM95

Sponsor:

SIGWEB
NSF
SIGAI
UMBC
SIGIR
SIGLINK
AAAI

CIKM95: Conference on Information and Knowledge Management

November 29 - December 2, 1995

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
345
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)6

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kosch H(2018)Managing the operator ordering problem in parallel databasesFuture Generation Computer Systems10.1016/S0167-739X(99)00080-116:6(665-676)Online publication date: 29-Dec-2018
https://dl.acm.org/doi/10.1016/S0167-739X%2899%2900080-1
Taniar DLeung CRahayu WGoel S(2008)BibliographyHigh‐Performance Parallel Database Processing and Grid Databases10.1002/9780470391365.biblio(511-539)Online publication date: 11-Mar-2008
https://doi.org/10.1002/9780470391365.biblio
Bouganim LFlorescu DDageville B(2005)Skew handling in the DBS3 parallel database systemParallel Computation10.1007/3-540-61695-0_9(98-109)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61695-0_9
Morvan FHameurlain ALamont GHaddad HPapadopoulos GPanda B(2002)Dynamic memory allocation strategies for parallel query executionProceedings of the 2002 ACM symposium on Applied computing10.1145/508791.508964(897-901)Online publication date: 11-Mar-2002
https://dl.acm.org/doi/10.1145/508791.508964
Hameurlain AMorvan F(2000)An overview of parallel query optimization in relational systemsProceedings 11th International Workshop on Database and Expert Systems Applications10.1109/DEXA.2000.875090(629-634)Online publication date: 2000
https://doi.org/10.1109/DEXA.2000.875090

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Sql: Learn Basics of Queries and Implement Easily (sql programming, SQL 2016, sql database programming, sql for beginners, sql beginners guide, sql ... sql workbook, sql guide, MSSQL) (Volume 1)

Parallel job scheduling algorithms

Single machine parallel-batch scheduling with deteriorating jobs