{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:49:49Z","timestamp":1762004989774,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602118"],"award-info":[{"award-number":["61602118"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00500-018-3145-6","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T11:53:21Z","timestamp":1521633201000},"page":"3111-3121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improving file locality in multi-keyword top-k search based on clustering"],"prefix":"10.1007","volume":"22","author":[{"given":"Lanxiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kuan-Ching","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shuibing","family":"He","sequence":"additional","affiliation":[]},{"given":"Linbing","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"3145_CR1","doi-asserted-by":"crossref","unstructured":"Asharov G, Naor M, Segev G, et al (2016) Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In: Proceedings of the international conference on ACM symposium on theory of computing, Cambridge, MA, USA, pp 1101\u20131114","DOI":"10.1145\/2897518.2897562"},{"issue":"1","key":"3145_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TPDS.2013.45","volume":"25","author":"N Cao","year":"2014","unstructured":"Cao N, Wang C, Li M et al (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222\u2013233","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3145_CR3","doi-asserted-by":"crossref","unstructured":"Cash D, Tessaro S (2014) The locality of searchable symmetric encryption. In: Proceedings of the international conference on the theory and applications of cryptographic techniques, Copenhagen, Denmark, pp 351\u2013368","DOI":"10.1007\/978-3-642-55220-5_20"},{"issue":"4","key":"3145_CR4","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/TPDS.2015.2425407","volume":"27","author":"C Chen","year":"2016","unstructured":"Chen C, Zhu X, Shen P et al (2016) An efficient privacy-preserving ranked keyword search method. IEEE Trans Parallel Distrib Syst 27(4):951\u2013963","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"16","key":"3145_CR5","doi-asserted-by":"publisher","first-page":"4829","DOI":"10.1007\/s00500-017-2684-6","volume":"21","author":"L Chen","year":"2017","unstructured":"Chen L, Qiu L, Li KC et al (2017) DMRS: an efficient dynamic multi-keyword ranked search over encrypted cloud data. Soft Comput 21(16):4829\u20134841","journal-title":"Soft Comput"},{"issue":"1","key":"3145_CR6","first-page":"179","volume":"19","author":"L Chen","year":"2018","unstructured":"Chen L, Qiu L, Li K-C, Zhou S (2018) A secure multi-keyword ranked search over encrypted cloud data against memory leakage attack. J Internet Technol 19(1):179\u2013188","journal-title":"J Internet Technol"},{"key":"3145_CR7","doi-asserted-by":"crossref","unstructured":"Curtmola R, Garay J, Kamara S, et al (2006) Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the international conference on ACM conference on computer and communications security, Alexandria, VA, USA, pp 79\u201388","DOI":"10.1145\/1180405.1180417"},{"key":"3145_CR8","doi-asserted-by":"crossref","unstructured":"Demertzis I, Papamanthou C (2017) Fast searchable encryption with tunable locality. In: Proceedings of the international conference ACM international conference on management of data, Chicago, Illinois, USA, pp 1053\u20131067","DOI":"10.1145\/3035918.3064057"},{"issue":"4","key":"3145_CR9","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.2140\/pjm.1962.12.1241","volume":"12","author":"DG Feingold","year":"1962","unstructured":"Feingold DG, Varga RS (1962) Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem. Pac J Math 12(4):1241\u20131250","journal-title":"Pac J Math"},{"issue":"5814","key":"3145_CR10","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972\u2013976","journal-title":"Science"},{"issue":"1","key":"3145_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1587\/transcom.E98.B.190","volume":"98","author":"Z Fu","year":"2015","unstructured":"Fu Z, Sun X, Liu Q, Zhou L, Shu J (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun 98(1):190\u2013200","journal-title":"IEICE Trans Commun"},{"issue":"3","key":"3145_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min Knowl Disc 2(3):283\u2013304","journal-title":"Data Min Knowl Disc"},{"key":"3145_CR13","doi-asserted-by":"crossref","unstructured":"Ishai Y, Kushilevitz E, Ostrovsky R (2006) Cryptography from anonymity. In: Proceedings of the international conference on foundations of computer science, Washington, DC, USA, pp 239\u2013248","DOI":"10.1109\/FOCS.2006.25"},{"key":"3145_CR14","doi-asserted-by":"crossref","unstructured":"Kamara S, Moataz T (2017) Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: Proceedings of the international conference on the theory and applications of cryptographic techniques, Paris, France, pp 94\u2013124","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"3145_CR15","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the international conference on Berkeley symposium on mathematical statistics and probability, California, USA, pp 281\u2013297"},{"key":"3145_CR16","doi-asserted-by":"crossref","unstructured":"Miers I, Mohassel P (2017) IO-DSSE: scaling dynamic searchable encryption to millions of indexes by improving locality. In: Proceedings of the international conference on network and distributed system security symposium, San Diego, California, pp 1\u201313","DOI":"10.14722\/ndss.2017.23394"},{"issue":"3","key":"3145_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/3064005","volume":"50","author":"GS Poh","year":"2017","unstructured":"Poh GS, Chin JJ, Yau WC et al (2017) Searchable symmetric encryption: designs and challenges. ACM Comput Surv 50(3):40","journal-title":"ACM Comput Surv"},{"key":"3145_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.future.2016.05.002","volume":"67","author":"J Wang","year":"2017","unstructured":"Wang J, Chen X, Li J et al (2017) Towards achieving flexible and verifiable search for outsourced database in cloud computing. Future Gener Comput Syst 67:266\u2013275","journal-title":"Future Gener Comput Syst"},{"key":"3145_CR19","doi-asserted-by":"crossref","unstructured":"Wang B, Yu S, Lou W, et al (2014) Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: Proceedings of the international conference on computer communications, Toronto, Canada, pp 2112\u20132120","DOI":"10.1109\/INFOCOM.2014.6848153"},{"key":"3145_CR20","volume-title":"Managing gigabytes: compressing and indexing documents and images","author":"IH Witten","year":"1999","unstructured":"Witten IH, Moffat A, Bell TC (1999) Managing gigabytes: compressing and indexing documents and images. Morgan Kaufmann Publishing, San Francisco"},{"issue":"2","key":"3145_CR21","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia Z, Wang X, Sun X et al (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3145_CR22","doi-asserted-by":"crossref","unstructured":"Zhu Y, Yu J, Jia C (2009) Initializing K-means clustering using affinity propagation. In: Proceedings of the international conference on hybrid intelligent systems, Shenyang, China, pp 338\u2013343","DOI":"10.1109\/HIS.2009.73"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3145-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3145-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3145-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T20:28:03Z","timestamp":1553113683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3145-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,21]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["3145"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3145-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,3,21]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}