• Title/Summary/Keyword: continuous Top-k query

Search Result 1, Processing Time 0.015 seconds

An Efficient Algorithm for Monitoring Continuous Top-k Queries (연속 Top-k 질의 모니터링을 위한 효율적인 알고리즘)

  • Jang, JaeHee;Jung, HaRim;Kim, YougHee;Kim, Ung-Mo
    • Journal of KIISE
    • /
    • v.43 no.5
    • /
    • pp.590-595
    • /
    • 2016
  • In this study, we propose an efficient method for monitoring continuous top-k queries. In contrast to the conventional top-k queries, the presented top-k query considers both spatial and non-spatial attributes. We proposed a novel main-memory based grid access method, called Bit-Vector Grid Index (BVGI). The proposed method quickly identifies whether the moving objects are included in some of the grid cell by encoding a non-spatial attribute value of the moving object to bit-vector. Experimental simulations demonstrate that the proposed method is several times faster than the previous method and uses considerably less memory.