Cost-Efficient Spatial Network Partitioning for Distance-Based Query Processing

@article{Wang2014CostEfficientSN,
  title={Cost-Efficient Spatial Network Partitioning for Distance-Based Query Processing},
  author={Jiping Wang and Kai Zheng and Hoyoung Jeung and Haozhou Wang and Bolong Zheng and Xiaofang Zhou},
  journal={2014 IEEE 15th International Conference on Mobile Data Management},
  year={2014},
  volume={1},
  pages={13-22}
}
The efficiency of spatial query processing is crucial for many applications such as location-based services. In spatial networks, queries like k-NN queries are all based on network distance evaluation. Classic solutions for these queries rely on network expansion and are not efficient enough for large networks. Some approaches have improved the query efficiency but brought considerable space cost for index. To address these problems, we propose a hierarchical graph partitioning based index… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

ROAD: A New Spatial Object Search Framework for Road Networks

  • IEEE Transactions on Knowledge and Data Engineering
  • 2012
VIEW 1 EXCERPT

Query Processing Using Distance Oracles for Spatial Networks

  • IEEE Transactions on Knowledge and Data Engineering
  • 2010
VIEW 1 EXCERPT

Distance Oracles for Spatial Networks

  • 2009 IEEE 25th International Conference on Data Engineering
  • 2009
VIEW 3 EXCERPTS

Similar Papers

Loading similar papers…