Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKhaitan, P-
dc.contributor.authorSatish, K M-
dc.contributor.authorKorra, S B-
dc.contributor.authorJena, S K-
dc.identifier.citationProceedings of 2nd International Conference on Computer Science and its Applications CSA 2009, Dec 10-12, 2009, South Korea, P 147-152en
dc.descriptionCopyright for the article belongs to proceedings publisher IEEEen
dc.description.abstractThe SQL language allows users to express queries that have nested subqueries in them. Optimization of nested queries has received considerable attention over the last few years. Executing a query after unnesting it leads to lesser processing compared to executing it in the nested form itself. Kim’s algorithm for unnesting nested queries has a COUNT bug for Join Aggregate type queries. Richard A. Ganski and U. Dayal gave general strategies to avoid the COUNT bug. M. Muralikrishna modified Kim's algorithm so that it avoids the COUNT bug. Apart from this, he proposed an integrated algorithm for generating query plans for a given input query. In this paper, we have given a solution for implementing the Kim's modified algorithm of unnesting nested queries and this also avoids the COUNT bug convincingly. We observed that the integrated algorithm holds flaws and modifications for correcting these flaws have been proposed in this paper. All existing and proposed query plans have been implemented and the experimental results have determined those query plans which are computationally better than others generated by integrated algorithm. The above merits have been incorporated into a new unnesting algorithm.en
dc.format.extent947977 bytes-
dc.relation.ispartofseriesIEEE Proceedings;Vol. I-
dc.titleImproved query plans for unnesting nested SQL queriesen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Query Optimization.pdf925.76 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.