Sciweavers

47 search results - page 6 / 10
» Beginnings of a Theory of General Database Completions
Sort
View
CTCS
1989
Springer
13 years 12 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
PPDP
2010
Springer
13 years 5 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
HT
2003
ACM
14 years 1 months ago
Which semantic web?
Through scenarios in the popular press and technical papers in the research literature, the promise of the Semantic Web has raised a number of different expectations. These expect...
Catherine C. Marshall, Frank M. Shipman III
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 8 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
KDD
2009
ACM
133views Data Mining» more  KDD 2009»
14 years 8 months ago
On the tradeoff between privacy and utility in data publishing
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
Tiancheng Li, Ninghui Li