Sciweavers

1778 search results - page 237 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
16 years 4 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 4 months ago
Inverting schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
CIKM
2004
Springer
15 years 10 months ago
Extending and inferring functional dependencies in schema transformation
We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schemat...
Qi He, Tok Wang Ling
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
16 years 5 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...