Sciweavers

18 search results - page 1 / 4
» Fighting Redundancy in SQL
Sort
View
DAWAK
2003
Springer
13 years 10 months ago
Fighting Redundancy in SQL
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 ...
Antonio Badia, Dev Anand
ICDE
2006
IEEE
213views Database» more  ICDE 2006»
13 years 11 months ago
Optimization of Complex Nested Queries in Relational Databases
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
Bin Cao
ICDE
2006
IEEE
152views Database» more  ICDE 2006»
13 years 11 months ago
Redundancy Awareness in SQL Queries
In this paper, we study SQL queries with aggregate subqueries that share common tables and conditions with the outer query. While several approaches can deal with such queries, th...
Bin Cao, Antonio Badia
SIGMOD
2006
ACM
112views Database» more  SIGMOD 2006»
14 years 5 months ago
Join minimization in XML-to-SQL translation: an algebraic approach
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
Murali Mani, Song Wang, Daniel J. Dougherty, Elke ...
SIGMOD
2006
ACM
124views Database» more  SIGMOD 2006»
14 years 5 months ago
Redundancy and information leakage in fine-grained access control
The current SQL standard for access control is coarse grained, in that it grants access to all rows of a table or none. Fine-grained access control, which allows control of access...
Govind Kabra, Ravishankar Ramamurthy, S. Sudarshan