Efficient skyline processing algorithm over dynamic and incomplete database

The notion of skyline processing is to discover the data items that are not dominated by any other data items. It is a well-known technique that is utilised to determine the best results that meet the user’s preferences. However, the rapid growth and frequent changes of data make the process of ide...

Full description

Bibliographic Details
Main Authors: Babanejad, Ghazaleh, Ibrahim, Hamidah, Udzir, Nur Izura, Sidi, Fatimah, Alwan, Ali Amer
Format: Conference or Workshop Item
Language:English
English
Published: ACM 2018
Subjects:
Online Access:http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/7/69868_Efficient%20skyline%20processing%20algorithm_complete.pdf
http://irep.iium.edu.my/69868/8/69868_Efficient%20skyline%20processing%20algorithm_scopus.pdf
id iium-69868
recordtype eprints
spelling iium-698682019-06-21T01:58:49Z http://irep.iium.edu.my/69868/ Efficient skyline processing algorithm over dynamic and incomplete database Babanejad, Ghazaleh Ibrahim, Hamidah Udzir, Nur Izura Sidi, Fatimah Alwan, Ali Amer QA75 Electronic computers. Computer science QA76 Computer software The notion of skyline processing is to discover the data items that are not dominated by any other data items. It is a well-known technique that is utilised to determine the best results that meet the user’s preferences. However, the rapid growth and frequent changes of data make the process of identifying skyline points no longer a trivial task. Most of the existing skyline approaches assume that the database is complete and static. However, in real world scenario, this assumption is not valid especially in multidimensional databases in which some dimensions have missing values while they are dynamic due to the continual modifications made towards them. Blindly examining the whole database after changes are made to identify the skyline points is inappropriate as not all data items are affected by the changes. Hence, in this study we propose a skyline algorithm, DyIn-Skyline, which is capable of identifying skyline points over dynamic and incomplete databases, by exploiting only those data items that are affected by the changes. Several experiments have been conducted and the results show that our proposed algorithm outperforms the previous work by reducing the number of pairwise comparisons in the range of 50% to 73%. ACM 2018-11-19 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/69868/7/69868_Efficient%20skyline%20processing%20algorithm_complete.pdf application/pdf en http://irep.iium.edu.my/69868/8/69868_Efficient%20skyline%20processing%20algorithm_scopus.pdf Babanejad, Ghazaleh and Ibrahim, Hamidah and Udzir, Nur Izura and Sidi, Fatimah and Alwan, Ali Amer (2018) Efficient skyline processing algorithm over dynamic and incomplete database. In: 20th International Conference on Information Integration and Web-based Applications & Services (iiWAS2018), 19-21-11-2018, Yogyakarta, Indonesia. https://dl.acm.org/citation.cfm?id=3282395 10.1145/3282373.3282395
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
English
topic QA75 Electronic computers. Computer science
QA76 Computer software
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Babanejad, Ghazaleh
Ibrahim, Hamidah
Udzir, Nur Izura
Sidi, Fatimah
Alwan, Ali Amer
Efficient skyline processing algorithm over dynamic and incomplete database
description The notion of skyline processing is to discover the data items that are not dominated by any other data items. It is a well-known technique that is utilised to determine the best results that meet the user’s preferences. However, the rapid growth and frequent changes of data make the process of identifying skyline points no longer a trivial task. Most of the existing skyline approaches assume that the database is complete and static. However, in real world scenario, this assumption is not valid especially in multidimensional databases in which some dimensions have missing values while they are dynamic due to the continual modifications made towards them. Blindly examining the whole database after changes are made to identify the skyline points is inappropriate as not all data items are affected by the changes. Hence, in this study we propose a skyline algorithm, DyIn-Skyline, which is capable of identifying skyline points over dynamic and incomplete databases, by exploiting only those data items that are affected by the changes. Several experiments have been conducted and the results show that our proposed algorithm outperforms the previous work by reducing the number of pairwise comparisons in the range of 50% to 73%.
format Conference or Workshop Item
author Babanejad, Ghazaleh
Ibrahim, Hamidah
Udzir, Nur Izura
Sidi, Fatimah
Alwan, Ali Amer
author_facet Babanejad, Ghazaleh
Ibrahim, Hamidah
Udzir, Nur Izura
Sidi, Fatimah
Alwan, Ali Amer
author_sort Babanejad, Ghazaleh
title Efficient skyline processing algorithm over dynamic and incomplete database
title_short Efficient skyline processing algorithm over dynamic and incomplete database
title_full Efficient skyline processing algorithm over dynamic and incomplete database
title_fullStr Efficient skyline processing algorithm over dynamic and incomplete database
title_full_unstemmed Efficient skyline processing algorithm over dynamic and incomplete database
title_sort efficient skyline processing algorithm over dynamic and incomplete database
publisher ACM
publishDate 2018
url http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/
http://irep.iium.edu.my/69868/7/69868_Efficient%20skyline%20processing%20algorithm_complete.pdf
http://irep.iium.edu.my/69868/8/69868_Efficient%20skyline%20processing%20algorithm_scopus.pdf
first_indexed 2023-09-18T21:39:11Z
last_indexed 2023-09-18T21:39:11Z
_version_ 1777413025171505152