Matches in SemOpenAlex for { <https://semopenalex.org/work/W2916082187> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W2916082187 endingPage "18" @default.
- W2916082187 startingPage "1" @default.
- W2916082187 abstract "<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M1><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:math>nearest neighbor (<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M2><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>NN) search is an important problem in location-based services (LBS) and has been well studied on static road networks. However, in real world, road networks are often time-dependent; i.e., the time for traveling through a road always changes over time. Most existing methods for<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M3><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>NN query build various indexes maintaining the shortest distances for some pairs of vertices on static road networks. Unfortunately, these methods cannot be used for the time-dependent road networks because the shortest distances always change over time. To address the problem of<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M4><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>NN query on time-dependent road networks, we propose a novel voronoi-based index in this paper. Furthermore, we propose a novel balanced tree, named<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M5><mml:mrow><mml:mi mathvariant=sans-serif>V</mml:mi></mml:mrow></mml:math>-<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M6><mml:mi mathvariant=sans-serif>t</mml:mi><mml:mi mathvariant=sans-serif>r</mml:mi><mml:mi mathvariant=sans-serif>e</mml:mi><mml:mi mathvariant=sans-serif>e</mml:mi></mml:math>, which is a secondary level index on voronoi-based index to make our querying algorithm more efficient. Moreover, we propose an algorithm for preprocessing time-dependent road networks such that the waiting time is not necessary to be considered. We confirm the efficiency of our method through experiments on real-life datasets." @default.
- W2916082187 created "2019-03-02" @default.
- W2916082187 creator A5006822602 @default.
- W2916082187 creator A5018666047 @default.
- W2916082187 creator A5018813541 @default.
- W2916082187 creator A5032639219 @default.
- W2916082187 creator A5045281373 @default.
- W2916082187 creator A5056686459 @default.
- W2916082187 date "2019-02-24" @default.
- W2916082187 modified "2023-10-15" @default.
- W2916082187 title "A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks" @default.
- W2916082187 cites W1511415058 @default.
- W2916082187 cites W1519764348 @default.
- W2916082187 cites W1594653212 @default.
- W2916082187 cites W2057451750 @default.
- W2916082187 cites W2076500189 @default.
- W2916082187 cites W2087360095 @default.
- W2916082187 cites W2135957668 @default.
- W2916082187 cites W2186094217 @default.
- W2916082187 cites W2546691052 @default.
- W2916082187 cites W2588514192 @default.
- W2916082187 cites W2753481197 @default.
- W2916082187 cites W2789836371 @default.
- W2916082187 cites W2793709743 @default.
- W2916082187 cites W2801372700 @default.
- W2916082187 cites W4235851065 @default.
- W2916082187 doi "https://doi.org/10.1155/2019/4829164" @default.
- W2916082187 hasPublicationYear "2019" @default.
- W2916082187 type Work @default.
- W2916082187 sameAs 2916082187 @default.
- W2916082187 citedByCount "2" @default.
- W2916082187 countsByYear W29160821872021 @default.
- W2916082187 countsByYear W29160821872023 @default.
- W2916082187 crossrefType "journal-article" @default.
- W2916082187 hasAuthorship W2916082187A5006822602 @default.
- W2916082187 hasAuthorship W2916082187A5018666047 @default.
- W2916082187 hasAuthorship W2916082187A5018813541 @default.
- W2916082187 hasAuthorship W2916082187A5032639219 @default.
- W2916082187 hasAuthorship W2916082187A5045281373 @default.
- W2916082187 hasAuthorship W2916082187A5056686459 @default.
- W2916082187 hasBestOaLocation W29160821871 @default.
- W2916082187 hasConcept C11413529 @default.
- W2916082187 hasConcept C119857082 @default.
- W2916082187 hasConcept C154945302 @default.
- W2916082187 hasConcept C24881265 @default.
- W2916082187 hasConcept C2524010 @default.
- W2916082187 hasConcept C33923547 @default.
- W2916082187 hasConcept C41008148 @default.
- W2916082187 hasConceptScore W2916082187C11413529 @default.
- W2916082187 hasConceptScore W2916082187C119857082 @default.
- W2916082187 hasConceptScore W2916082187C154945302 @default.
- W2916082187 hasConceptScore W2916082187C24881265 @default.
- W2916082187 hasConceptScore W2916082187C2524010 @default.
- W2916082187 hasConceptScore W2916082187C33923547 @default.
- W2916082187 hasConceptScore W2916082187C41008148 @default.
- W2916082187 hasFunder F4320321001 @default.
- W2916082187 hasLocation W29160821871 @default.
- W2916082187 hasLocation W29160821872 @default.
- W2916082187 hasLocation W29160821873 @default.
- W2916082187 hasOpenAccess W2916082187 @default.
- W2916082187 hasPrimaryLocation W29160821871 @default.
- W2916082187 hasRelatedWork W2961085424 @default.
- W2916082187 hasRelatedWork W3046775127 @default.
- W2916082187 hasRelatedWork W3170094116 @default.
- W2916082187 hasRelatedWork W4205958290 @default.
- W2916082187 hasRelatedWork W4285260836 @default.
- W2916082187 hasRelatedWork W4286629047 @default.
- W2916082187 hasRelatedWork W4306321456 @default.
- W2916082187 hasRelatedWork W4306674287 @default.
- W2916082187 hasRelatedWork W4386462264 @default.
- W2916082187 hasRelatedWork W4224009465 @default.
- W2916082187 hasVolume "2019" @default.
- W2916082187 isParatext "false" @default.
- W2916082187 isRetracted "false" @default.
- W2916082187 magId "2916082187" @default.
- W2916082187 workType "article" @default.