{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:20:32Z","timestamp":1759134032840},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368172"},{"type":"electronic","value":"9783642368189"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36818-9_11","type":"book-chapter","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T16:14:54Z","timestamp":1362413694000},"page":"101-110","source":"Crossref","is-referenced-by-count":7,"title":["On Efficient Processing of Complicated Cloaked Region for Location Privacy Aware Nearest-Neighbor Queries"],"prefix":"10.1007","author":[{"given":"Chan Nam","family":"Ngo","sequence":"first","affiliation":[]},{"given":"Tran Khanh","family":"Dang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of The number of Points required to represent a Digitized Line Or its Caricature. In: Cartographica: The Intl. Journal for Geographic Information and Geovisualization, pp. 112\u2013122. Univ. of Toronto Press (1973)","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Beckman, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Dang, T.K., Phan, T.N., Ngo, C.N., Ngo, N.N.M.: An open design privacy-enhancing platform supporting location-based applications. In: ICUIMC, pp. 1\u201310 (2012)","DOI":"10.1145\/2184751.2184824"},{"issue":"1","key":"11_CR4","first-page":"78","volume":"18","author":"H. Hu","year":"2006","unstructured":"Hu, H., Lee, D.L.: Range Nearest-Neighbor Query. IEEE TKDE\u00a018(1), 78\u201391 (2006)","journal-title":"IEEE TKDE"},{"issue":"12","key":"11_CR5","first-page":"1719","volume":"19","author":"P. Kalnis","year":"2007","unstructured":"Kalnis, P., Ghinita, G., Mouratidis, K., Papadias, D.: Preventing Location-Based Identity Inference in Anonymous Spatial Queries. IEEE TKDE\u00a019(12), 1719\u20131733 (2007)","journal-title":"IEEE TKDE"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Ardagna, C.A., Cremonini, M., Damiani, E., Vimercati, S.D.C., Samarati, P.: Location privacy protection through obfuscation-based techniques. In: DBSec, pp. 47\u201360 (2007)","DOI":"10.1007\/978-3-540-73538-0_4"},{"issue":"4","key":"11_CR7","first-page":"65","volume":"2","author":"Q.C. Truong","year":"2010","unstructured":"Truong, Q.C., Truong, T.A., Dang, T.K.: The Memorizing Algorithm: Protecting User Privacy in Location-Based Services using Historical Services Information. IJMCMC\u00a02(4), 65\u201386 (2010)","journal-title":"IJMCMC"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Chow, C., Mokbel, M.F., Aref, W.G.: Casper*: Query processing for location services without compromising privacy. ACM TODS, 1\u201348 (2009)","DOI":"10.1145\/1620585.1620591"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Duckham, M., Kulik, L.: A formal model of obfuscation and negotiation for location privacy. In: PerCom, pp. 243\u2013251 (2005)","DOI":"10.1007\/11428572_10"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.17562\/PB-46-9","volume":"46","author":"T.K. Dang","year":"2012","unstructured":"Dang, T.K., Truong, T.A.: Anonymizing but Deteriorating Location Databases. POLIBITS\u00a046, 73\u201381 (2012)","journal-title":"POLIBITS"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23088-2_20","volume-title":"Database and Expert Systems Applications","author":"A.T. Truong","year":"2011","unstructured":"Truong, A.T., Dang, T.K., K\u00fcng, J.: On Guaranteeing k-Anonymity in Location Databases. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part I. LNCS, vol.\u00a06860, pp. 280\u2013287. Springer, Heidelberg (2011)"},{"issue":"2","key":"11_CR12","first-page":"123","volume":"3","author":"M.L. Damiani","year":"2010","unstructured":"Damiani, M.L., Bertino, E., Silvestri, C.: The PROBE Framework for the Personalized Cloaking of Private Locations. TDP\u00a03(2), 123\u2013148 (2010)","journal-title":"TDP"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"ICT-EurAsia","author":"T.T.B. Le","year":"2013","unstructured":"Le, T.T.B., Dang, T.K.: Semantic-Aware Obfuscation for Location Privacy at Database Level. In: Mustofa, K., Neunold, E., Tjoa, A M., Weippl, E., You, I. (eds.) ICT-EurAsia 2013. LNCS, vol.\u00a07804, pp. 111\u2013120. Springer, Heidelberg (2013)"},{"key":"11_CR14","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-20039-7_11","volume-title":"Intelligent Information and Database Systems","author":"Q.C. To","year":"2011","unstructured":"To, Q.C., Dang, T.K., K\u00fcng, J.: Bob-Tree: An Efficient B\u2009+\u2009-Tree Based Index Structure for Geographic-Aware Obfuscation. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011. LNCS (LNAI), vol.\u00a06591, pp. 109\u2013118. Springer, Heidelberg (2011)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"To, Q.C., Dang, T.K., K\u00fcng, J.: A Hilbert-based Framework for Preserving Privacy in Location-based Services. In: IJIIDS (2013)","DOI":"10.1504\/IJIIDS.2013.053546"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Phan, T.N., Dang, T.K.: A Novel Trajectory Privacy-Preserving Future Time Index Structure in Moving Object Databases. In: ICCCI, pp. 124\u2013134 (2012)","DOI":"10.1007\/978-3-642-34630-9_13"}],"container-title":["Lecture Notes in Computer Science","Information and Communicatiaon Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36818-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T14:01:34Z","timestamp":1557583294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36818-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368172","9783642368189"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36818-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}