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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) S. 1 - 8
Hauptverfasser:	Yuan Qiu, Ohmori, Tadashi, Shintani, Takahiko, Fujita, Hideyuki
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2015
Schlagworte:	Google Itemsets Nickel Partitioning algorithms Search problems Spatial databases Twitter
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!