Sciweavers

265 search results - page 38 / 53
» Logical Queries over Views: Decidability and Expressiveness
Sort
View
ICDT
2009
ACM
125views Database» more  ICDT 2009»
15 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
100
Voted
BTW
2007
Springer
164views Database» more  BTW 2007»
15 years 4 months ago
Integrating Structural Joins into a Tuple-Based XPath Algebra
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...
Christian Mathis
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 10 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
CORR
2007
Springer
162views Education» more  CORR 2007»
14 years 10 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
JODL
2000
123views more  JODL 2000»
14 years 10 months ago
On Z39.50 wrapping and description logics
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
Yannis Velegrakis, Vassilis Christophides, Panos C...