Sciweavers

2432 search results - page 328 / 487
» Cryptographic logical relations
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 6 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
LPNMR
2009
Springer
16 years 1 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
ICIW
2008
IEEE
16 years 29 days ago
DBOWL: Towards a Scalable and Persistent OWL Reasoner
—With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems....
María del Mar Roldán García, ...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
16 years 21 days ago
Privacy in GLAV Information Integration
Abstract. We define and study formal privacy guarantees for information integration systems, where sources are related to a public schema by mappings given by source-to-target dep...
Alan Nash, Alin Deutsch
CLUSTER
2005
IEEE
16 years 5 days ago
A pipelined data-parallel algorithm for ILP
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
Nuno A. Fonseca, Fernando M. A. Silva, Víto...