|
DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1123
|
| Title: | Improved query plans for unnesting nested SQL queries |
| Authors: | Khaitan, P
Satish, K M
Korra, S B
Jena, S K |
| Keywords: | query
optimization
sql
nested
unnesting |
| Issue Date: | Dec-2009 |
| Publisher: | IEEE |
| Citation: | Proceedings of 2nd International Conference on Computer Science and its Applications CSA 2009, Dec 10-12, 2009, South Korea, P 147-152 |
| Series/Report no.: | IEEE Proceedings;Vol. I |
| Abstract: | The 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 implem... |
| Description: | Copyright for the article belongs to proceedings publisher IEEE |
| URI: | http://www.stanford.edu/~pranavkh/Query%20Optimization.pdf
http://hdl.handle.net/2080/1123 |
| Appears in Collections: | Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| Query Optimization.pdf | | 925Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
