ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 An Efficient Architecture for Parallel Skyline Computation over Large Distributed Datasets
Cited 2 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
He Li, 장수민, 유재수
발행일
201407
출처
Journal of Internet Technology, v.15 no.4, pp.577-588
ISSN
1607-9264
출판사
Taiwan Academic Network Management Committee
DOI
https://dx.doi.org/10.6138/JIT.2014.15.4.08
협약과제
14MS9100, (통합)고집적 저전력 프로세서 기반 30% 이상 에너지절감 범용 운영 체제 및 가상화 핵심 기술 개발, 전성익
초록
The skyline query has been received much attention as an important operator in database systems for multi-preference analysis and decision making. Most of the previous works have focused on processing skyline queries on centralized data sets. However, the related data in real applications are practically scattered at several different servers. The skyline query computation in distributed environments is needed to gather a large number of data from the connected servers. The existing methods for a skyline query in distributed environments have two problems: (i) They have slow processing time for a skyline query. (ii) Most of the transferred data among servers in the network are unnecessary. In this paper, we propose a multi-layer grid method for efficiently processing a skyline query in distributed environments. The proposed method minimizes the unnecessary transferred data by using the grid mechanism. Experiments based on synthetic data sets and real data sets show that our proposed method outperforms the existing methods.
KSP 제안 키워드
Database systems, Distributed Environment, Grid method, Preference analysis, Real data, Skyline computation, Skyline query, Synthetic Datasets, decision making, efficient architecture, multi-layer