|
|
|
|
|
Liping Zhang, Xiaojing Zhang and Song Li
In view of the existing research in the field of k-nearest neighbor query in the road network, the incompleteness of the query user?s preference for data objects and the privacy protection of the query results are not considered, this paper proposes a mu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Youngki Park and Youhyun Shin
This paper presents a novel approach for finding the most semantically similar conversational sentences in Korean and English. Our method involves training separate embedding models for each language and using a hybrid algorithm that selects the appropri...
ver más
|
|
|
|
|
|
|
|
|
|
|
Karima Khettabi, Zineddine Kouahla, Brahim Farou, Hamid Seridi and Mohamed Amine Ferrag
Internet of Things (IoT) systems include many smart devices that continuously generate massive spatio-temporal data, which can be difficult to process. These continuous data streams need to be stored smartly so that query searches are efficient. In this ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hyung-Ju Cho
This paper considers k-farthest neighbor (kFN) join queries in spatial networks where the distance between two points is the length of the shortest path connecting them. Given a positive integer k, a set of query points Q, and a set of data points P, the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Imene Bareche and Ying Xia
The magnitude of highly dynamic spatial data is expanding rapidly due to the instantaneous evolution of mobile technology, resulting in challenges for continuous queries. We propose a novel indexing approach model, namely, the Velocity SpatioTemporal ind...
ver más
|
|
|
|
|
|
|
|
|
|
|
Panagiotis Moutafis, George Mavrommatis, Michael Vassilakopoulos and Antonio Corral
Aiming at the problem of spatial query processing in distributed computing systems, the design and implementation of new distributed spatial query algorithms is a current challenge. Apache Spark is a memory-based framework suitable for real-time and batc...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shengnan Guo and Jianqiu Xu
Predicting query cost plays an important role in moving object databases. Accurate predictions help database administrators effectively schedule workloads and achieve optimal resource allocation strategies. There are some works focusing on query cost pre...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rong Yang and Baoning Niu
Continuous k nearest neighbor queries over spatial?textual data streams (abbreviated as CkQST) are the core operations of numerous location-based publish/subscribe systems. Such a system is usually subscribed with millions of CkQST and evaluated simultan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yeong-Cherng Hsu, Chih-Hsin Hsueh and Ja-Ling Wu
With the growing popularity of cloud computing, it is convenient for data owners to outsource their data to a cloud server. By utilizing the massive storage and computational resources in cloud, data owners can also provide a platform for users to make q...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tianyang Dong, Lulu Yuan, Yuehui Shang, Yang Ye and Ling Zhang
Continuous K-nearest neighbor (CKNN) queries on moving objects retrieve the K-nearest neighbors of all points along a query trajectory. They mainly deal with the moving objects that are nearest to the moving user within a specified period of time. The ex...
ver más
|
|
|
|
|
|