Deriving skyline points over dynamic and incomplete databases
The rapid growth of data is inevitable, and retrieving the best results that meet the user’s preferences is essential. To achieve this, skylines were introduced in which data items that are not dominated by the other data items in the database are retrieved as results (skylines). In most of the exis...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Universiti Utara Malaysia(UUM)
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/57268/ http://irep.iium.edu.my/57268/ http://irep.iium.edu.my/57268/1/54268_Deriving%20skyline%20points.pdf http://irep.iium.edu.my/57268/7/57268%20Deriving%20skyline%20points%20over%20dynamic%20and%20incomplete%20databases%20WOS.pdf |
| Summary: | The rapid growth of data is inevitable, and retrieving the best results that meet the user’s preferences is essential. To achieve this, skylines were introduced in which data items that are not dominated by the other data items in the database are retrieved as results (skylines). In most of the exist-ing skyline approaches, the databases are assumed to be static and complete. However, in real world scenario, databases are not complete especially in multidimensional databases in which some dimensions may have missing values. The databases might also be dynamic in which new data items are inserted while existing data items are deleted or updated. Blindly performing pairwise comparisons on the whole data items after the changes are made is inappropriate as not all data items need to be compared in identifying the skylines. Thus, a novel skyline algorithm, DInSkyline, is proposed in this study which finds the most relevant data items in dynamic and incomplete databases. Several experiments have been conducted and the results show that DInSkyline outperforms the previous works by reducing the number of pairwise comparisons in the range of 52% to 73%. |
|---|