Efficient computation of skyline queries over a dynamic and incomplete database

Skyline queries rely on the notion of Pareto dominance, �lter the data items by keeping only those data items that are the best, most preferred, also known as skylines, from a database to meet the user's preferences. Skyline query has been studied extensively and a significant number of skyline...

Full description

Bibliographic Details
Main Authors: Babanejad, Ghazaleh, Ibrahim, Hamidah, Sidi, Fatimah, Udzir, Nur Izura, Aljuboori, Ali A.Alwan, Gulzar, Yonis
Format: Article
Language:English
Published: IEEE 2020
Subjects:
Online Access:http://irep.iium.edu.my/82126/
http://irep.iium.edu.my/82126/1/82126_Efficient%20Computation%20of%20Skyline%20Queries.pdf
_version_ 1848789241914458112
author Babanejad, Ghazaleh
Ibrahim, Hamidah
Sidi, Fatimah
Udzir, Nur Izura
Aljuboori, Ali A.Alwan
Gulzar, Yonis
author_facet Babanejad, Ghazaleh
Ibrahim, Hamidah
Sidi, Fatimah
Udzir, Nur Izura
Aljuboori, Ali A.Alwan
Gulzar, Yonis
author_sort Babanejad, Ghazaleh
building IIUM Repository
collection Online Access
description Skyline queries rely on the notion of Pareto dominance, �lter the data items by keeping only those data items that are the best, most preferred, also known as skylines, from a database to meet the user's preferences. Skyline query has been studied extensively and a significant number of skyline algorithms have been proposed, mostly attempt to resolve the optimisation problem that is mainly associated with a reduction in the processing time of skyline computations. In today's era, the presence of incomplete data in a database is inevitable. Furthermore, databases are dynamic in nature in which their states change throughout the time to reflect the current and latest information of the applications. The skylines derived before changes are made towards the initial database are no longer valid in the new state of the database. Blindly examining the entire database to identify the new set of skylines is unwise as not all data items are affected by the changes made towards the database. Hence, in this paper we propose a solution, named DyIn-Skyline, which is capable of deriving skylines over a dynamic and incomplete database, by exploiting only those data items that are affected by the changes. Several experiments have been conducted and the results show that our proposed solution outperforms the previous works with regard to the number of pairwise comparisons and processing time.
first_indexed 2025-11-14T17:53:36Z
format Article
id iium-82126
institution International Islamic University Malaysia
institution_category Local University
language English
last_indexed 2025-11-14T17:53:36Z
publishDate 2020
publisher IEEE
recordtype eprints
repository_type Digital Repository
spelling iium-821262020-08-12T08:27:27Z http://irep.iium.edu.my/82126/ Efficient computation of skyline queries over a dynamic and incomplete database Babanejad, Ghazaleh Ibrahim, Hamidah Sidi, Fatimah Udzir, Nur Izura Aljuboori, Ali A.Alwan Gulzar, Yonis QA75 Electronic computers. Computer science QA76 Computer software Skyline queries rely on the notion of Pareto dominance, �lter the data items by keeping only those data items that are the best, most preferred, also known as skylines, from a database to meet the user's preferences. Skyline query has been studied extensively and a significant number of skyline algorithms have been proposed, mostly attempt to resolve the optimisation problem that is mainly associated with a reduction in the processing time of skyline computations. In today's era, the presence of incomplete data in a database is inevitable. Furthermore, databases are dynamic in nature in which their states change throughout the time to reflect the current and latest information of the applications. The skylines derived before changes are made towards the initial database are no longer valid in the new state of the database. Blindly examining the entire database to identify the new set of skylines is unwise as not all data items are affected by the changes made towards the database. Hence, in this paper we propose a solution, named DyIn-Skyline, which is capable of deriving skylines over a dynamic and incomplete database, by exploiting only those data items that are affected by the changes. Several experiments have been conducted and the results show that our proposed solution outperforms the previous works with regard to the number of pairwise comparisons and processing time. IEEE 2020-08-13 Article PeerReviewed application/pdf en http://irep.iium.edu.my/82126/1/82126_Efficient%20Computation%20of%20Skyline%20Queries.pdf Babanejad, Ghazaleh and Ibrahim, Hamidah and Sidi, Fatimah and Udzir, Nur Izura and Aljuboori, Ali A.Alwan and Gulzar, Yonis (2020) Efficient computation of skyline queries over a dynamic and incomplete database. IEEE Access Journal, 8. pp. 141523-141546. ISSN 2169-3536 E-ISSN 2169-3536 https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9146842 10.1109/ACCESS.2020.3011652
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Babanejad, Ghazaleh
Ibrahim, Hamidah
Sidi, Fatimah
Udzir, Nur Izura
Aljuboori, Ali A.Alwan
Gulzar, Yonis
Efficient computation of skyline queries over a dynamic and incomplete database
title Efficient computation of skyline queries over a dynamic and incomplete database
title_full Efficient computation of skyline queries over a dynamic and incomplete database
title_fullStr Efficient computation of skyline queries over a dynamic and incomplete database
title_full_unstemmed Efficient computation of skyline queries over a dynamic and incomplete database
title_short Efficient computation of skyline queries over a dynamic and incomplete database
title_sort efficient computation of skyline queries over a dynamic and incomplete database
topic QA75 Electronic computers. Computer science
QA76 Computer software
url http://irep.iium.edu.my/82126/
http://irep.iium.edu.my/82126/
http://irep.iium.edu.my/82126/
http://irep.iium.edu.my/82126/1/82126_Efficient%20Computation%20of%20Skyline%20Queries.pdf