Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

DAWAK
2003
Springer

favoriteEmaildiscussreport

129views Information Technology» more DAWAK 2003»

Fighting Redundancy in SQL

14 years 4 months ago

Fighting Redundancy in SQL

Download date.spd.louisville.edu

Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ensuring that redundant computations are done only once. We specify a procedure to build a query plan implementing our method, give an example of its use and argue that it oﬀers performance advantages over traditional approaches.

Antonio Badia, Dev Anand

Real-time Traffic

Data Mining | DAWAK 2003 | Many SQL Queries | Redundant Computations | Subqueries Exhibit Redundancy |

claim paper

Related Content

» Optimization of Complex Nested Queries in Relational Databases

» Redundancy Awareness in SQL Queries

» Join minimization in XMLtoSQL translation an algebraic approach

» Redundancy and information leakage in finegrained access control

» EST Express PHPMySQL based automated annotation of ESTs from expression libraries

» WinMagic Subquery Elimination Using Window Aggregation

» Discovery and Application of Functional Dependencies in Conjunctive Query Mining

» HMMPayl an application of HMM to the analysis of the HTTP Payload

» YSmart Yet Another SQLtoMapReduce Translator

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	DAWAK
Authors	Antonio Badia, Dev Anand

Comments (0)