The Conceptual Framework of Knowledge of Large Scale and Incomplete Graphs of Skyline Queries Optimization Using Machine Learning

Ever since its introduction into the database community, skyline queries have been widely adopted in a range of contemporary database applications. Skyline technique relies on the concept of Pareto-optimal in which a data item from the set of dataset <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{D}$</tex> is identified as skyline if and only if it is not worse than other data items in all dimensions (attributes) and strictly better in at least one dimension. Most of the previous skyline solutions have been designed for conventional databases for complete, incomplete, and uncertain data. However, not much attention has been paid to issues related to skyline query processing over knowledge of large-scale incomplete graph databases. Most recently, graphs have become prevalent data structures to model complex information networks for various real-life contemporary applications such as social networks, knowledge bases, pattern recognition, and the World Wide Web. It is also important to note that, generally graphs are big structures with very big data and this change often due to updates. These continuous updates makes the graph to be highly dynamic, where nodes/edges are added to or removed from the graph always. However, the issue of data incompleteness when processing skyline queries in large-scale graph databases has not been considered by previous works. The research aims at proposing a new model for processing skyline queries in an incomplete graph database. The research methodology includes reviewing the related literature of skyline queries in incomplete graph databases. Then, propose an method for handling skyline queries within an incomplete graph database followed by designing and implementing a model to evaluate the efficiency and effectiveness of the proposed approaches. The preliminary results using the K means Clustering Algorithm showed that the conceptual framework successfully grouped similar data points, facilitating the identification of skyline points. The implemented algorithm to perform such operation was far more efficient, faster and accurate as compared to conventional methods. This research will ultimately benefit a wide range of applications involving decision-making, decision support, social network, and recommendations aspects by developing a tool that incorporates the proposed approaches.

Authors

Institutions

Publication Details

Published
2024-11-20
DOI
https://doi.org/10.1109/icetas62372.2024.11119942
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Conceptual Framework of Knowledge of Large Scale and Incomplete Graphs of Skyline Queries Optimization Using Machine Learning

Dini Handayani, Raini Hassan, Ubair Noor
Data Management and Algorithms
article

The Conceptual Framework of Knowledge of Large Scale and Incomplete Graphs of Skyline Queries Optimization Using Machine Learning

Dini Handayani, Raini Hassan, Ubair Noor
article en

Abstract

Ever since its introduction into the database community, skyline queries have been widely adopted in a range of contemporary database applications. Skyline technique relies on the concept of Pareto-optimal in which a data item from the set of dataset <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{D}$</tex> is identified as skyline if and only if it is not worse than other data items in all dimensions (attributes) and strictly better in at least one dimension. Most of the previous skyline solutions have been designed for conventional databases for complete, incomplete, and uncertain data. However, not much attention has been paid to issues related to skyline query processing over knowledge of large-scale incomplete graph databases. Most recently, graphs have become prevalent data structures to model complex information networks for various real-life contemporary applications such as social networks, knowledge bases, pattern recognition, and the World Wide Web. It is also important to note that, generally graphs are big structures with very big data and this change often due to updates. These continuous updates makes the graph to be highly dynamic, where nodes/edges are added to or removed from the graph always. However, the issue of data incompleteness when processing skyline queries in large-scale graph databases has not been considered by previous works. The research aims at proposing a new model for processing skyline queries in an incomplete graph database. The research methodology includes reviewing the related literature of skyline queries in incomplete graph databases. Then, propose an method for handling skyline queries within an incomplete graph database followed by designing and implementing a model to evaluate the efficiency and effectiveness of the proposed approaches. The preliminary results using the K means Clustering Algorithm showed that the conceptual framework successfully grouped similar data points, facilitating the identification of skyline points. The implemented algorithm to perform such operation was far more efficient, faster and accurate as compared to conventional methods. This research will ultimately benefit a wide range of applications involving decision-making, decision support, social network, and recommendations aspects by developing a tool that incorporates the proposed approaches.

International Islamic University Malaysia (MY)
Openalex Percentile: Top 66%
Data Management and Algorithms
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.