作者: Johannes Fischer , Luc De Raedt
DOI: 10.1007/978-3-540-24775-3_74
关键词:
摘要: Inductive queries are to an inductive database that generate a set of patterns in data mining context. querying poses new challenges and technology. We study conjunctive queries, which can be written as conjunction monotonic anti-monotonic subquery. introduce the query optimization problem, is concerned with minimizing cost computing answer query. In it assumed there costs c m associated evaluating pattern w.r.t. subquery respectively. The aim then minimize total needed compute all solutions Secondly, we present algorithm aims at optimizing context domain strings evaluate on challenging computational biology.