176 search results - page 3 / 36 » On the analysis of queries with counting constraints |
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
FOSSACS
2010
Springer
14 years 17 days ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
WCET
2003
13 years 7 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
TCS
1998
13 years 5 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...