Abstract | ||
---|---|---|
In this paper, authors discuss a scheme for distributed processing of spatial index tree[1], and its application to spatial queries, Shortest Path Search(SPS), Distance Range Query(DRQ) and k-Nearest Neighbor search(kNN) for spatial networks. Spatial index tree is generated from a given road network using Network Voronoi Diagrams, and possesses layered structure. We herein assume autonomous mobile system environment where spatial index tree servers and GPS-equipped mobile devices, such as ANDROID embedded smart phones, communicate with each other to process these spatial queries in a distributed manner. Queries are processed in two separate steps, rough search in servers and fine search in mobile devices, respectively. Structured data of spatial index tree are extracted for each generator region, and stored in servers. Some numerical results are presented for real map data issued by Geographical Survey Institute. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/ICPADS.2011.126 | Parallel and Distributed Systems |
Keywords | Field | DocType |
spatial index tree server,rough search,spatial query,spatial network,mobile device,autonomous mobile system environment,gps-equipped mobile device,k-nearest neighbor search,spatial index tree,spatial queries processing,fine search,k nearest neighbor,mobile computing,voronoi diagram,shortest path,distributed processing,spatial index,structured data,distributed application,distributed applications,computational geometry,range query | Mobile computing,Data mining,Computer science,Server,Range query (data structures),Real-time computing,Mobile device,Voronoi diagram,Spatial query,Data model,Spatial database | Conference |
ISSN | ISBN | Citations |
1521-9097 | 978-1-4577-1875-5 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tomoya Kambara | 1 | 0 | 0.34 |
Kazuya Tamaki | 2 | 0 | 0.34 |
Toshinori Muranaka | 3 | 0 | 0.34 |
Shinichi Ueshima | 4 | 45 | 15.31 |