Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2011
DOI: 10.1145/2093973.2094031
|View full text |Cite
|
Sign up to set email alerts
|

Energy-efficient shortest path query processing on air

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Most of the existing broadcast-based LBQ methods are aimed at Euclidean spaces and cannot be readily extended to road networks. Recently, many researchers have presented several methods to process spatial queries in road networks [2,[16][17][18][19][20][21][22][23][24]. Sun et al [2] present an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast.…”
Section: Index For Spatial Queries In Road Networkmentioning
confidence: 99%
“…Most of the existing broadcast-based LBQ methods are aimed at Euclidean spaces and cannot be readily extended to road networks. Recently, many researchers have presented several methods to process spatial queries in road networks [2,[16][17][18][19][20][21][22][23][24]. Sun et al [2] present an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast.…”
Section: Index For Spatial Queries In Road Networkmentioning
confidence: 99%
“…An energy-efficient air index, namely BagIndex, has also been proposed to support shortest path queries. Both [8] and [9] only support shortest path queries but not common spatial queries such as range query and kNN query. A more general index that can support multiple spatial queries is desired.…”
Section: Fig 2 Partitioning a Road Network Into 2×2 Gridsmentioning
confidence: 99%
“…Like many other existing works [4], [8], [9], we assume the clients are located at network nodes to simplify our discussion. However, our algorithms can be easily extended to support cases where clients' locations are located along the network edges.…”
Section: Client-site Query Processingmentioning
confidence: 99%
See 1 more Smart Citation
“…Jing et al [5] propose the BagIndex for shortest path queries (and hence distance queries as well). Their method is based on a tree decomposition.…”
Section: Previous and Related Workmentioning
confidence: 99%