Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Lakhal, Lotfi* | Nedjar, Sébastien | Cicchetti, Rosine
Affiliations: Laboratoire d’Informatique Fondamentale de Marseille, Aix-Marseille Université, 13625 Aix-en-Provence Cedex, France
Correspondence: [*] Corresponding author: Lotfi Lakhal, Laboratoire d’Informatique Fondamentale de Marseille (LIF), CNRS UMR 7279, Aix-Marseille Université, IUT d’Aix-en-Provence, Avenue Gaston Berger, 13625 Aix-en-Provence Cedex, France. E-mail: Lotfi.Lakhal@lif.univ-mrs.fr
Note: [1] RowId is an attribute used as an identifier for the relation tuples. ti is the tuple provided with i as its RowId.
Note: [10] π′(E) is said rougher than π(E).
Note: [11] Tid(r)={Rowid(t)∣t∈r}.
Abstract: The Skyline concept has been introduced in order to exhibit the best objects according to all the criterion combinations and makes it possible to analyze the relationships between Skyline objects. Like the data cube, the Skycube groups all the multidimensional Skylines and it is so voluminous that reduction approaches are a necessity. In this paper, we define an approach which partially materializes the Skycube. The underlying idea is to discard from the representation the Skycuboids which can be computed again easily. To meet this reduction objective, we characterize a formal framework: the Agree Concept Lattice. It provides a formal framework which makes it possible to improve computation time, reduce representation and easily navigate through the Hasse diagram in order to focus on the most relevant skycuboids. This structure is generic, applies to various database analysis problems and combines both formal concept analysis and database theory. It makes use of the concepts of agree set and database partition. They are associated to define the Agree Concept of a database relation. The set of all the Agree Concepts is organized within the Agree Concept Lattice. From this structure, we derive the Skyline concept lattice which is one of its constrained instances for efficient multidimensional Skyline analysis. The strong points of our approach are: (i) it is attribute oriented; (ii) it provides a boundary for the number of lattice nodes; (iii) it facilitates the navigation within the Skycuboids.
Keywords: Concept lattices, databases, data cube, Skyline, Olap-mining
DOI: 10.3233/IDA-163111
Journal: Intelligent Data Analysis, vol. 21, no. 5, pp. 1245-1265, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl