Sciweavers

PODS
2008
ACM
155views Database» more  PODS 2008»
14 years 5 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...
PODS
2008
ACM
113views Database» more  PODS 2008»
14 years 5 months ago
On searching compressed string collections cache-obliviously
Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahu...
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 5 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
PODS
2008
ACM
114views Database» more  PODS 2008»
14 years 5 months ago
Estimating PageRank on graph streams
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
PODS
2008
ACM
108views Database» more  PODS 2008»
14 years 5 months ago
Complexity and composition of synthesized web services
Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Ne...
PODS
2008
ACM
110views Database» more  PODS 2008»
14 years 5 months ago
Static analysis of active XML systems
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...
Serge Abiteboul, Luc Segoufin, Victor Vianu
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 5 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 5 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 5 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 5 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch