Sciweavers

912 search results - page 122 / 183
» Model and Schema Registry
Sort
View
FOIKS
2008
Springer
15 years 5 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 6 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
EDBT
2012
ACM
225views Database» more  EDBT 2012»
13 years 6 months ago
Differentially private search log sanitization with optimal output utility
Web search logs contain extremely sensitive data, as evidenced by the recent AOL incident. However, storing and analyzing search logs can be very useful for many purposes (i.e. in...
Yuan Hong, Jaideep Vaidya, Haibing Lu, Mingrui Wu
AIPS
1998
15 years 5 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
16 years 5 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...