signed subspace skyline scope authenticated method for skyline queries
G.Rajalakshmi,B.Vijaya Nirmala
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:4 Issue:3 Year: 15 May,2016 Pages:1056-1061
Abstract
A Novel idea for Merkle Skyline R-Tree Method and Novel Partial S4 Tree Method is proposed to authenticate one shot Location based Arbitrary subspace Skyline Query’s (LASQs). MSR Tree authentication method is proposed for skyline query authentication. A continuous skyline query processing strategy is implemented for moving query points. Cloud Service Provider is responsible for maintaining the database. Query integrity assurance is based on digital signatures and utilizes a public key cryptosystem, such as RSA. The purpose of this project is to identify the location of moving client. Verification Object creation is proposed to verify the location and produce result to client. Client results are viewed through the geomap, which is based on road network map type.
Kewords
Location based arbitrary subspace skyline query, query authentication, similarity search.
Reference
[1] Beckmann N. Kriegel H.P. Schneider R. and Seeger B. (1990), The R*-tree: An efficient and robust access method for points and rectangles. [2] Chen Q. Hu H. and Xu J. (2013), VERDICT: Privacy-preserving authentication of range queries in location-based services. [3] He H. and Singh A. K. (2006), Closure-tree: An index structure for graph queries. [4] Huang Z. Lu H. Ooi B. C. and Tong K. H. (2006), Continuous skyline queries for moving objects. [5] Hu H. Xu J. and Lee D.L. (2005), A generic framework for monitoring continuous spatial queries over moving objects. [6] Ku W.S. Hu L. Bakiras S. and Shahabi C. (2013), Spatial query integrity with voronoi neighbors. [7] Kundu A. and Bertino E. (2010), How to authenticate graphs without leaking. [8] Pang H. Jain A. and K Tan K.L. (2005), Verifying completeness of relational query results in data publishing. [9] Yuanyuan T. Carlos C. S. States D. J. and Patel J. M. (2007), SAGA: A subgraph matching tool for biological graphs. [10] Zhu Y. Qin L. Yu J.X. and Cheng H. (2012), Finding top-k similar graphs in graph database.
