A model for computing skyline data items in cloud incomplete databases
Skyline queries intend to retrieve the most superior data items in the database that best fit with the user’s given preference. However, processing skyline queries are expensive and uneasy when applying on large distributed databases such as cloud databases. Moreover, it would be further sophistica...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 言語: | English English English |
| 出版事項: |
Elsevier B.V.
2020
|
| 主題: | |
| オンライン･アクセス: | http://irep.iium.edu.my/80768/1/80768_A%20Model%20for%20Computing%20Skyline.pdf http://irep.iium.edu.my/80768/2/80768_A%20Model%20for%20Computing%20Skyline_SCOPUS.pdf http://irep.iium.edu.my/80768/13/80768_A%20model%20for%20computing_Wos.pdf http://irep.iium.edu.my/80768/ https://www.sciencedirect.com/science/article/pii/S187705092030466X https://doi.org/10.1016/j.procs.2020.03.037 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | Skyline queries intend to retrieve the most superior data items in the database that best fit with the user’s given preference.
However, processing skyline queries are expensive and uneasy when applying on large distributed databases such as cloud databases. Moreover, it would be further sophisticated to process skyline queries if these distributed databases have missing values in certain dimensions. The effect of data incompleteness on skyline process is extremely severe because missing values result in un-hold the transitivity property of skyline technique and leads to the problem of cyclic dominance. This paper proposes an efficient model for computing skyline data items in cloud incomplete databases. The model focuses on processing skyline queries in cloud incomplete databases aiming at reducing the domination tests between data items, the processing time, and the amount of data transfer among the involved datacenters. Various set of experiments are conducted over two different types of datasets and the result demonstrates that the proposed solution outperforms the previous approaches in terms of domination tests, processing time, and amount of data transferred. |
|---|