DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Jong-Ryul | ko |
dc.contributor.author | Chung, Chin-Wan | ko |
dc.date.accessioned | 2021-10-19T06:50:20Z | - |
dc.date.available | 2021-10-19T06:50:20Z | - |
dc.date.created | 2021-10-19 | - |
dc.date.issued | 2020-04 | - |
dc.identifier.citation | IEEE 36th International Conference on Data Engineering (ICDE), pp.2028 - 2029 | - |
dc.identifier.issn | 1084-4627 | - |
dc.identifier.uri | http://hdl.handle.net/10203/288251 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Efficient Distance Sensitivity Oracles for Real-World Graph Data | - |
dc.type | Conference | - |
dc.identifier.wosid | 000584252700226 | - |
dc.identifier.scopusid | 2-s2.0-85085862038 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 2028 | - |
dc.citation.endingpage | 2029 | - |
dc.citation.publicationname | IEEE 36th International Conference on Data Engineering (ICDE) | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | Dallas, TX | - |
dc.identifier.doi | 10.1109/ICDE48307.2020.00233 | - |
dc.contributor.localauthor | Lee, Jong-Ryul | - |
dc.contributor.nonIdAuthor | Chung, Chin-Wan | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.