{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:48:54Z","timestamp":1774291734404,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200103136"],"award-info":[{"award-number":["DP200103136"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,12,15]]},"DOI":"10.1145\/3572960.3572984","type":"proceedings-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T15:02:32Z","timestamp":1680793352000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Immediate-Access Indexing Using Space-Efficient Extensible Arrays"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6638-0232","authenticated-orcid":false,"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[{"name":"School of Computing and Information Systems, The University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"additional","affiliation":[{"name":"School of Information Technology and Electrical Engineering, The University of Queensland, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,4,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48447-7_4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99736-6_11"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3166072.3166080"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10268"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-38851-9_12"},{"issue":"3","key":"e_1_3_2_1_7_1","first-page":"19","article-title":"Efficient on-line index construction for text databases","volume":"33","author":"Lester A.","unstructured":"[ 7 ] N.\u00a0 Lester , A. \u00a0Moffat, and J. \u00a0 Zobel . Efficient on-line index construction for text databases . ACM Trans. Data. Sys. , 33 ( 3 ): 19 .1\u201319.33, 2008. [7] N.\u00a0Lester, A.\u00a0Moffat, and J.\u00a0Zobel. Efficient on-line index construction for text databases. ACM Trans. Data. Sys., 33(3):19.1\u201319.33, 2008.","journal-title":"ACM Trans. Data. Sys."},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient immediate-access indexing. arXiv:2211.06030","author":"Moffat J.","year":"2022","unstructured":"[ 8 ] A.\u00a0 Moffat and J. \u00a0Mackenzie. Efficient immediate-access indexing. arXiv:2211.06030 , 2022 . [8] A.\u00a0Moffat and J.\u00a0Mackenzie. Efficient immediate-access indexing. arXiv:2211.06030, 2022."},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithm alley: HATs: Hashed array trees: Fast variable-length arrays. Dr. Dobb\u2019s J., 21(11)","author":"Sitarski","year":"1996","unstructured":"[ 9 ] E.\u00a0 Sitarski . Algorithm alley: HATs: Hashed array trees: Fast variable-length arrays. Dr. Dobb\u2019s J., 21(11) , 1996 . URL http:\/\/www.drdobbs.com\/database\/algorithm-alley\/184409965. [9] E.\u00a0Sitarski. Algorithm alley: HATs: Hashed array trees: Fast variable-length arrays. Dr. Dobb\u2019s J., 21(11), 1996. URL http:\/\/www.drdobbs.com\/database\/algorithm-alley\/184409965."},{"key":"e_1_3_2_1_10_1","volume-title":"Optimal resizable arrays. arXiv:2211.11009","author":"Tarjan U.","year":"2022","unstructured":"[ 10 ] R.\u00a0E. Tarjan and U. \u00a0Zwick. Optimal resizable arrays. arXiv:2211.11009 , 2022 . [10] R.\u00a0E. Tarjan and U.\u00a0Zwick. Optimal resizable arrays. arXiv:2211.11009, 2022."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"ADCS '22: Australasian Document Computing Symposium","location":"Adelaide SA Australia","acronym":"ADCS '22"},"container-title":["Proceedings of the 26th Australasian Document Computing Symposium"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572960.3572984","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572960.3572984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:39Z","timestamp":1750182699000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572960.3572984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,15]]},"references-count":10,"alternative-id":["10.1145\/3572960.3572984","10.1145\/3572960"],"URL":"https:\/\/doi.org\/10.1145\/3572960.3572984","relation":{},"subject":[],"published":{"date-parts":[[2022,12,15]]},"assertion":[{"value":"2023-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}