Pairwise Expansion:A New Topdown Search for mCK Queries Problem over Spatial Web
This paper focuses on the problem of m-Closest Keywords (mCK) queries over spatial web objects.An mCK query is to find the optimal set of objects (object-set) in the sense that they are the spatiallyclosest records and satisfy m user-given keywords.We propose a new approach called Pairwise Expansion to find an exact solution of mCK queries based on topdown search of an on-the-fly quad-tree.This approach first enumerates object-pairs in a topdown way,then picks up eachcloserobject-pair and expands it into candidate object-sets.Experimental results show that this approach is more efficient than existing topdown search strategies and applicable for real spatial web data.
Spatial web data Spatial keyword query
Yuan Qiu Tadashi Ohmori Takahiko Shintani Hideyuki Fujita
Graduate School of Information Systems,The University of Electro-Communications,1-5-1 Chofugaoka,Chofu,Tokyo 182-8585,Japan
国际会议
International Asia-Pacific Web Conference(第18届国际亚太互联网大会)
苏州
英文
459-463
2016-09-23(万方平台首次上网日期,不代表论文的发表时间)