Sciweavers

443 search results - page 49 / 89
» System P: Completeness-driven Query Answering in Peer Data M...
Sort
View
ISEMANTICS
2010
13 years 7 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...
IDEAS
2008
IEEE
96views Database» more  IDEAS 2008»
14 years 3 months ago
Robust aggregation in peer-to-peer database systems
Peer-to-peer database systems (P2PDBs) aim at providing database services with node autonomy, high availability and loose coupling between participating nodes by building the DBMS...
Norvald H. Ryeng, Kjetil Nørvåg
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 10 months ago
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems....
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu, Rong...
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 10 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...