A new algorithm for m-closest keywords query over spatial Web with grid partitioning

In this paper, we focus on the issue of the m-closest keywords (mCK) query over spatial data in the Web. The mCK query is a problem to find the optimal set of records in the sense that they are the spatially-closest records that satisfy m user-given keywords. The mCK query was proposed by Zhang et a...

Full description

Saved in:

Bibliographic Details
Published in:	2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) pp. 1 - 8
Main Authors:	Yuan Qiu, Ohmori, Tadashi, Shintani, Takahiko, Fujita, Hideyuki
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2015
Subjects:	Google Itemsets Nickel Partitioning algorithms Search problems Spatial databases Twitter
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!