CSQUiD: an index and non-probability framework for constrained skyline query processing over uncertain data

Uncertainty of data, the degree to which data are inaccurate, imprecise, untrusted, and undetermined, is inherent in many contemporary database applications, and numerous research endeavours have been devoted to efficiently answer skyline queries over uncertain data. The literature discussed two different methods that could be used to handle the data uncertainty in which objects having continuous range values. The first method employs a probability-based approach, while the second assumes that the uncertain values are represented by their median values. Nevertheless, neither of these methods seem to be suitable for the modern high-dimensional uncertain databases due to the following reasons. The first method requires an intensive probability calculations while the second is impractical. Therefore, this work introduces an index, non-probability framework named Constrained Skyline Query processing on Uncertain Data (<i>CSQUiD</i>) aiming at reducing the computational time in processing constrained skyline queries over uncertain high-dimensional data. Given a collection of objects with uncertain data, the <i>CSQUiD</i> framework constructs the minimum bounding rectangles (<i>MBRs</i>) by employing the <i>X</i>-tree indexing structure. Instead of scanning the whole collection of objects, only objects within the dominant <i>MBRs</i> are analyzed in determining the final skylines. In addition, <i>CSQUiD</i> makes use of the <i>Fuzzification</i> approach where the exact value of each continuous range value of those dominant <i>MBRs</i>' objects is identified. The proposed <i>CSQUiD</i> framework is validated using real and synthetic data sets through extensive experimentations. Based on the performance analysis conducted, by varying the sizes of the constrained query, the <i>CSQUiD</i> framework outperformed the most recent methods (<i>CIS</i> algorithm and <i>SkyQUD-T</i> framework) with an average improvement of 44.07% and 57.15% with regards to the number of pairwise comparisons, while the average improvement of CPU processing time over <i>CIS</i> and <i>SkyQUD-T</i> stood at 27.17% and 18.62%, respectively.

Authors

Institutions

Publication Details

Journal
PeerJ Computer Science
Published
2024-09-16
DOI
https://doi.org/10.7717/peerj-cs.2225
Citations
2
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CSQUiD: an index and non-probability framework for constrained skyline query processing over uncertain data

Hamidah Ibrahim, Nor Fazlida Mohd Sani, Ali A. Alwan, Ma’aruf Mohammed Lawal et al.
2 citations
PeerJ Computer Science
Data Management and Algorithms
0.70
article

CSQUiD: an index and non-probability framework for constrained skyline query processing over uncertain data

Hamidah Ibrahim, Nor Fazlida Mohd Sani, Ali A. Alwan, Ma’aruf Mohammed Lawal, Razali Yaakob
article en
2 citations

Abstract

Uncertainty of data, the degree to which data are inaccurate, imprecise, untrusted, and undetermined, is inherent in many contemporary database applications, and numerous research endeavours have been devoted to efficiently answer skyline queries over uncertain data. The literature discussed two different methods that could be used to handle the data uncertainty in which objects having continuous range values. The first method employs a probability-based approach, while the second assumes that the uncertain values are represented by their median values. Nevertheless, neither of these methods seem to be suitable for the modern high-dimensional uncertain databases due to the following reasons. The first method requires an intensive probability calculations while the second is impractical. Therefore, this work introduces an index, non-probability framework named Constrained Skyline Query processing on Uncertain Data (<i>CSQUiD</i>) aiming at reducing the computational time in processing constrained skyline queries over uncertain high-dimensional data. Given a collection of objects with uncertain data, the <i>CSQUiD</i> framework constructs the minimum bounding rectangles (<i>MBRs</i>) by employing the <i>X</i>-tree indexing structure. Instead of scanning the whole collection of objects, only objects within the dominant <i>MBRs</i> are analyzed in determining the final skylines. In addition, <i>CSQUiD</i> makes use of the <i>Fuzzification</i> approach where the exact value of each continuous range value of those dominant <i>MBRs</i>' objects is identified. The proposed <i>CSQUiD</i> framework is validated using real and synthetic data sets through extensive experimentations. Based on the performance analysis conducted, by varying the sizes of the constrained query, the <i>CSQUiD</i> framework outperformed the most recent methods (<i>CIS</i> algorithm and <i>SkyQUD-T</i> framework) with an average improvement of 44.07% and 57.15% with regards to the number of pairwise comparisons, while the average improvement of CPU processing time over <i>CIS</i> and <i>SkyQUD-T</i> stood at 27.17% and 18.62%, respectively.

PeerJ Computer ScienceVol. 10
Ahmadu Bello University (NG), Universiti Putra Malaysia (MY), Ramapo College (US), The College of New Jersey (US)
Universiti Putra Malaysia
Openalex Percentile: Top 31%
Data Management and Algorithms
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.