Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Patterns on Queries
verfasst von : Arno Siebes, Diyah Puspitaningrum
Erschienen in: Inductive Databases and Constraint-Based Data Mining
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
One of the most important features of any database system is that it supports
queries
. For example, in relational databases one can construct new tables from the stored tables using relational algebra. For an inductive database, it is reasonable to assume that the stored tables have been modelled. The problem we study in this chapter is: do the models available on the stored tables help to model the table constructed by a query? To focus the discussion, we concentrate on one type of modelling, i.e., computing frequent item sets. This chapter is based on results reported in two earlier papers [12, 13]. Unifying the approaches advocated by those papers as well as comparing them is the main contribution of this chapter.