ICDT
2003
ACM
13 years 10 months ago
2003
ACM
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
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...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
tended abstract to appear ICDT 2003 (Jan 2003, Siena)
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...