External data structures for shortest path queries on planar digraphs

被引：0
|
作者：
Arge, L [1 ]
Toma, L
机构：
[1] Duke Univ, Durham, NC 27708 USA
[2] Bowdoin Coll, Brunswick, ME 04011 USA
来源：
ALGORITHMS AND COMPUTATION | 2005年 / 3827卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Omega(N1+epsilon) and S = O(N-2/B), our main result is a family of structures that use S space and answer queries in O(N-2/SB) I/Os, thus obtaining optimal space-query product O(N-2/B). An S space structure can be constructed in O(root S center dot sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph.
引用
收藏
页码：328 / 338
页数：11
相关论文
共 50 条
  • [41] Approximate shortest path queries on weighted polyhedral surfaces
    Aleksandrov, Lyudmil
    Djidjev, Hristo N.
    Guo, Hua
    Maheshwari, Anil
    Nussbaum, Doron
    Sack, Jorg-Rudiger
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 98 - 109
  • [42] OPTIMAL SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
    GUIBAS, LJ
    HERSHBERGER, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (02) : 126 - 152
  • [43] Shortest rectilinear path queries to rectangles in a rectangular domain
    Kim, Mincheol
    Yoon, Sang Duk
    Ahn, Hee-Kap
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2021, 99
  • [44] Shortest path algorithm of a network via spherical fuzzy digraphs
    Mani, Parimala
    Alshammari, Ibtesam
    Alshehri, Halimah
    [J]. JOURNAL OF ENGINEERING RESEARCH, 2021, 9
  • [45] Privacy Preserving Shortest Path Queries on Directed Graph
    Ramezanian, Sara
    Meskanen, Tommi
    Niemi, Valtteri
    [J]. PROCEEDINGS OF THE 2018 22ND CONFERENCE OF OPEN INNOVATIONS ASSOCIATION (FRUCT), 2018, : 217 - 223
  • [46] Approximate Shortest Path Queries Using Voronoi Duals
    Honiden, Shinichi
    Houle, Michael E.
    Sommer, Christian
    Wolff, Martin
    [J]. TRANSACTIONS ON COMPUTATIONAL SCIENCE IX, 2010, 6290 : 28 - 53
  • [47] Shortest path queries between geometric objects on surfaces
    Guo, Hua
    Maheshwari, Anil
    Nussbaum, Doron
    Sack, Joerg-Ruediger
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS, 2007, 4705 : 82 - +
  • [48] Proxies for Shortest Path and Distance Queries (Extended Abstract)
    Ma, Shuai
    Feng, Kaiyu
    Li, Jianxin
    Wang, Haixun
    Cong, Gao
    Huai, Jinpeng
    [J]. 2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017), 2017, : 61 - 62
  • [49] A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
    Das, Debarati
    Kipouridis, Evangelos
    Gutenberg, Maximilian Probst
    Wulff-Nilsen, Christian
    [J]. 2022 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2022, : 1 - 11
  • [50] Approximate Shortest Path Queries in Graphs Using Voronoi Duals
    Honiden, Shinichi
    Houle, Michael E.
    Sommer, Christian
    Wolff, Martin
    [J]. 2009 6TH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS (ISVD 2009), 2009, : 53 - +
12345