article · 2013

Optimized Query Plan Algorithm for the Nested Query

Chittaranjan Pradhan, Sushree Sangita Jena

Cited by 0Abstract and details only

Abstract

Abstract- The SQL language allows users to express the queries that have nested sub-queries in them. Optimization of nested queries has received considerable attention over the last few years. Most of the previous optimization work has assumed that at most one block is nested within any given block. The two main contributions of this report are: 1. Optimization strategies for queries that have an arbitrary number of blocks nested within any given block, and 2. a new algorithm for the execution of nested queries, involving one or more other joins, in a multi-processor environment. The new algorithm cuts down the processing costs over conventional algorithms.

Cite this paper

APA 7

Pradhan, C., & Jena, S. S. (2013). Optimized Query Plan Algorithm for the Nested Query.

MLA 9

Pradhan, Chittaranjan, and Sushree Sangita Jena. “Optimized Query Plan Algorithm for the Nested Query.” 2013.

Chicago

Pradhan, Chittaranjan, and Sushree Sangita Jena. 2013. “Optimized Query Plan Algorithm for the Nested Query.”

Harvard

Pradhan, C. and Jena, S.S. (2013) ‘Optimized Query Plan Algorithm for the Nested Query’.

BibTeX

@article{pradhan2013optimized,
  title = {{Optimized Query Plan Algorithm for the Nested Query}},
  author = {Pradhan, Chittaranjan and Jena, Sushree Sangita},
  year = {2013}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.