Spatial Query Integrity with Voronoi Neighbors

被引:58
作者
Hu, Ling [1 ]
Ku, Wei-Shinn [2 ]
Bakiras, Spiridon [3 ]
Shahabi, Cyrus [1 ]
机构
[1] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
[2] Auburn Univ, Dept Comp Sci & Software Engn, Auburn, AL 36849 USA
[3] CUNY John Jay Coll Criminal Justice, Dept Math & Comp Sci, New York, NY 10019 USA
基金
美国国家科学基金会;
关键词
Spatial database outsourcing; location-based services; query authentication; spatial queries; DATABASE;
D O I
10.1109/TKDE.2011.267
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the popularity of location-based services and the abundant usage of smart phones and GPS-enabled devices, the necessity of outsourcing spatial data has grown rapidly over the past few years. Meanwhile, the fast arising trend of cloud storage and cloud computing services has provided a flexible and cost-effective platform for hosting data from businesses and individuals, further enabling many location-based applications. Nevertheless, in this database outsourcing paradigm, the authentication of the query results at the client remains a challenging problem. In this paper, we focus on the Outsourced Spatial Database (OSDB) model and propose an efficient scheme, called VN-Auth, which allows a client to verify the correctness and completeness of the result set. Our approach is based on neighborhood information derived from the Voronoi diagram of the underlying spatial data set and can handle fundamental spatial query types, such as k nearest neighbor and range queries, as well as more advanced query types like reverse k nearest neighbor, aggregate nearest neighbor, and spatial skyline. We evaluated VN-Auth based on real-world data sets using mobile devices (Google Droid smart phones with Android OS) as query clients. Compared to the current state-of-the-art approaches (i.e., methods based on Merkle Hash Trees), our experiments show that VN-Auth produces significantly smaller verification objects and is more computationally efficient, especially for queries with low selectivity.
引用
收藏
页码:863 / 876
页数:14
相关论文
共 34 条
  • [1] [Anonymous], 2004, P 2004 VLDB C, DOI DOI 10.1016/B978-012088469-8.50074-7
  • [2] [Anonymous], 2009, PVLDB
  • [3] [Anonymous], 2005, P 31 INT C VERY LARG
  • [4] Bellare M, 2002, LECT NOTES COMPUT SC, V2442, P162
  • [5] Short signatures from the Weil pairing
    Boneh, D
    Lynn, B
    Shacham, H
    [J]. JOURNAL OF CRYPTOLOGY, 2004, 17 (04) : 297 - 319
  • [6] Cheng WW, 2007, LECT NOTES COMPUT SC, V4721, P47
  • [7] Cheng WW, 2006, LECT NOTES COMPUT SC, V4127, P60
  • [8] Query assurance verification for outsourced multi-dimensional databases
    Cheng, Weiwei
    Tan, Kian-Lee
    [J]. JOURNAL OF COMPUTER SECURITY, 2009, 17 (01) : 101 - 126
  • [9] Batch RSA
    Fiat, A
    [J]. JOURNAL OF CRYPTOLOGY, 1997, 10 (02) : 75 - 88
  • [10] Guttman Antonin., 1984, P 1984 ACM SIGMOD C, P47