Sciweavers

3368 search results - page 128 / 674
» The Complexity of Query Reliability
Sort
View
ISEMANTICS
2010
13 years 8 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
BMCBI
2007
160views more  BMCBI 2007»
13 years 10 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
CSL
2003
Springer
14 years 3 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
ICDT
1995
ACM
105views Database» more  ICDT 1995»
14 years 1 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
EDBTW
2006
Springer
14 years 1 days ago
The Importance of Algebra for XML Query Processing
Abstract. Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for X...
Stelios Paparizos, H. V. Jagadish