English(EN) COL-Trees: Efficient Hierarchical Object Search in Spatial Networks

新的COL-Tree数据结构提升空间网络搜索效率

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-05 05:00

研究人员开发了一种名为COL-Tree（Compacted Object-Landmark Tree）的新数据结构，旨在实现空间网络中高效的层次化对象搜索。该结构利用基于地标的启发式方法，比传统的欧几里得方法在道路系统等复杂网络图中更有效。COL-Trees能够更快地处理各种查询，包括聚合k最近邻（A$k$NN）和k最远邻居（$k$FN），在预处理开销极小的情况下，性能比现有方法高出三个数量级。 AI

影响提高了复杂空间搜索查询的效率，可能使地图绘制和导航领域的AI应用受益。

排序理由详细介绍新数据结构和算法的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.AI 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 10 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 详细介绍新数据结构和算法的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt · 2026-11-05 05:00

COL-Trees：空间网络中的高效分层对象搜索

arXiv:2601.22183v2 Announce Type: replace-cross Abstract: Many spatial network applications, such as map-based services, rely heavily on efficient methods to search for relevant nearby points-of-interest (POIs). A $k$ Nearest Neighbor ($k$NN) query is one such example that finds …

本文如何被排名

报道来源 [1]

COL-Trees：空间网络中的高效分层对象搜索

相关实体

相关话题