Détail de l'auteur
Auteur W. Ku |
Documents disponibles écrits par cet auteur (2)
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externes
A query integrity assurance scheme for accessing outsourced spatial databases / W. Ku in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : A query integrity assurance scheme for accessing outsourced spatial databases Type de document : Article/Communication Auteurs : W. Ku, Auteur ; L. Hu, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 97 - 124 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] base de données localisées
[Termes IGN] courbe de Hilbert
[Termes IGN] cryptage
[Termes IGN] externalisation
[Termes IGN] intégrité des données
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] protection de la vie privéeRésumé : (Auteur) With the trend of cloud computing, outsourcing databases to third party service providers is becoming a common practice for data owners to decrease the cost of managing and maintaining databases in-house. In conjunction, due to the popularity of location-based-services (LBS), the need for spatial data (e.g., gazetteers, vector data) is increasing dramatically. Consequently, there is a noticeably new tendency of outsourcing spatial datasets by data collectors. Two main challenges with outsourcing datasets are to keep the data private (from the data provider) and to ensure the integrity of the query result (for the clients). Unfortunately, most of the techniques proposed for privacy and integrity do not extend to spatial data in a straightforward manner. Hence, recent studies proposed various techniques to support either privacy or integrity (but not both) on spatial datasets. In this paper, for the first time, we propose a technique that can ensure both privacy and integrity for outsourced spatial data. In particular, we first use a one-way spatial transformation method based on Hilbert curves, which encrypts the spatial data before outsourcing and, hence, ensures its privacy. Next, by probabilistically replicating a portion of the data and encrypting it with a different encryption key, we devise a technique for the client to audit the trustworthiness of the query results. We show the applicability of our approach for both k-nearest-neighbor queries and spatial range queries, which are the building blocks of any LBS application. We also design solutions to guarantee the freshness of outsourced spatial databases. Finally, we evaluate the validity and performance of our algorithms with security analyses and extensive simulations. Numéro de notice : A2013-048 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0156-9 Date de publication en ligne : 15/03/2012 En ligne : https://doi.org/10.1007/s10707-012-0156-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32186
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 97 - 124[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible The partial sequenced route query with traveling rules in road networks / H. Chen in Geoinformatica, vol 15 n° 3 (July 2011)
[article]
Titre : The partial sequenced route query with traveling rules in road networks Type de document : Article/Communication Auteurs : H. Chen, Auteur ; W. Ku, Auteur ; M. Sun, Auteur ; R. Zimmermann, Auteur Année de publication : 2011 Article en page(s) : pp 541 - 569 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] calcul d'itinéraire
[Termes IGN] itinéraire
[Termes IGN] point d'intérêt
[Termes IGN] requête spatiale
[Termes IGN] réseau routier
[Termes IGN] service fondé sur la positionRésumé : (Auteur) In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial sequenced route (MRPSR) query, which enables efficient trip planning with user defined traveling rules. The MRPSR query provides a unified framework that subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. The difficulty in answering MRPSR queries lies in how to integrate multiple choices of points-of-interest (POI) with traveling rules when searching for satisfying routes. We prove that MRPSR query is NP-hard and then provide three algorithms by mapping traveling rules to an activity on vertex network. Afterwards, we extend all the proposed algorithms to road networks. By utilizing both real and synthetic POI datasets, we investigate the performance of our algorithms. The results of extensive simulations show that our algorithms are able to answer MRPSR queries effectively and efficiently with underlying road networks. Compared to the Light Optimal Route Discoverer (LORD) based brute-force solution, the response time of our algorithms is significantly reduced while the distances of the computed routes are only slightly longer than the shortest route. Numéro de notice : A2011-211 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0115-2 Date de publication en ligne : 03/09/2010 En ligne : https://doi.org/10.1007/s10707-010-0115-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30989
in Geoinformatica > vol 15 n° 3 (July 2011) . - pp 541 - 569[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2011031 RAB Revue Centre de documentation En réserve L003 Disponible