%0 Journal Article
%T MOQ-QR:query processing research for CKNN based on QR-tree<br>MOQ-QR:基于QR-树的连续K近邻查询算法研究*
%A ZOU Yong-gui
%A SONG Qiang
%A YANG Fu-ping
%A <br>邹永贵
%A 宋强
%A 杨富平
%J 计算机应用研究
%D 2010
%I 
%X This paper comprehensively analyzed the deficiencies of continuous K-nearest neighbor (CKNN for short) query processing on R-tree and quad tree.It proposed a new index structure called MOQ-QR based on R-tree and quad tree(QR tree),which could solve CKNN query processing of moving objects.Calculated the distances between the query point and moving objects by allocating a static space to the moving objects, and making use of QR-tree and hash tables as an index to store the moving object.Experimental results show that, compared with the existent processing algortihms, the proposed algorithm not only improves the query efficiency, but also reduces the consumption of the system resource.
%K R-tree
%K quad tree
%K QR-tree
%K moving objects
%K distance<br>R树
%K 四叉树
%K QR树
%K 移动对象
%K 空间距离
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=3D51129F2D4FE90EAF5992C9C1341947&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=BDC707DB90449563&eid=6E30A65D6DD5D131&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13