2005
DOI: 10.1007/11430919_80
|View full text |Cite
|
Sign up to set email alerts
|

On Multiple Query Optimization in Data Mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…Multiple-query processing was first studied in late 1980s [32,33], and it still is an active research area [1,14,35,36,38]. But existing works do not consider multiple top-N queries.…”
Section: Related Workmentioning
confidence: 99%
“…Multiple-query processing was first studied in late 1980s [32,33], and it still is an active research area [1,14,35,36,38]. But existing works do not consider multiple top-N queries.…”
Section: Related Workmentioning
confidence: 99%
“…To the best of our knowledge, the only two multiple-query processing methods for data mining queries are Mine Merge [19] and Common Counting [20], mentioned above. Recently, the need for multiple-query optimization has been postulated in the somewhat related research area of inductive logic programming, where a technique based on similar ideas as Common Counting has been proposed, consisting in combining similar queries into query packs [6].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, a new problem of optimizing processing of batches of frequent itemset queries has been considered [19] [20]. The problem was motivated by data mining systems working in a batch mode or periodically refreshed data warehouses, but is also relevant in the context of multi-user, interactive data mining environments.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation