Sciweavers

3305 search results - page 29 / 661
» Can we Rely on SQL
Sort
View
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
14 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
PVLDB
2010
96views more  PVLDB 2010»
13 years 6 months ago
Scalable Data Exchange with Functional Dependencies
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
Bruno Marnette, Giansalvatore Mecca, Paolo Papotti
TSE
2008
89views more  TSE 2008»
13 years 7 months ago
WASP: Protecting Web Applications Using Positive Tainting and Syntax-Aware Evaluation
Many software systems have evolved to include a Web-based component that makes them available to the public via the Internet and can expose them to a variety of Web-based attacks. ...
William G. J. Halfond, Alessandro Orso, Pete Manol...
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
14 years 9 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 1 months ago
Optimizing Nested Queries with Parameter Sort Orders
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-n...
Ravindra Guravannavar, H. S. Ramanujam, S. Sudarsh...