首页> 外国专利> k- k- PROCESSING METHOD OF K-NEAREST NEIGHBOR JOIN QUERIES IN ROAD NETWORKS AND DEVICE THAT PROCESSES K-NEAREST NEIGHBOR JOIN QUERIES IN ROAD NETWORKS

k- k- PROCESSING METHOD OF K-NEAREST NEIGHBOR JOIN QUERIES IN ROAD NETWORKS AND DEVICE THAT PROCESSES K-NEAREST NEIGHBOR JOIN QUERIES IN ROAD NETWORKS

机译:k- k-道路网络中K-近邻邻居连接查询的处理方法以及处理道路网络中K-近邻邻居查询的设备

摘要

Disclosed is a device for processing k-nearest join queries on road networks. The device comprises: a reception unit for receiving a k-nearest query request for at least one object from a client terminal; a query result calculation unit for calculating a k-nearest query result based on a location of the terminal in response to the request; and a transmission unit for transmitting the k-nearest query result based on the location of the terminal to the terminal in response to the request, wherein the query result calculation unit may define first data objects included in a first data set R as first data segments, perform k-nearest neighbor join queries on two first data objects included in the first data segments, and perform k-nearest neighbor search on remaining first data objects included in the first data segments.
机译:公开了一种用于处理道路网络上的k个最近联接查询的设备。该设备包括:接收单元,用于从客户终端接收对至少一个对象的k最近查询请求;以及查询结果计算单元,用于响应于该请求,基于终端的位置来计算k个最近查询结果;传输单元,用于响应于所述请求而基于所述终端的位置向所述终端传输所述k个最近查询结果,其中,所述查询结果计算单元可以将包括在第一数据集R中的第一数据对象定义为第一数据段。 ,对包括在第一数据段中的两个第一数据对象执行k最近邻居连接查询,并对包括在第一数据段中的其余第一数据对象执行k最近邻居搜索。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号