Processing skyline queries in incomplete distributed databases
Due to its great benefits over many database applications, skyline queries have received formidable concern in the last decades. Skyline queries attempt to assist users by identifying the set of data items which represents the best results that meet the conditions of a given query. Most of the ex...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English English |
Published: |
Springer
2016
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/51351/1/Processing_skyline_queries_in_incomplete_distributed_databases.pdf http://irep.iium.edu.my/51351/4/51351-Processing_skyline_queries_in_incomplete_distributed_databases_SCOPUS.pdf http://irep.iium.edu.my/51351/ http://link.springer.com/article/10.1007/s10844-016-0419-2 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Islam Antarabangsa Malaysia |
Language: | English English |
Summary: | Due to its great benefits over many database applications, skyline queries have
received formidable concern in the last decades. Skyline queries attempt to assist users
by identifying the set of data items which represents the best results that meet the conditions
of a given query. Most of the existing skyline techniques concentrate on identifying
skylines over a single relation. However, in distributed databases, the process of skyline
queries required accessing multiple relations which might be located at different sites. Consequently,
data items from these multiple relations need to be joined and thus transferring
these data items from one site to another is unavoidable. Moreover, the previous techniques
also assume that the values of dimensions for every data item are presented (complete)
which is not always true as some values may be missing. In this paper, we proposed an
approach for processing skyline queries in incomplete distributed databases. The approach
derives skylines from multiple relations where dominated data items are removed before
joining the relations to reduce the processing time and the network cost. The experimental
results illustrate that our proposed approach outperforms the previous approaches in terms
of processing time and network cost. |
---|