52 search results - page 8 / 11 » On the Decidability of Query Containment under Constraints |
PVLDB
2010
13 years 5 months ago
2010
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract— Checking if an SQL query has been written correctly is not an easy task. Formal verification is not applicable, since it is based on comparing a specification with an...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
BIRTHDAY
1992
Springer
13 years 11 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...