The aim of this paper is to address processing continuous top-k spatial keyword queries （CkSKQ） over road networks. Firstly, an efficient data structure consisting of a PMR-Quad tree and three in-memory tables was proposed to keep and index the information of road network structure, the positions and keywords of data objects. Since the spatial keyword query has both considered the road network distance and the keyword similarity of the query point and objects being searched, an adjusta- ble synthetic distance calculation formula was presented...
