Sciweavers

521 search results - page 103 / 105
» Answering Queries by Semantic Caches
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
VMCAI
2007
Springer
14 years 1 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
ICLP
2010
Springer
13 years 11 months ago
Bisimilarity in Concurrent Constraint Programming
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
Andres A. Aristizabal P.
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
14 years 8 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
PODS
2009
ACM
86views Database» more  PODS 2009»
14 years 8 months ago
Reverse data exchange: coping with nulls
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...