Efficient Processing of Moving<i> k</i>-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/misy/volume-2016/2406142/figures/2406142.fig.005a.svgz" name="2406142.fig.005a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b><svg height="9.39034pt" id="M179" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 6.50656 9.39034" width="6.50656pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M474 429L457 433C435 440 389 448 367 448C348 448 323 446 309 443C266 434 195 406 148 366C78 307 23 210 23 101C23 35 55 -12 92 -12C118 -12 146 1 196 35C247 70 311 130 346 173H348L281 -148C268 -211 256 -221 208 -229L191 -232L187 -257L433 -245L437 -219L411 -216C357 -210 350 -205 362 -140L427 207C447 315 461 381 474 429ZM387 387C379 337 363 262 355 236C318 180 201 57 142 57C126 57 112 81 112 128C112 205 150 321 220 376C244 395 280 403 312 403C345 403 370 396 387 387Z" id="g113-114"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="491" vert-adv-y="491"></glyph.data></g></svg> leaves query region <svg height="10.7866pt" id="M180" style="vertical-align:-2.150701pt" version="1.1" viewbox="-0.0498162 -8.6359 9.52083 10.7866" width="9.52083pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z" id="g113-82"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="722" vert-adv-y="722"></glyph.data></g></svg></td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/misy/volume-2016/2406142/figures/2406142.fig.005b.svgz" name="2406142.fig.005b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Congestion area <svg height="9.01194pt" id="M181" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.96212 8.41168 9.01194" width="8.41168pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M620 675H597C578 656 570 650 541 650H144C112 650 104 653 94 675H72C59 618 42 552 23 493L53 491C71 534 88 564 105 585C124 608 144 615 238 615H290L197 121C182 40 174 34 88 28L82 0H361L367 28C275 34 266 38 281 121L374 615H441C522 615 543 608 553 583C562 560 566 531 565 493L597 494C603 551 612 629 620 675Z" id="g113-85"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="637" vert-adv-y="637"></glyph.data></g></svg> nullifies <svg height="9.49473pt" id="M182" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.66314 9.49473" width="6.66314pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z" id="g113-108"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="503" vert-adv-y="503"></glyph.data></g></svg>RNN query result for <svg height="10.7866pt" id="M183" style="vertical-align:-2.150701pt" version="1.1" viewbox="-0.0498162 -8.6359 9.52083 10.7866" width="9.52083pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z" id="g113-82"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="722" vert-adv-y="722"></glyph.data></g></svg></td></tr></table>

<div>Two events that trigger the evaluation of M<i>k</i>RNN queries.</div>

Mobile Information Systems

fig5

Figure 5

Figure 5: Efficient Processing of Moving<i> k</i>-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks 

Mobile Information Systems

Efficient Processing of Moving k-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

Figure 5