首页> 外国专利> 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-近邻邻居查询的设备

摘要

An apparatus for processing a k-nearest join query on a road network is disclosed. The apparatus includes: a receiver configured to receive a k-nearest query request for at least one object from a client terminal; A query result calculating unit for calculating a k-nearest query result based on the location of the terminal in response to the request; And a transmission unit, in response to the request, transmitting a k-nearest query result based on the location of the terminal to the terminal. It may include, the query result operation unit defines the first data object included in the first data set R as a first data segment, k- for two first data objects included in the first data segment A nearest neighbor join query may be performed, and k-nearest neighbor search may be performed on the remaining first data objects included in the first data segment.
机译:公开了一种用于在道路网络上处理k个最近联接查询的设备。该装置包括:接收器,被配置为从客户终端接收对至少一个对象的k最近查询请求;以及查询结果计算单元,用于响应于该请求,基于终端的位置来计算k个最近的查询结果;并且,发送单元响应于该请求,将基于终端的位置的k最近查询结果发送给终端。可以包括,查询结果运算单元将包括在第一数据集R中的第一数据对象定义为第一数据段,对于包括在第一数据段中的两个第一数据对象的k-可以执行最近邻居连接查询,以及可以对包括在第一数据段中的其余第一数据对象执行k最近邻居搜索。

著录项

  • 公开/公告号KR102127769B1

    专利类型

  • 公开/公告日2020-07-09

    原文格式PDF

  • 申请/专利权人 경북대학교 산학협력단;

    申请/专利号KR20180091763

  • 发明设计人 조형주;

    申请日2018-08-07

  • 分类号G06F16;G01C21/26;

  • 国家 KR

  • 入库时间 2022-08-21 11:04:19

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号