DYNAMIC DEGREE OF QUERY PARALLELISM OPTIMIZATION

Approaches presented herein enable dynamic optimization of a degree to which a query is parallelized for execution. More specifically, a priority associated with an obtained user query for execution is identified. A real-time metric indicating availability of one or more runtime resources is checked...

Full description

Saved in:
Bibliographic Details
Main Authors Zuzarte, Calisto, Rathore, Bhavesh, Mehrotra, Gaurav, Iyer, Abhishek
Format Patent
LanguageEnglish
Published 17.11.2022
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:Approaches presented herein enable dynamic optimization of a degree to which a query is parallelized for execution. More specifically, a priority associated with an obtained user query for execution is identified. A real-time metric indicating availability of one or more runtime resources is checked. An optimal degree of parallelism is calculated based on the priority associated with the obtained user query and the real-time availability metric. A plan is generated for executing the query using the calculated optimal degree of parallelism.
Bibliography:Application Number: US202117320510