Efficient Distance Sensitivity Oracles for Real-World Graph Data

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 32
  • Download : 0
A distance sensitivity oracle is a data structure answering queries that ask the shortest distance from a node to another in a network expecting node/edge failures. It has been mainly studied in theory literature, but all the existing oracles for a directed graph suffer from prohibitive preprocessing time and space. Motivated by this, we develop two practical distance sensitivity oracles for directed graphs as variants of Transit Node Routing, and effective speed-up techniques with a slight loss of accuracy. Extensive experiments demonstrate that our oracles greatly outperform all of competitors in most cases. To the best of our knowledge, our oracles are the first distance sensitivity oracles that handle real-world graph data with million-level nodes.
Publisher
IEEE COMPUTER SOC
Issue Date
2020-04
Language
English
Citation

IEEE 36th International Conference on Data Engineering (ICDE), pp.2028 - 2029

ISSN
1084-4627
DOI
10.1109/ICDE48307.2020.00233
URI
http://hdl.handle.net/10203/288251
Appears in Collection
AE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0