{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:02:38Z","timestamp":1780941758677,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031124228","type":"print"},{"value":"9783031124235","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12423-5_26","type":"book-chapter","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T17:03:28Z","timestamp":1659027808000},"page":"336-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Learned Prefix Bloom Filter for\u00a0Spatial Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3542-1097","authenticated-orcid":false,"given":"Beiji","family":"Zou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6316-8765","authenticated-orcid":false,"given":"Meng","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8825-0992","authenticated-orcid":false,"given":"Chengzhang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"issue":"14","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.14778\/2556549.2556556","volume":"6","author":"K Alexiou","year":"2013","unstructured":"Alexiou, K., Kossmann, D., Larson, P.: Adaptive range filters for cold data: avoiding trips to siberia. Proc. VLDB Endow. 6(14), 1714\u20131725 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithmics 16 (2011)","DOI":"10.1145\/1963190.2025378"},{"issue":"7","key":"26_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A.: Bloofi: a hierarchical bloom filter index with applications to distributed data provenance. In: 2nd International Workshop on Cloud Intelligence, ACM VLDB 2013, pp. 4:1\u20134:8 (2013)","DOI":"10.1145\/2501928.2501931"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.is.2015.01.002","volume":"54","author":"A Crainiceanu","year":"2015","unstructured":"Crainiceanu, A., Lemire, D.: Bloofi: multidimensional bloom filters. Inf. Syst. 54, 311\u2013324 (2015)","journal-title":"Inf. Syst."},{"key":"26_CR6","unstructured":"Dai, Z., Shrivastava, A.: Adaptive learned bloom filter (ada-bf): efficient utilization of the classifier with application to real-time information filtering on the web. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020 (2020)"},{"key":"26_CR7","unstructured":"Davitkova, A., Gjurovski, D., Michel, S.: Compressing (multidimensional) learned bloom filters. In: Workshop on ML for Systems at NeurIPS 2021 (2021)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1109\/TIP.2021.3055617","volume":"30","author":"Y Ding","year":"2021","unstructured":"Ding, Y., Ma, Z., Wen, S., Xie, J., Chang, D., Si, Z., Wu, M., Ling, H.: AP-CNN: weakly supervised attention pyramid convolutional neural network for fine-grained visual classification. IEEE Trans. Image Process. 30, 2826\u20132836 (2021)","journal-title":"IEEE Trans. Image Process."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, CoNEXT 2014, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw. 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Guo, D., Wu, J., Chen, H., Luo, X.: Theory and network applications of dynamic bloom filters. In: 25th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2006 (2006)","DOI":"10.1109\/INFOCOM.2006.325"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Trans. Knowl. Data Eng. 22(1), 120\u2013133 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD 2018, pp. 489\u2013504. ACM (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Li, S., Li, W., Cook, C., Zhu, C., Gao, Y.: Independently recurrent neural network (indrnn): building a longer and deeper RNN. In: 2018 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2018, pp. 5457\u20135466 (2018)","DOI":"10.1109\/CVPR.2018.00572"},{"key":"26_CR15","unstructured":"Macke, S., Beutel, A., Kraska, T., Sathiamoorthy, M., Cheng, D.Z., Chi, E.H.: Lifting the curse of multidimensional data with learned existence indexes. In: Workshop on ML for Systems at NeurIPS 2018 (2018)"},{"key":"26_CR16","unstructured":"Mitzenmacher, M.: A model for learned bloom filters and optimizing by sandwiching. In: Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, pp. 462\u2013471 (2018)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Aref, W.G.: Space-Filling Curves, Encyclopedia of GIS, pp. 1068\u20131072. (2008)","DOI":"10.1007\/978-0-387-35973-1_1233"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Natekin, A., Knoll, A.: Gradient boosting machines, a tutorial. Front. Neurorobotics 7 (2013)","DOI":"10.3389\/fnbot.2013.00021"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Nayak, S., Patgiri, R.: countbf: a general-purpose high accuracy and space efficient counting bloom filter. In: 17th International Conference on Network and Service Management, CNSM 2021, Izmir, pp. 355\u2013359. IEEE (2021)","DOI":"10.23919\/CNSM52442.2021.9615556"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.jnca.2019.03.004","volume":"136","author":"R Patgiri","year":"2019","unstructured":"Patgiri, R., Nayak, S., Borgohain, S.K.: RDBF: a r-dimensional bloom filter for massive scale membership query. J. Netw. Comput. Appl. 136, 100\u2013113 (2019)","journal-title":"J. Netw. Comput. Appl."},{"key":"26_CR21","unstructured":"Rae, J.W., Bartunov, S., Lillicrap, T.P.: Meta-learning neural bloom filters. In: Proceedings of the 36th International Conference on Machine Learning, ICML 2019, vol. 97, pp. 5271\u20135280 (2019)"},{"key":"26_CR22","unstructured":"Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-tree into a database system kernel. In: Proceedings of 26th International Conference on Very Large Data Bases, VLDB 2000, pp. 263\u2013272 (2000)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Wu, Y., et al.: Elastic bloom filter: deletable and expandablefilter using elastic fingerprints. IEEE Trans. Comput. 71, 1 (2021)","DOI":"10.1109\/TC.2021.3067713"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Xie, K., Min, Y., Zhang, D., Wen, J., Xie, G.: A scalable bloom filter for membership queries. In: Proceedings of the Global Communications Conference, GLOBECOM 2007, pp. 543\u2013547. IEEE (2007)","DOI":"10.1109\/GLOCOM.2007.107"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, S., Ray, S., Lu, R., Zheng, Y.: SPRIG: a learned spatial index for range and KNN queries. In: Proceedings of the 17th International Symposium on Spatial and Temporal Databases, ACM SSTD 2021, pp. 96\u2013105 (2021)","DOI":"10.1145\/3469830.3470892"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12423-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:01:44Z","timestamp":1710360104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12423-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031124228","9783031124235"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12423-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2022","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"43","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":"20","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":"36% - 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":"5","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Mixed review process- Single and double blind","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}