Sciweavers

265 search results - page 31 / 53
» Logical Queries over Views: Decidability and Expressiveness
Sort
View
FCT
2007
Springer
15 years 4 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
74
Voted
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
15 years 3 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
15 years 10 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 10 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 1 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu