Efficient Top-k Query Processing Algorithm Using Grid Index-based View Selection Method
Seungtae Hong, Deulnyeok Youn, Jae Woo Chang · 정보과학회 컴퓨팅의 실제 논문지 · 2015
Research on top-k query processing algorithms for analyzing big data have been spotlighted recently. However, because existing top-k query processing algorithms do not provide an efficient index structure, they incur high query processing costs and cannot support various types of queries. To solve these problems, we propose a top-k query processing algorithm using a view selection method based on a grid index. The proposed algorithm reduces the query processing time by retrieving the minimum number of grid cells for the query range, by using a grid index-based view selection method. Finally, we show from our performance analysis that the proposed scheme outperforms an existing scheme, in terms of both query processing time and query result accuracy.