Design and analysis of a ranking approach to private location-based services

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

Standard

Design and analysis of a ranking approach to private location-based services. / Yiu, Ma Lung; Jensen, Christian S.; Møller, Jesper; Lu, Hua.

I: A C M Transactions on Database Systems, Bind 36, Nr. 2, 2011, s. Article 10, p.1 - 42.

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

Harvard

Yiu, ML, Jensen, CS, Møller, J & Lu, H 2011, 'Design and analysis of a ranking approach to private location-based services', A C M Transactions on Database Systems, bind 36, nr. 2, s. Article 10, p.1 - 42. https://doi.org/10.1145/1966385.1966388

APA

Yiu, M. L., Jensen, C. S., Møller, J., & Lu, H. (2011). Design and analysis of a ranking approach to private location-based services. A C M Transactions on Database Systems, 36(2), Article 10, p.1 - 42. https://doi.org/10.1145/1966385.1966388

CBE

Yiu ML, Jensen CS, Møller J, Lu H. 2011. Design and analysis of a ranking approach to private location-based services. A C M Transactions on Database Systems. 36(2):Article 10, p.1 - 42. https://doi.org/10.1145/1966385.1966388

MLA

Yiu, Ma Lung o.a.. "Design and analysis of a ranking approach to private location-based services". A C M Transactions on Database Systems. 2011, 36(2). Article 10, p.1 - 42. https://doi.org/10.1145/1966385.1966388

Vancouver

Yiu ML, Jensen CS, Møller J, Lu H. Design and analysis of a ranking approach to private location-based services. A C M Transactions on Database Systems. 2011;36(2):Article 10, p.1 - 42. https://doi.org/10.1145/1966385.1966388

Author

Yiu, Ma Lung ; Jensen, Christian S. ; Møller, Jesper ; Lu, Hua. / Design and analysis of a ranking approach to private location-based services. I: A C M Transactions on Database Systems. 2011 ; Bind 36, Nr. 2. s. Article 10, p.1 - 42.

Bibtex

@article{8ff917561ca64ce6bded0d5f2ce3da27,
title = "Design and analysis of a ranking approach to private location-based services",
abstract = "Users of mobile services wish to retrieve nearby points of interest without disclosing their locations to the services. This article addresses the challenge of optimizing the query performance while satisfying given location privacy and query accuracy requirements. The article's proposal, SpaceTwist, aims to offer location privacy for k nearest neighbor (kNN) queries at low communication cost without requiring a trusted anonymizer. The solution can be used with a conventional DBMS as well as with a server optimized for location-based services. In particular, we believe that this is the first solution that expresses the server-side functionality in a single SQL statement. In its basic form, SpaceTwist utilizes well-known incremental NN query processing on the server. When augmented with a server-side granular search technique, SpaceTwist is capable of exploiting relaxed query accuracy guarantees for obtaining better performance. We extend SpaceTwist with so-called ring ranking, which improves the communication cost, delayed termination, which improves the privacy afforded the user, and the ability to function in spatial networks in addition to Euclidean space. We report on analytical and empirical studies that offer insight into the properties of SpaceTwist and suggest that our proposal is indeed capable of offering privacy with very good performance in realistic settings.",
author = "Yiu, {Ma Lung} and Jensen, {Christian S.} and Jesper M{\o}ller and Hua Lu",
year = "2011",
doi = "10.1145/1966385.1966388",
language = "English",
volume = "36",
pages = "Article 10, p.1 -- 42",
journal = "A C M Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery, Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - Design and analysis of a ranking approach to private location-based services

AU - Yiu, Ma Lung

AU - Jensen, Christian S.

AU - Møller, Jesper

AU - Lu, Hua

PY - 2011

Y1 - 2011

N2 - Users of mobile services wish to retrieve nearby points of interest without disclosing their locations to the services. This article addresses the challenge of optimizing the query performance while satisfying given location privacy and query accuracy requirements. The article's proposal, SpaceTwist, aims to offer location privacy for k nearest neighbor (kNN) queries at low communication cost without requiring a trusted anonymizer. The solution can be used with a conventional DBMS as well as with a server optimized for location-based services. In particular, we believe that this is the first solution that expresses the server-side functionality in a single SQL statement. In its basic form, SpaceTwist utilizes well-known incremental NN query processing on the server. When augmented with a server-side granular search technique, SpaceTwist is capable of exploiting relaxed query accuracy guarantees for obtaining better performance. We extend SpaceTwist with so-called ring ranking, which improves the communication cost, delayed termination, which improves the privacy afforded the user, and the ability to function in spatial networks in addition to Euclidean space. We report on analytical and empirical studies that offer insight into the properties of SpaceTwist and suggest that our proposal is indeed capable of offering privacy with very good performance in realistic settings.

AB - Users of mobile services wish to retrieve nearby points of interest without disclosing their locations to the services. This article addresses the challenge of optimizing the query performance while satisfying given location privacy and query accuracy requirements. The article's proposal, SpaceTwist, aims to offer location privacy for k nearest neighbor (kNN) queries at low communication cost without requiring a trusted anonymizer. The solution can be used with a conventional DBMS as well as with a server optimized for location-based services. In particular, we believe that this is the first solution that expresses the server-side functionality in a single SQL statement. In its basic form, SpaceTwist utilizes well-known incremental NN query processing on the server. When augmented with a server-side granular search technique, SpaceTwist is capable of exploiting relaxed query accuracy guarantees for obtaining better performance. We extend SpaceTwist with so-called ring ranking, which improves the communication cost, delayed termination, which improves the privacy afforded the user, and the ability to function in spatial networks in addition to Euclidean space. We report on analytical and empirical studies that offer insight into the properties of SpaceTwist and suggest that our proposal is indeed capable of offering privacy with very good performance in realistic settings.

U2 - 10.1145/1966385.1966388

DO - 10.1145/1966385.1966388

M3 - Journal article

VL - 36

SP - Article 10, p.1 - 42

JO - A C M Transactions on Database Systems

JF - A C M Transactions on Database Systems

SN - 0362-5915

IS - 2

ER -