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

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

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

A new search-strategy is proposed termed Diameter Candidate Check (DCC), and it is shown that DCC can efficiently find a better set of grid-cells at an ...

In this paper, we propose a novel mechanism using hierarchical grid architectures for service discovery in MANET. The geographic area of MANET is partitioned ...

A new algorithm for m-closest keywords query over spatial Web with grid partitioning. Y. Qiu, T. Ohmori, T. Shintani, and H. Fujita. SNPD, page 507-514.

Generally, top-down search techniques using tree-style data structures are appropriate for finding optimal results of queries over spatial datasets. Thus in ...

This thesis addresses the problem of m-closest keywords queries (mCK queries) over spatial web objects that contain descriptive texts and spatial ...

Mar 29, 2022 · Spatial keyword search is a popular retrieval task in such collections, where objects are reported by their distance to the query location and ...

In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both on-demand access and periodic broad- cast modes of ...