Sciweavers

51 search results - page 3 / 11
» Computing consistent query answers using conflict hypergraph...
Sort
View
PODS
2005
ACM
147views Database» more  PODS 2005»
14 years 5 months ago
Peer data exchange
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
Ariel Fuxman, Phokion G. Kolaitis, Renée J....
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 7 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
BTW
2007
Springer
136views Database» more  BTW 2007»
13 years 11 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
SDMW
2007
Springer
13 years 11 months ago
Query Rewriting Algorithm Evaluation for XML Security Views
Abstract. We investigate the experimental effectiveness of query rewriting over XML security views. Our model consists of access control policies specified over DTDs with XPath e...
Nataliya Rassadko
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 8 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...