Sciweavers

79 search results - page 8 / 16
» On the expressibility of functions in XQuery fragments
Sort
View
ICDT
2003
ACM
121views Database» more  ICDT 2003»
15 years 11 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
16 years 7 months ago
Unifying the Processing of XML Streams and Relational Data Streams
Relational data streams and XML streams have previously provided two separate research foci, but their unified support by a single Data Stream Management System (DSMS) is very des...
Xin Zhou, Hetal Thakkar, Carlo Zaniolo
DIAGRAMS
2004
Springer
15 years 9 months ago
What Can Spider Diagrams Say?
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
Gem Stapleton, John Howse, John Taylor, Simon J. T...
PVLDB
2008
123views more  PVLDB 2008»
15 years 5 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
DAC
2003
ACM
16 years 7 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...