Set-Oriented Mining for Association Rules in Relational Databases

M.A.W. Houtsma, M.A.W. Houtsma, A. Swami

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    125 Citations (Scopus)
    67 Downloads (Pure)


    Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries, and discuss the optimization of these algorithms. After analytical evaluation, an algorithm named SETM emerges as the algorithm of choice. SETM uses only simple database primitives, viz. sorting and merge-scan join. SETM is simple, fast and stable over the range of parameter values. The major contribution of this paper is that it shows that at least some aspects of data mining can be carried out by using general query languages such as SQL, rather than by developing specialized black-box algorithms. The set-oriented nature of SETM facilitates the development of extensions
    Original languageUndefined
    Title of host publicationProc. 12th Int. Conf. on Data Engineering
    Place of PublicationTaipeh
    ISBN (Print)0-8186-69101
    Publication statusPublished - 21 Feb 1995
    Event11th International Conference on Data Engineering, ICDE 1995 - Taipei
    Duration: 6 Mar 199510 Mar 1995
    Conference number: 11

    Publication series



    Other11th International Conference on Data Engineering, ICDE 1995
    Abbreviated titleICDE


    • METIS-119964
    • IR-19441

    Cite this