Sciweavers

1418 search results - page 147 / 284
» A Theory of Stream Queries
Sort
View
187
Voted
KR
2004
Springer
16 years 12 days ago
Condensed Representations for Inductive Logic Programming
When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various t...
Luc De Raedt, Jan Ramon
228
Voted
ACST
2006
15 years 8 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
195
Voted
ITCC
2005
IEEE
16 years 18 days ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
229
Voted
DLOG
2008
15 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
219
Voted
ATAL
2010
Springer
15 years 8 months ago
Preference elicitation for risky prospects
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...
Greg Hines, Kate Larson