Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Currently, there is tremendous interest in providing ad-hoc mining capabilities in database management systems. As a first step towards this goal, in [15]  proposed an architecture for supporting constraint-based, human-centered, exploratory mining of various kinds of rules including associations, introduced the notion of constrained frequent set queries (CFQs), and developed effective pruning optimizations for CFQs with 1-variable (1-var) constraints.  While 1-var constraints are useful for constraining the antecedent and consequent separately, many natural examples of CFQs illustrate the need for constraining the antecedent and consequent jointly, for which 2-variable (2-var) constraints are indispensable. Developing pruning optimizations for CFQs with 2-var constraints is the subject of this paper. But this is a difficult problem because: (i) in 2-var constraints, both variables keep changing and, unlike 1-var constraints, there is no fixed target for pruning; (ii) as  show, “conventional” monotonicity-based optimization techniques do not apply effectively to 2-var constraints.  The contributions are as follows. (1)  introduce a notion of  quasi-succinctness , which allows a quasi-succinct 2-var constraint to be reduced to two succinct 1-var constraints for pruning. (2)  characterize the class of 2-var constraints that are quasi-succinct. (3)  develop heuristic techniques for non-quasi-succinct constraints. Experimental results show the effectiveness of all our techniques. (4)  propose a query optimizer for CFQs and show that for a large class of constraints, the computation strategy generated by the optimizer is  ccc-optimal , i.e., minimizing the effort incurred w.r.t. constraint checking and support counting.
['Laks V. S. Lakshmanan', 'Raymond T. Ng', 'Jiawei Han', 'Alex Pang']
I am writing a research paper on a idea Optimization of constrained frequent set queries with 2-variable constraints
[{"from": "human", "value": "I am writing a research paper on a idea Optimization of constrained frequent set queries with 2-variable constraints"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Currently, there is tremendous interest in providing ad-hoc mining capabilities in database management systems. As a first step towards this goal, in [15]  proposed an architecture for supporting constraint-based, human-centered, exploratory mining of various kinds of rules including associations, introduced the notion of constrained frequent set queries (CFQs), and developed effective pruning optimizations for CFQs with 1-variable (1-var) constraints.  While 1-var constraints are useful for constraining the antecedent and consequent separately, many natural examples of CFQs illustrate the need for constraining the antecedent and consequent jointly, for which 2-variable (2-var) constraints are indispensable. Developing pruning optimizations for CFQs with 2-var constraints is the subject of this paper. But this is a difficult problem because: (i) in 2-var constraints, both variables keep changing and, unlike 1-var constraints, there is no fixed target for pruning; (ii) as  show, \u201cconventional\u201d monotonicity-based optimization techniques do not apply effectively to 2-var constraints.  The contributions are as follows. (1)  introduce a notion of  quasi-succinctness , which allows a quasi-succinct 2-var constraint to be reduced to two succinct 1-var constraints for pruning. (2)  characterize the class of 2-var constraints that are quasi-succinct. (3)  develop heuristic techniques for non-quasi-succinct constraints. Experimental results show the effectiveness of all our techniques. (4)  propose a query optimizer for CFQs and show that for a large class of constraints, the computation strategy generated by the optimizer is  ccc-optimal , i.e., minimizing the effort incurred w.r.t. constraint checking and support counting."}]