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...

Full description

Bibliographic Details
Main Authors:	Babanejad, Ghazaleh, Ibrahim, Hamidah, Udzir, Nur Izura, Sidi, Fatimah, Aljuboori, Ali A.Alwan
Format:	Conference or Workshop Item
Language:	English English
Published:	Universiti Utara Malaysia(UUM) 2017
Subjects:	QA75 Electronic computers. Computer science QA76 Computer software
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

id	iium-57268
recordtype	eprints
spelling	iium-572682019-08-17T08:49:08Z http://irep.iium.edu.my/57268/ Deriving skyline points over dynamic and incomplete databases Babanejad, Ghazaleh Ibrahim, Hamidah Udzir, Nur Izura Sidi, Fatimah Aljuboori, Ali A.Alwan QA75 Electronic computers. Computer science QA76 Computer software 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%. Universiti Utara Malaysia(UUM) 2017-04-25 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/57268/1/54268_Deriving%20skyline%20points.pdf application/pdf en http://irep.iium.edu.my/57268/7/57268%20Deriving%20skyline%20points%20over%20dynamic%20and%20incomplete%20databases%20WOS.pdf Babanejad, Ghazaleh and Ibrahim, Hamidah and Udzir, Nur Izura and Sidi, Fatimah and Aljuboori, Ali A.Alwan (2017) Deriving skyline points over dynamic and incomplete databases. In: The 6th International Conference on Computing and Informatics, ICOCI 2017, 25th-27th April 2017, Kuala Lumpur. http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap02e/PID45-77-83e.pdf
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 Aljuboori, Ali A.Alwan Deriving skyline points over dynamic and incomplete databases
description	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%.
format	Conference or Workshop Item
author	Babanejad, Ghazaleh Ibrahim, Hamidah Udzir, Nur Izura Sidi, Fatimah Aljuboori, Ali A.Alwan
author_facet	Babanejad, Ghazaleh Ibrahim, Hamidah Udzir, Nur Izura Sidi, Fatimah Aljuboori, Ali A.Alwan
author_sort	Babanejad, Ghazaleh
title	Deriving skyline points over dynamic and incomplete databases
title_short	Deriving skyline points over dynamic and incomplete databases
title_full	Deriving skyline points over dynamic and incomplete databases
title_fullStr	Deriving skyline points over dynamic and incomplete databases
title_full_unstemmed	Deriving skyline points over dynamic and incomplete databases
title_sort	deriving skyline points over dynamic and incomplete databases
publisher	Universiti Utara Malaysia(UUM)
publishDate	2017
url	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
first_indexed	2023-09-18T21:20:55Z
last_indexed	2023-09-18T21:20:55Z
_version_	1777411876062232576

Deriving skyline points over dynamic and incomplete databases

Similar Items