{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:12:21Z","timestamp":1759133541027},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T00:00:00Z","timestamp":1435795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00500-015-1758-6","type":"journal-article","created":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T07:53:34Z","timestamp":1435737214000},"page":"4487-4495","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Enabling efficient approximate nearest neighbor search for outsourced database in cloud computing"],"prefix":"10.1007","volume":"20","author":[{"given":"Jianfeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meixia","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqian","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,2]]},"reference":[{"key":"1758_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Kiernan J, Srikant R, Xu Y (2004) Order preserving encryption for numeric data. In: Proceedings of the 2004 ACM SIGMOD international conference on Management of data, ACM, pp 563\u2013574","DOI":"10.1145\/1007568.1007632"},{"key":"1758_CR2","doi-asserted-by":"crossref","unstructured":"Athitsos V, Potamias M, Papapetrou P, Kollios G (2008) Nearest neighbor retrieval using distance-based hashing. In: IEEE 24th International Conference on Data Engineering, 2008. IEEE ICDE 2008, pp 327\u2013336","DOI":"10.1109\/ICDE.2008.4497441"},{"key":"1758_CR3","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Chenette N, Lee Y, Oneill A (2009) Order-preserving symmetric encryption. In: Advances in Cryptology-EUROCRYPT 2009, Springer, pp 224\u2013241","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"1758_CR4","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Chenette N, ONeill A (2011) Order-preserving encryption revisited: Improved security analysis and alternative solutions. In: Advances in Cryptology-CRYPTO 2011, Springer, pp 578\u2013595","DOI":"10.1007\/978-3-642-22792-9_33"},{"key":"1758_CR5","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the twentieth annual symposium on Computational geometry, ACM, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"issue":"3","key":"1758_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3):209\u2013226","journal-title":"ACM Trans Math Softw"},{"key":"1758_CR7","doi-asserted-by":"crossref","unstructured":"Gan J, Feng J, Fang Q, Ng W (2012) Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, ACM, pp 541\u2013552","DOI":"10.1145\/2213836.2213898"},{"key":"1758_CR8","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, ACM, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"1758_CR9","doi-asserted-by":"crossref","unstructured":"Jia Y, Wang J, Zeng G, Zha H, Hua XS (2010) Optimizing kd-trees for scalable visual descriptor indexing. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) IEEE, pp 3392\u20133399","DOI":"10.1109\/CVPR.2010.5540006"},{"key":"1758_CR10","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: The 1997 ACM SIGMOD international conference on Management of data, ACM, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"1758_CR11","doi-asserted-by":"crossref","unstructured":"Li J, Wang Q, Wang C, Cao N, Ren K, Lou W (2010) Fuzzy keyword search over encrypted data in cloud computing. In: 2010 Proceedings IEEE INFOCOM IEEE, pp 1\u20135","DOI":"10.1109\/INFCOM.2010.5462196"},{"issue":"4","key":"1758_CR12","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"KI Lin","year":"1994","unstructured":"Lin KI, Jagadish HV, Faloutsos C (1994) The tv-tree: an index structure for high-dimensional data. VLDB J 3(4):517\u2013542","journal-title":"VLDB J"},{"key":"1758_CR13","doi-asserted-by":"crossref","unstructured":"Liu Y, Cui J, Huang Z, Li H, Shen HT (2014) Sk-lsh: an efficient index structure for approximate nearest neighbor search. Proc VLDB Endow 7(9):745\u2013756","DOI":"10.14778\/2732939.2732947"},{"key":"1758_CR14","doi-asserted-by":"crossref","unstructured":"Lu W, Varna AL, Wu M (2010) Security analysis for privacy preserving search of multimedia. In: 2010 17th IEEE International Conference on Image Processing (ICIP), IEEE, pp 2093\u20132096","DOI":"10.1109\/ICIP.2010.5653399"},{"key":"1758_CR15","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K (2007) Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd international conference on Very large data bases, VLDB Endowment, pp 950\u2013961"},{"issue":"2","key":"1758_CR16","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S Meiser","year":"1993","unstructured":"Meiser S (1993) Point location in arrangements of hyperplanes. Inf Comput 106(2):286\u2013303","journal-title":"Inf Comput"},{"key":"1758_CR17","doi-asserted-by":"crossref","unstructured":"Nister D, Stewenius H (2006) Scalable recognition with a vocabulary tree. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, pp 2161\u20132168","DOI":"10.1109\/CVPR.2006.264"},{"key":"1758_CR18","doi-asserted-by":"crossref","unstructured":"Popa RA, Li FH, Zeldovich N (2013) An ideal-security protocol for order-preserving encoding. In: 2013 IEEE Symposium on Security and Privacy (SP), IEEE, pp 463\u2013477","DOI":"10.1109\/SP.2013.38"},{"key":"1758_CR19","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: ACM sigmod record. ACM, vol 24, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"1758_CR20","doi-asserted-by":"crossref","unstructured":"Shi E, Bethencourt J, Chan TH, Song D, Perrig A (2007) Multi-dimensional range query over encrypted data. In: IEEE Symposium on Security and Privacy, 2007. SP\u201907, IEEE, pp 350\u2013364","DOI":"10.1109\/SP.2007.29"},{"key":"1758_CR21","unstructured":"Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceedings 2000 IEEE Symposium on Security and Privacy IEEE, S&P 2000, pp 44\u201355"},{"key":"1758_CR22","doi-asserted-by":"crossref","unstructured":"Tao Y, Yi K, Sheng C, Kalnis P (2009) Quality and efficiency in high dimensional nearest neighbor search. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. ACM, pp 563\u2013576","DOI":"10.1145\/1559845.1559905"},{"issue":"3","key":"1758_CR23","first-page":"20","volume":"35","author":"Y Tao","year":"2010","unstructured":"Tao Y, Yi K, Sheng C, Kalnis P (2010) Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans Database Syst (TODS) 35(3):20","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"1758_CR24","doi-asserted-by":"crossref","unstructured":"Wang B, Yu S, Lou W, Hou YT (2014) Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: 2014 Proceedings IEEE INFOCOM","DOI":"10.1109\/INFOCOM.2014.6848153"},{"key":"1758_CR25","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/TPAMI.2013.125","volume":"36","author":"J Wang","year":"2014","unstructured":"Wang J, Wang N, Jia Y, Li J, Zeng G, Zha H, Hua XS (2014) Trinary-projection trees for approximate nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 36:388\u2013403","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1758_CR26","first-page":"194","volume":"98","author":"R Weber","year":"1998","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB 98:194\u2013205","journal-title":"VLDB"},{"key":"1758_CR27","first-page":"192","volume":"2012","author":"L Xiao","year":"2012","unstructured":"Xiao L, Yen IL, Huynh DT (2012) Extending order preserving encryption for multi-user systems. IACR Cryptol ePrint Arch 2012:192","journal-title":"IACR Cryptol ePrint Arch"},{"key":"1758_CR28","doi-asserted-by":"crossref","unstructured":"Yum DH, Kim DS, Kim JS, Lee PJ, Hong SJ (2012) Order-preserving encryption for non-uniformly distributed plaintexts. In: Information Security Applications. Springer, pp 84\u201397","DOI":"10.1007\/978-3-642-27890-7_7"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1758-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1758-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T18:06:00Z","timestamp":1566929160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1758-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,2]]},"references-count":28,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1758"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1758-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,2]]}}}