Keyword Search over Knowledge Graphs via Static and Dynamic Hub Labelings
Author:
Affiliation:
1. Nanjing University and Bosch Center for AI
2. Nanjing University
3. Bosch Center for AI and University of Oslo
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3366423.3380110
Reference54 articles.
1. Ittai Abraham Daniel Delling Andrew V. Goldberg and Renato Fonseca F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. 230–241. Ittai Abraham Daniel Delling Andrew V. Goldberg and Renato Fonseca F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. 230–241.
2. Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi and Yuki Kawata. 2014. Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. In ALENEX. 147–154. Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi and Yuki Kawata. 2014. Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. In ALENEX. 147–154.
3. Takuya Akiba Yoichi Iwata and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349–360. Takuya Akiba Yoichi Iwata and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349–360.
4. Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs. In SSDBM. Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs. In SSDBM.
5. Haris Angelidakis Yury Makarychev and Vsevolod Oparin. 2017. Algorithmic and Hardness Results for the Hub Labeling Problem. In SODA. 1442–1461. Haris Angelidakis Yury Makarychev and Vsevolod Oparin. 2017. Algorithmic and Hardness Results for the Hub Labeling Problem. In SODA. 1442–1461.
Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weight Matters: An Empirical Investigation of Distance Oracles on Knowledge Graphs;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21
2. Exploiting Cluster-Skipping Inverted Index for Semantic Place Retrieval;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18
3. QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks;Proceedings of the ACM on Management of Data;2023-06-13
4. Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem;Proceedings of the ACM Web Conference 2023;2023-04-30
5. Knowledge graph incremental embedding for unseen modalities;Knowledge and Information Systems;2023-04-20
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3