Sciweavers

119 search results - page 7 / 24
» Complex Preferences for Answer Set Optimization
Sort
View
PPDP
2010
Springer
13 years 5 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
CP
2004
Springer
14 years 1 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 8 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
DBISP2P
2004
Springer
111views Database» more  DBISP2P 2004»
14 years 1 months ago
Processing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Ch...
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 28 days ago
Optimizing linear counting queries under differential privacy
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...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...