{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:22:00Z","timestamp":1742941320519,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819982950"},{"type":"electronic","value":"9789819982967"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8296-7_4","type":"book-chapter","created":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T00:04:14Z","timestamp":1700179454000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maintenance Algorithms for 0-Complete Trees with\u00a0Improved Space Utilization"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Furusawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,17]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Dai, H.K., Furusawa, K.: Improving the storage utilization of $$0$$-complete trees as index structures. In: Dang, T.K., Kung, J., Chung, T.M. (eds.) Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications. FDSE 2022. CCIS, vol. 1688, pp. 88\u2013102 Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-19-8069-5_6","DOI":"10.1007\/978-981-19-8069-5_6"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Dai, H.K., Furusawa, K.: On the storage utilization of $$0$$-complete trees as index structures. Computer Science Department, Oklahoma State University, Technical report TR-23-01, October 2023","DOI":"10.1007\/s42979-024-03268-4"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing \u2013 a fast access method for dynamic files. ACM Trans. Database Syst. 4(3), 315\u2013344 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"4_CR5","unstructured":"Folk, M.J., Zoellick, B.: File Structures, Second Edition. Addison-Wesley, Boston (1992)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E.: Many-way information retrieval. Commun. ACM 3, 490\u2013500 (1960)","journal-title":"Commun. ACM"},{"key":"4_CR7","unstructured":"Orlandic, R.: Design, analysis and applications of compact 0-complete trees. PhD thesis, Department of Computer Science, University of Virginia (1989)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/S0129054196000166","volume":"7","author":"R Orlandic","year":"1996","unstructured":"Orlandic, R., Mahmoud, H.M.: Storage overhead of O-trees, B-trees and prefix B-trees: a comparative analysis. Int. J. Found. Comput. Sci. 7(3), 209\u2013226 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR9","unstructured":"Orlandic, R., Pfaltz, J.L.: Compact 0-complete trees. In: Proceedings of the Fourteenth Conference on Very Large Databases, pp. 372\u2013381. Association for Computing Machinery and IEEE Computer Society, August 1988"},{"key":"4_CR10","unstructured":"Orlandic, R., Pfaltz, J.L.: Q$$_{0}$$-tree: a dynamic structure for accessing spatial objects with arbitrary shapes. Institute for Parallel Computation, University of Virginia, Technical Report IPC-TR-91-010, December 1991"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Orlandic, R., Pfaltz, J.L.: Compact 0-complete trees: a new method for searching large files. Institute for Parallel Computation, University of Virginia, Technical report IPC-TR-88-001, January 1988","DOI":"10.2172\/6231696"}],"container-title":["Communications in Computer and Information Science","Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8296-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T03:37:15Z","timestamp":1730518635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8296-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819982950","9789819982967"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8296-7_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 November 2023","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":"Da Nang","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"135","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":"38","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":"28% - 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":"6","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)"}}]}}