FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2051257608> ?p ?o ?g. }

• W2051257608 endingPage "31" @default.
• W2051257608 startingPage "1" @default.
• W2051257608 abstract "Shortest path query is one of the most fundamental queries in spatial network databases. There exist algorithms that can process shortest path queries in real time. However, many complex applications require more than just the calculation of a single shortest path. For example, one of the common ways to determine the importance (or price) of a vertex or an edge in spatial network is to use Vickrey pricing, which intuitively values the vertex v (or edge e ) based on how much harder for travelling from the sources to the destinations without using v (or e ). In such cases, the alternative shortest paths without using v (or e ) are required. In this article, we propose using a precomputation based approach for both single pair alternative shortest path and all pairs shortest paths processing. To compute the alternative shortest path between a source and a destination efficiently, a naïive way is to precompute and store all alternative shortest paths between every pair of vertices avoiding every possible vertex (or edge), which requires O ( n 4 ) space. Currently, the state of the art approach for reducing the storage cost is to choose a subset of the vertices as center points, and only store the single-source alternative shortest paths from those center points. Such approach has the space complexity of O ( n 2 log n ). We propose a storage scheme termed iSPQF , which utilizes shortest path quadtrees by observing the relationships between each avoiding vertex and its corresponding alternative shortest paths. We have reduced the space complexity from the naïive O ( n 4 ) (or the state of the art O ( n 4 log n )) to O (min( γ, L ) n 1.5 ) with comparable query performance of O ( K ), where K is the number of vertices in the returned paths, L is the diameter of the spatial network, and γ is a value that depends on the structure of the spatial network, which is empirically estimated to be 40 for real road networks. Experiments on real road networks have shown that the space cost of the proposed iSPQF is scalable, and both the algorithms based on iSPQF are efficient." @default.
• W2051257608 created "2016-06-24" @default.
• W2051257608 creator A5007772416 @default.
• W2051257608 creator A5011384237 @default.
• W2051257608 creator A5028885505 @default.
• W2051257608 creator A5032517198 @default.
• W2051257608 creator A5039679896 @default.
• W2051257608 date "2012-12-01" @default.
• W2051257608 modified "2023-10-03" @default.
• W2051257608 title "Finding Alternative Shortest Paths in Spatial Networks" @default.
• W2051257608 cites W1773616669 @default.
• W2051257608 cites W1829285201 @default.
• W2051257608 cites W1982440947 @default.
• W2051257608 cites W1989169588 @default.
• W2051257608 cites W1999293689 @default.
• W2051257608 cites W2022980325 @default.
• W2051257608 cites W2075543862 @default.
• W2051257608 cites W2084224084 @default.
• W2051257608 cites W2087989168 @default.
• W2051257608 cites W2102842495 @default.
• W2051257608 cites W2117909275 @default.
• W2051257608 cites W2127151074 @default.
• W2051257608 cites W2131237536 @default.
• W2051257608 cites W2134874858 @default.
• W2051257608 cites W2169528473 @default.
• W2051257608 cites W2171330332 @default.
• W2051257608 cites W2171901130 @default.
• W2051257608 doi "https://doi.org/10.1145/2389241.2389248" @default.
• W2051257608 hasPublicationYear "2012" @default.
• W2051257608 type Work @default.
• W2051257608 sameAs 2051257608 @default.
• W2051257608 citedByCount "26" @default.
• W2051257608 countsByYear W20512576082013 @default.
• W2051257608 countsByYear W20512576082015 @default.
• W2051257608 countsByYear W20512576082016 @default.
• W2051257608 countsByYear W20512576082017 @default.
• W2051257608 countsByYear W20512576082018 @default.
• W2051257608 countsByYear W20512576082019 @default.
• W2051257608 countsByYear W20512576082020 @default.
• W2051257608 countsByYear W20512576082021 @default.
• W2051257608 countsByYear W20512576082022 @default.
• W2051257608 countsByYear W20512576082023 @default.
• W2051257608 crossrefType "journal-article" @default.
• W2051257608 hasAuthorship W2051257608A5007772416 @default.
• W2051257608 hasAuthorship W2051257608A5011384237 @default.
• W2051257608 hasAuthorship W2051257608A5028885505 @default.
• W2051257608 hasAuthorship W2051257608A5032517198 @default.
• W2051257608 hasAuthorship W2051257608A5039679896 @default.
• W2051257608 hasConcept C11413529 @default.
• W2051257608 hasConcept C119971455 @default.
• W2051257608 hasConcept C132525143 @default.
• W2051257608 hasConcept C159379195 @default.
• W2051257608 hasConcept C168451585 @default.
• W2051257608 hasConcept C170836113 @default.
• W2051257608 hasConcept C173870130 @default.
• W2051257608 hasConcept C178067994 @default.
• W2051257608 hasConcept C186065694 @default.
• W2051257608 hasConcept C22590252 @default.
• W2051257608 hasConcept C41008148 @default.
• W2051257608 hasConcept C45374587 @default.
• W2051257608 hasConcept C54385418 @default.
• W2051257608 hasConcept C70266271 @default.
• W2051257608 hasConcept C80444323 @default.
• W2051257608 hasConcept C80899671 @default.
• W2051257608 hasConceptScore W2051257608C11413529 @default.
• W2051257608 hasConceptScore W2051257608C119971455 @default.
• W2051257608 hasConceptScore W2051257608C132525143 @default.
• W2051257608 hasConceptScore W2051257608C159379195 @default.
• W2051257608 hasConceptScore W2051257608C168451585 @default.
• W2051257608 hasConceptScore W2051257608C170836113 @default.
• W2051257608 hasConceptScore W2051257608C173870130 @default.
• W2051257608 hasConceptScore W2051257608C178067994 @default.
• W2051257608 hasConceptScore W2051257608C186065694 @default.
• W2051257608 hasConceptScore W2051257608C22590252 @default.
• W2051257608 hasConceptScore W2051257608C41008148 @default.
• W2051257608 hasConceptScore W2051257608C45374587 @default.
• W2051257608 hasConceptScore W2051257608C54385418 @default.
• W2051257608 hasConceptScore W2051257608C70266271 @default.
• W2051257608 hasConceptScore W2051257608C80444323 @default.
• W2051257608 hasConceptScore W2051257608C80899671 @default.
• W2051257608 hasIssue "4" @default.
• W2051257608 hasLocation W20512576081 @default.
• W2051257608 hasOpenAccess W2051257608 @default.
• W2051257608 hasPrimaryLocation W20512576081 @default.
• W2051257608 hasRelatedWork W2170980056 @default.
• W2051257608 hasRelatedWork W2198982833 @default.
• W2051257608 hasRelatedWork W2347245430 @default.
• W2051257608 hasRelatedWork W2360981904 @default.
• W2051257608 hasRelatedWork W2368964068 @default.
• W2051257608 hasRelatedWork W2388014219 @default.
• W2051257608 hasRelatedWork W2810620529 @default.
• W2051257608 hasRelatedWork W4253588386 @default.
• W2051257608 hasRelatedWork W4293054712 @default.
• W2051257608 hasRelatedWork W651485002 @default.
• W2051257608 hasVolume "37" @default.
• W2051257608 isParatext "false" @default.
• W2051257608 isRetracted "false" @default.
• W2051257608 magId "2051257608" @default.

• next