{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:05:51Z","timestamp":1743030351693,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708079"},{"type":"electronic","value":"9789819708086"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0808-6_1","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:02:20Z","timestamp":1708963340000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EQFF: An Efficient Query Method Using Feature Fingerprints"],"prefix":"10.1007","author":[{"given":"Xiaolei","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Yuelin","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Shan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Shuai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"1_CR1","unstructured":"Reinsel, D., Gantz, J., Rydning, J.: Data age 2025: the evolution of data to life-critical. In: Don\u2019t Focus on Big Data, vol. 2 (2017)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.neucom.2019.11.041","volume":"384","author":"B Aba","year":"2020","unstructured":"Aba, B., Ad, C., Yca, D.: A review of privacy-preserving techniques for deep learning. Neurocomputing 384, 21\u201345 (2020)","journal-title":"Neurocomputing"},{"key":"1_CR3","unstructured":"Wu, J.: Dynamic similarity queries on encrypted data. Ph.D. thesis, Xidian University (2019)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, K., et al.: Secure $$k$$ k-nn query on encrypted cloud data with multiple keys. IEEE Trans. Big Data 7(4), 689\u2013702 (2017)","DOI":"10.1109\/TBDATA.2017.2707552"},{"issue":"5","key":"1_CR5","first-page":"7","volume":"44","author":"H He","year":"2017","unstructured":"He, H., Xia, W., Zhang, J., Jin, Y., Li, P.: A fuzzy multi-keyword retrieval scheme for ciphertext data in cloud environment. Comput. Sci. 44(5), 7 (2017)","journal-title":"Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, Burton, H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","DOI":"10.1145\/362686.362692"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Reviriego, P., Sanchez-Macian, A., Walzer, S., Merino-Gomez, E., Liu, S., Lombardi, F.: On the privacy of counting bloom filters. IEEE Trans. Depend. Secure Comput. 20(2), 1488\u20131499 (2023). https:\/\/doi.org\/10.1109\/TDSC.2022.3158469","DOI":"10.1109\/TDSC.2022.3158469"},{"issue":"7","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/TIFS.2018.2799486","volume":"13","author":"L Calderoni","year":"2018","unstructured":"Calderoni, L., Palmieri, P., Maio, D.: Probabilistic properties of the spatial bloom filters and their relevance to cryptographic protocols. IEEE Trans. Inf. Forensics Secur. 13(7), 1710\u20131721 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2799486","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Miao, Y., et al.: Efficient privacy-preserving spatial range query over outsourced encrypted data. IEEE Trans. Inf. Forensics Secur. 18, 3921\u20133933 (2023). https:\/\/doi.org\/10.1109\/TIFS.2023.3288453","DOI":"10.1109\/TIFS.2023.3288453"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10207-015-0299-4","volume":"15","author":"A Malhi","year":"2016","unstructured":"Malhi, A., Batra, S.: Privacy-preserving authentication framework using bloom filter for secure vehicular communications. Int. J. Inf. Secur. 15(4), 433\u2013453 (2016)","journal-title":"Int. J. Inf. Secur."},{"key":"1_CR11","unstructured":"Many, D., Burkhart, M., Dimitropoulos, X.: Fast private set operations with sepia. ETZ G93 (2012)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2636328","volume":"47","author":"C B\u00f6sch","year":"2014","unstructured":"B\u00f6sch, C., Hartel, P., Jonker, W., Peter, A.: A survey of provably secure searchable encryption. ACM Comput. Surv. 47(2), 1\u201351 (2014)","journal-title":"ACM Comput. Surv."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ram, P., Sinha, K.: Revisiting KD-tree for nearest neighbor search. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1378\u20131388 (2019)","DOI":"10.1145\/3292500.3330875"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-30079-3_30","volume":"04","author":"ZF Wang","year":"2004","unstructured":"Wang, Z.F., Jing, D., Wei, W., Shi, B.L.: Fast query over encrypted character data in database. Lect. Notes Comput. Sci. 04(4), 289\u2013300 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"21","key":"1_CR15","doi-asserted-by":"publisher","first-page":"16153","DOI":"10.1109\/JIOT.2020.3016297","volume":"8","author":"Q Wang","year":"2020","unstructured":"Wang, Q., Guo, Y., Yu, L., Chen, X., Li, P.: Deep q-network-based feature selection for multisourced data cleaning. IEEE Internet Things J. 8(21), 16153\u201316164 (2020)","journal-title":"IEEE Internet Things J."},{"issue":"02","key":"1_CR16","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1142\/S0219622021500188","volume":"20","author":"K Rahul","year":"2021","unstructured":"Rahul, K., Banyal, R.K.: Detection and correction of abnormal data with optimized dirty data: a new data cleaning model. Int. J. Inf. Technol. Decis. Mak. 20(02), 809\u2013841 (2021)","journal-title":"Int. J. Inf. Technol. Decis. Mak."},{"issue":"20","key":"1_CR17","doi-asserted-by":"publisher","first-page":"9554","DOI":"10.3390\/app11209554","volume":"11","author":"J Ni","year":"2021","unstructured":"Ni, J., Cai, Y., Tang, G., Xie, Y.: Collaborative filtering recommendation algorithm based on tf-idf and user characteristics. Appl. Sci. 11(20), 9554 (2021)","journal-title":"Appl. Sci."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Xiang, L.: Application of an improved TF-IDF method in literary text classification. Adv. Multim. (2022)","DOI":"10.1155\/2022\/9285324"},{"issue":"4","key":"1_CR19","first-page":"12","volume":"16","author":"JS Yu","year":"2002","unstructured":"Yu, J.S., Yu, S.W.: The structure of Chinese concept dictionary. J. Chin. Inf. Process. 16(4), 12\u201320 (2002)","journal-title":"J. Chin. Inf. Process."},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s11063-018-9838-0","volume":"49","author":"L Zhang","year":"2019","unstructured":"Zhang, L., Lu, X.: Feature extraction based on support vector data description. Neural Process. Lett. 49(2), 643\u2013659 (2019)","journal-title":"Neural Process. Lett."},{"key":"1_CR21","first-page":"1","volume":"2021","author":"B Li","year":"2021","unstructured":"Li, B., Wang, J., Liu, X.: Parallel cleaning algorithm for similar duplicate Chinese data based on Bert. Sci. Program. 2021, 1\u201311 (2021)","journal-title":"Sci. Program."},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Yang, C., Deng, D., Shang, S., Shao, L.: Efficient locality-sensitive hashing over high-dimensional data streams. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1986\u20131989 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00220","DOI":"10.1109\/ICDE48307.2020.00220"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Zezula, P.: Scalable similarity search for big data: challenges and research objectives. In: Jung, J.J., Badica, C., Kiss, A. (eds.) INFOSCALE 2014, LNICST, vol. 139, pp. 3\u201312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16868-5_1","DOI":"10.1007\/978-3-319-16868-5_1"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Reviriego, P., S\u00e1nchez-Macian, A., Walzer, S., Merino-G\u00f3mez, E., Liu, S., Lombardi, F.: On the privacy of counting bloom filters. IEEE Trans. Depend. Secure Comput. 20(2), 1488\u20131499 (2023). https:\/\/doi.org\/10.1109\/TDSC.2022.3158469","DOI":"10.1109\/TDSC.2022.3158469"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Qi, X., et al.: Mlrsnet: a multi-label high spatial resolution remote sensing dataset for semantic scene understanding. ISPRS J. Photogramm. Remote Sens. 169, 337\u2013350 (2020)","DOI":"10.1016\/j.isprsjprs.2020.09.020"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0808-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:03:05Z","timestamp":1708963385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0808-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708079","9789819708086"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0808-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}