{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:40:23Z","timestamp":1743104423958,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030639235"},{"type":"electronic","value":"9783030639242"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-63924-2_10","type":"book-chapter","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T23:23:20Z","timestamp":1605828200000},"page":"169-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Norm-Based Locality Measures of 2-Dimensional Discrete Hilbert Curves"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. C.","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"unstructured":"Alber, J.: Locality properties of discrete space-filling curves: results with relevance for computer science. Studienarbeit Universit\u00e4t T\u00fcbingen, Wilhelm-Schickard-Institut f\u00fcr Informatik (1997). (in German)","key":"10_CR1"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002240010003","volume":"33","author":"J Alber","year":"2000","unstructured":"Alber, J., Niedermeier, R.: On multi-dimensional curves with Hilbert property. Theory Comput. Syst. 33(4), 295\u2013312 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00259-9","volume":"181","author":"T Asano","year":"1997","unstructured":"Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmayer, P.: Space-filling curves and their use in the design of geometric data structures. Theoret. Comput. Sci. 181(1), 3\u201315 (1997)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Bader, M.: Space-Filling Curves - An Introduction with Applications in Scientific Computing. Texts in Computational Science and Engineering, vol. 9. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-31046-1","key":"10_CR4","DOI":"10.1007\/978-3-642-31046-1"},{"doi-asserted-by":"crossref","unstructured":"Ban, X., Goswami, M., Zeng, W., Gu, X., Gao, J.: Topology dependent space filling curves for sensor networks and applications. In: Proceedings of the IEEE INFOCOM 2013, Turin, Italy, 14\u201319 April 2013, pp. 2166\u20132174. IEEE (2013)","key":"10_CR5","DOI":"10.1109\/INFCOM.2013.6567019"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11006-006-0182-8","volume":"80","author":"KE Bauman","year":"2006","unstructured":"Bauman, K.E.: The dilation factor of the Peano-Hilbert curve. Math. Notes 80(5), 609\u2013620 (2006)","journal-title":"Math. Notes"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces \u2013 index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.is.2003.12.002","volume":"30","author":"H-L Chen","year":"2005","unstructured":"Chen, H.-L., Chang, Y.-I.: Neighbor-finding based on space-filling curves. Inf. Syst. 30(3), 205\u2013226 (2005)","journal-title":"Inf. Syst."},{"unstructured":"Chochia, G., Cole, M., Heywood, T.: Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments. In: Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, Washington, D.C., USA, pp. 587\u2013595. IEEE Computer Society, October 1995","key":"10_CR9"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-24587-2_40","volume-title":"Algorithms and Computation","author":"HK Dai","year":"2003","unstructured":"Dai, H.K., Su, H.C.: On the locality properties of space-filling curves. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 385\u2013394. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_40"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-41168-2_2","volume-title":"Algorithmic Aspects in Information and Management","author":"HK Dai","year":"2016","unstructured":"Dai, H.K., Su, H.C.: Norm-based locality measures of two-dimensional Hilbert curves. In: Dondi, R., Fertin, G., Mauri, G. (eds.) AAIM 2016. LNCS, vol. 9778, pp. 14\u201325. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41168-2_2"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/83.499920","volume":"5","author":"C Gotsman","year":"1996","unstructured":"Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Trans. Image Process. 5(5), 794\u2013797 (1996)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/M-PDT.1995.414844","volume":"3","author":"M Kaddoura","year":"1995","unstructured":"Kaddoura, M., Ou, C.-W., Ranka, S.: Partitioning unstructured computational graphs for non-uniform and adaptive environments. IEEE Parallel Distrib. Technol. 3(3), 63\u201369 (1995)","journal-title":"IEEE Parallel Distrib. Technol."},{"unstructured":"Lawder, J.K.: The application of space-filling curves to the storage and retrieval of multi-dimensional data. Ph.D. thesis, Birkbeck College, University of London, December 1999","key":"10_CR15"},{"doi-asserted-by":"publisher","unstructured":"Lempel, A., Ziv, J.: Compression of two-dimensional images. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words, SI Series, vol. F12, pp. 141\u2013156. Springer, Heidelberg (1984.) https:\/\/doi.org\/10.1007\/978-3-642-82456-2_10","key":"10_CR16","DOI":"10.1007\/978-3-642-82456-2_10"},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0607063","volume":"7","author":"G Mitchison","year":"1986","unstructured":"Mitchison, G., Durbin, R.: Optimal numberings of an $${N} \\times {N}$$ array. SIAM J. Algebraic Discrete Methods 7(4), 571\u2013582 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowl. Data Eng. 13(1), 124\u2013141 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\u20133","key":"10_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0166-218X(00)00326-7","volume":"117","author":"R Niedermeier","year":"2002","unstructured":"Niedermeier, R., Reinhardt, K., Sanders, P.: Towards optimal locality in mesh-indexings. Discrete Appl. Math. 117(1\u20133), 211\u2013237 (2002)","journal-title":"Discrete Appl. Math."},{"unstructured":"P\u00e9rez, A., Kamata, S., Kawaguchi, E.: Peano scanning of arbitrary size images. In: Proceedings of the International Conference on Pattern Recognition, pp. 565\u2013568. IEEE Computer Society (1992)","key":"10_CR20"},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"LK Platzman","year":"1989","unstructured":"Platzman, L.K., Bartholdi III, J.J.: Spacefilling curves and the planar travelling salesman problem. J. ACM 36(4), 719\u2013737 (1989)","journal-title":"J. ACM"},{"key":"10_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-Filling Curves","author":"H Sagan","year":"1994","unstructured":"Sagan, H.: Space-Filling Curves. Springer, New York (1994). https:\/\/doi.org\/10.1007\/978-1-4612-0871-6"},{"doi-asserted-by":"crossref","unstructured":"Voorhies, D.: Space-filling curves and a measure of coherence. In: Arvo, J. (ed.) Graphics Gems II, pp. 26\u201330. Academic Press (1991)","key":"10_CR23","DOI":"10.1016\/B978-0-08-050754-5.50018-9"},{"issue":"3","key":"10_CR24","first-page":"22:1","volume":"12","author":"H Wang","year":"2016","unstructured":"Wang, H., Jiang, C., Dong, Y.: Connectivity-based space filling curve construction algorithms in high genus 3D surface WSNs. ACM Trans. Sensor Netw. 12(3), 22:1\u201322:29 (2016)","journal-title":"ACM Trans. Sensor Netw."},{"doi-asserted-by":"crossref","unstructured":"Xu, P., Tirthapura, S.: A lower bound on proximity preservation by space filling curves. In: IPDPS 2012 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp. 1295\u20131305, May 2012","key":"10_CR25","DOI":"10.1109\/IPDPS.2012.118"}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63924-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T01:18:08Z","timestamp":1619227088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-63924-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030639235","9783030639242"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63924-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quy Nhon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.thefdse.org\/","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":"161","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":"53","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":"8","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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.5 avg. reviewers\/paper (for two submission rounds in total). LNCS 12466 includes 24 of the accepted papers and 2 invited keynotes. CCIS 1306 includes 29 full and 8 short of the accepted papers. The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}