Performance evaluation of preference queries techniques over a high multidimensional database

In recent years, there has been much focus on the design and development of database management systems that incorporate and provide more flexible query operators that return data items which are dominating other data items in all attributes (dimensions). This type of query operations is named prefe...

Full description

Bibliographic Details
Main Authors:	Alwan, Ali Amer, Ibrahim, Hamidah, Tan, Chik Yip, Sidi, Fatimah, Udzir, NurIzura, Mohd Saad, Nurul Husna
Format:	Article
Language:	English
Published:	Digital Information Research Foundation 2011
Subjects:	T Technology (General)
Online Access:	http://irep.iium.edu.my/36670/ http://irep.iium.edu.my/36670/ http://irep.iium.edu.my/36670/1/Performance_Evaluation_of_Preference_Queries_over_a_High_Multidimenstional_Database.pdf

id	iium-36670
recordtype	eprints
spelling	iium-366702017-06-13T03:31:11Z http://irep.iium.edu.my/36670/ Performance evaluation of preference queries techniques over a high multidimensional database Alwan, Ali Amer Ibrahim, Hamidah Tan, Chik Yip Sidi, Fatimah Udzir, NurIzura Mohd Saad, Nurul Husna T Technology (General) In recent years, there has been much focus on the design and development of database management systems that incorporate and provide more flexible query operators that return data items which are dominating other data items in all attributes (dimensions). This type of query operations is named preference queries as they prefer one data item over the other data item if and only if it is better in all dimensions and not worse in at least one dimension. Several preference evaluation techniques for preference queries have been proposed including top-k, skyline, top-k dominating, k-dominance, and k-frequency. All of these preference evaluation techniques aimed at finding the “best” answer that meet the user preferences. This paper evaluates these five preference evaluation techniques on real application when huge number of dimensions is the main concern. To achieve this, a recipe searching application with maximum number of 60 dimensions has been developed which assists users to identify the most desired recipes that meet their preferences. Two analyses have been conducted, where execution time is the measurement used Digital Information Research Foundation 2011-03-01 Article PeerReviewed application/pdf en http://irep.iium.edu.my/36670/1/Performance_Evaluation_of_Preference_Queries_over_a_High_Multidimenstional_Database.pdf Alwan, Ali Amer and Ibrahim, Hamidah and Tan, Chik Yip and Sidi, Fatimah and Udzir, NurIzura and Mohd Saad, Nurul Husna (2011) Performance evaluation of preference queries techniques over a high multidimensional database. International Journal of Computational Linguistics Research, 2 (1). pp. 37-47. ISSN 0976-416X E-ISSN 0976-4178 http://www.dline.info/jcl/index.php
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	T Technology (General)
spellingShingle	T Technology (General) Alwan, Ali Amer Ibrahim, Hamidah Tan, Chik Yip Sidi, Fatimah Udzir, NurIzura Mohd Saad, Nurul Husna Performance evaluation of preference queries techniques over a high multidimensional database
description	In recent years, there has been much focus on the design and development of database management systems that incorporate and provide more flexible query operators that return data items which are dominating other data items in all attributes (dimensions). This type of query operations is named preference queries as they prefer one data item over the other data item if and only if it is better in all dimensions and not worse in at least one dimension. Several preference evaluation techniques for preference queries have been proposed including top-k, skyline, top-k dominating, k-dominance, and k-frequency. All of these preference evaluation techniques aimed at finding the “best” answer that meet the user preferences. This paper evaluates these five preference evaluation techniques on real application when huge number of dimensions is the main concern. To achieve this, a recipe searching application with maximum number of 60 dimensions has been developed which assists users to identify the most desired recipes that meet their preferences. Two analyses have been conducted, where execution time is the measurement used
format	Article
author	Alwan, Ali Amer Ibrahim, Hamidah Tan, Chik Yip Sidi, Fatimah Udzir, NurIzura Mohd Saad, Nurul Husna
author_facet	Alwan, Ali Amer Ibrahim, Hamidah Tan, Chik Yip Sidi, Fatimah Udzir, NurIzura Mohd Saad, Nurul Husna
author_sort	Alwan, Ali Amer
title	Performance evaluation of preference queries techniques over a high multidimensional database
title_short	Performance evaluation of preference queries techniques over a high multidimensional database
title_full	Performance evaluation of preference queries techniques over a high multidimensional database
title_fullStr	Performance evaluation of preference queries techniques over a high multidimensional database
title_full_unstemmed	Performance evaluation of preference queries techniques over a high multidimensional database
title_sort	performance evaluation of preference queries techniques over a high multidimensional database
publisher	Digital Information Research Foundation
publishDate	2011
url	http://irep.iium.edu.my/36670/ http://irep.iium.edu.my/36670/ http://irep.iium.edu.my/36670/1/Performance_Evaluation_of_Preference_Queries_over_a_High_Multidimenstional_Database.pdf
first_indexed	2023-09-18T20:52:32Z
last_indexed	2023-09-18T20:52:32Z
_version_	1777410090365616128

Performance evaluation of preference queries techniques over a high multidimensional database

Similar Items