Sciweavers

736 search results - page 129 / 148
» Confidence-Aware Join Algorithms
Sort
View
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
14 years 2 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
14 years 2 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
POPL
2004
ACM
14 years 10 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
14 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor