Sciweavers

2229 search results - page 267 / 446
» The Case for Grounding Databases
Sort
View
EDBT
2002
ACM
136views Database» more  EDBT 2002»
16 years 6 months ago
Rewriting Unions of General Conjunctive Queries Using Views
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
Junhu Wang, Michael J. Maher, Rodney W. Topor
EDBT
2004
ACM
234views Database» more  EDBT 2004»
16 years 6 months ago
A Condensation Approach to Privacy Preserving Data Mining
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
Charu C. Aggarwal, Philip S. Yu
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 6 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher