2675 search results - page 402 / 535 » From Ontology to Relational Databases |
182
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
279
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
165
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
214
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
222
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...