{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:36Z","timestamp":1773481956040,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T00:00:00Z","timestamp":1518220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1314590 and CCF-1533858"],"award-info":[{"award-number":["CCF-1314590 and CCF-1533858"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,2,10]]},"DOI":"10.1145\/3178487.3178509","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T13:12:23Z","timestamp":1517922743000},"page":"290-304","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["PAM"],"prefix":"10.1145","author":[{"given":"Yihan","family":"Sun","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Ferizovic","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy E.","family":"Belloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"263","article-title":"An Algorithm for the Organization of Information","volume":"145","author":"Adelson-Velsky Georgy","year":"1962","unstructured":"Georgy Adelson-Velsky and E. M. Landis . 1962 . An Algorithm for the Organization of Information . Proc. of the USSR Academy of Sciences 145 (1962), 263 -- 266 . In Russian, English translation by Myron J. Ricci in Soviet Doklady, 3:1259--1263, 1962. Georgy Adelson-Velsky and E. M. Landis. 1962. An Algorithm for the Organization of Information. Proc. of the USSR Academy of Sciences 145 (1962), 263--266. In Russian, English translation by Myron J. Ricci in Soviet Doklady, 3:1259--1263, 1962.","journal-title":"Proc. of the USSR Academy of Sciences"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902303"},{"key":"e_1_3_2_2_3_1","volume-title":"Fast Parallel Operations on Search Trees. arXiv preprint arXiv:1510.05433","author":"Akhremtsev Yaroslav","year":"2015","unstructured":"Yaroslav Akhremtsev and Peter Sanders . 2015. Fast Parallel Operations on Search Trees. arXiv preprint arXiv:1510.05433 ( 2015 ). Yaroslav Akhremtsev and Peter Sanders. 2015. Fast Parallel Operations on Search Trees. arXiv preprint arXiv:1510.05433 (2015)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835841"},{"key":"e_1_3_2_2_5_1","unstructured":"Flurry analytics. -. (-). https:\/\/developer.yahoo.com\/flurry\/docs\/analytics\/  Flurry analytics. -. (-). https:\/\/developer.yahoo.com\/flurry\/docs\/analytics\/"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1859184.1859192"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018761"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_2_9_1","volume-title":"Decomposable searching problems. Information processing letters 8, 5","author":"Bentley Jon Louis","year":"1979","unstructured":"Jon Louis Bentley . 1979. Decomposable searching problems. Information processing letters 8, 5 ( 1979 ), 244--251. Jon Louis Bentley. 1979. Decomposable searching problems. Information processing letters 8, 5 (1979), 244--251."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.12.010"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935768"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_2_14_1","volume-title":"Range Queries in Non-blocking k-ary Search Trees","author":"Brown Trevor","unstructured":"Trevor Brown and Hillel Avni . 2012. Range Queries in Non-blocking k-ary Search Trees . Springer Berlin Heidelberg , Berlin, Heidelberg , 31--45. Trevor Brown and Hillel Avni. 2012. Range Queries in Non-blocking k-ary Search Trees. Springer Berlin Heidelberg, Berlin, Heidelberg, 31--45."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann Publishers Inc.","author":"Chan Chee Yong","unstructured":"Chee Yong Chan and Yannis E. Ioannidis . 1999. Hierarchical Prefix Cubes for Range-Sum Queries . In Proc. International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann Publishers Inc. , San Francisco, CA, USA, 675--686. Chee Yong Chan and Yannis E. Ioannidis. 1999. Hierarchical Prefix Cubes for Range-Sum Queries. In Proc. International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 675--686."},{"key":"e_1_3_2_2_17_1","unstructured":"Rosetta Code.-. Inverted index. (-). https:\/\/rosettacode.org\/wiki\/Inverted_index  Rosetta Code.-. Inverted index. (-). https:\/\/rosettacode.org\/wiki\/Inverted_index"},{"key":"e_1_3_2_2_18_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms (second edition). MIT Press and McGraw-Hill.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms (second edition). MIT Press and McGraw-Hill."},{"key":"e_1_3_2_2_19_1","unstructured":"Costin S. 2012. C# based interval tree. https:\/\/code.google.com\/archive\/p\/intervaltree. (2012).  Costin S. 2012. C# based interval tree. https:\/\/code.google.com\/archive\/p\/intervaltree. (2012)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555269"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12142"},{"key":"e_1_3_2_2_23_1","volume-title":"Dynamic Rectangle Intersrction Searching","author":"Edelsbrunner Herbert","unstructured":"Herbert Edelsbrunner . 1980. Dynamic Rectangle Intersrction Searching . Technical Report Institute for Technical Processing Report 47. Technical University of Graz , Austria. Herbert Edelsbrunner. 1980. Dynamic Rectangle Intersrction Searching. Technical Report Institute for Technical Processing Report 47. Technical University of Graz, Austria."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_10"},{"key":"e_1_3_2_2_25_1","volume-title":"Computational geometry: an introduction","author":"Franco Preparata","unstructured":"Preparata Franco and Michael Ian Preparata Shamos . 1985. Computational geometry: an introduction . Springer Science & Business Media . Preparata Franco and Michael Ian Preparata Shamos. 1985. Computational geometry: an introduction. Springer Science & Business Media."},{"key":"e_1_3_2_2_26_1","volume-title":"Parallelization of Bulk Operations for STL Dictionaries. In Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007. 49--58","author":"Frias Leonor","year":"2007","unstructured":"Leonor Frias and Johannes Singler . 2007 . Parallelization of Bulk Operations for STL Dictionaries. In Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007. 49--58 . Leonor Frias and Johannes Singler. 2007. Parallelization of Bulk Operations for STL Dictionaries. In Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007. 49--58."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-005-0345-1"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726021843"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_2_30_1","unstructured":"Chaim-Leib Halbet and Konstantin Tretyakov. 2015. Python based interval tree. https:\/\/github.com\/chaimleib\/intervaltree. (2015).  Chaim-Leib Halbet and Konstantin Tretyakov. 2015. Python based interval tree. https:\/\/github.com\/chaimleib\/intervaltree. (2015)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253274"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/319838.319876"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.03.015"},{"key":"e_1_3_2_2_35_1","volume-title":"Proc. International Conference on Very Large Data Bases (VLDB). 407--418","author":"Kriegel Hans-Peter","year":"2000","unstructured":"Hans-Peter Kriegel , Marco P\u00f6tke , and Thomas Seidl . 2000 . Managing Intervals Efficiently in Object-Relational Databases . In Proc. International Conference on Very Large Data Bases (VLDB). 407--418 . Hans-Peter Kriegel, Marco P\u00f6tke, and Thomas Seidl. 2000. Managing Intervals Efficiently in Object-Relational Databases. In Proc. International Conference on Very Large Data Bases (VLDB). 407--418."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1705"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_3_2_2_41_1","unstructured":"LevelDB. -. (-). leveldb.org  LevelDB. -. (-). leveldb.org"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_2_43_1","volume-title":"Mark Overmars, and Otfried Cheong Schwarzkopf.","author":"Berg Mark Mark De","year":"2000","unstructured":"Mark De Berg Mark , Mark Van Kreveld , Mark Overmars, and Otfried Cheong Schwarzkopf. 2000 . Computational Geometry. Springer . Mark De Berg Mark, Mark Van Kreveld, Mark Overmars, and Otfried Cheong Schwarzkopf. 2000. Computational Geometry. Springer."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"e_1_3_2_2_45_1","volume-title":"STL tutorial and reference guide: C+ + programming with the standard template library","author":"Musser David R","unstructured":"David R Musser , Gillmer J Derge , and Atul Saini . 2009. STL tutorial and reference guide: C+ + programming with the standard template library . Addison-Wesley Professional . David R Musser, Gillmer J Derge, and Atul Saini. 2009. STL tutorial and reference guide: C+ + programming with the standard template library. Addison-Wesley Professional."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_2_47_1","unstructured":"Gabriele Neyer. 2017. dD Range and Segment Trees. In CGAL User and Reference Manual (4.10 ed.). CGAL Editorial Board. http:\/\/doc.cgal.org\/4.10\/Manual\/packages.html#PkgRangeSegmentTreesDSummary  Gabriele Neyer. 2017. dD Range and Segment Trees. In CGAL User and Reference Manual (4.10 ed.). CGAL Editorial Board. http:\/\/doc.cgal.org\/4.10\/Manual\/packages.html#PkgRangeSegmentTreesDSummary"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"e_1_3_2_2_49_1","volume-title":"Purely functional data structures","author":"Okasaki Chris","unstructured":"Chris Okasaki . 1999. Purely functional data structures . Cambridge University Press . Chris Okasaki. 1999. Purely functional data structures. Cambridge University Press."},{"key":"e_1_3_2_2_50_1","unstructured":"Oracle. -. Oracle NoSQL. (-). https:\/\/www.oracle.com\/database\/nosql\/index.html  Oracle. -. Oracle NoSQL. (-). https:\/\/www.oracle.com\/database\/nosql\/index.html"},{"key":"e_1_3_2_2_51_1","volume-title":"Applied computational geometry towards geometric engineering","author":"Overmars Mark H","unstructured":"Mark H Overmars . 1996. Designing the computational geometry algorithms library CGAL . In Applied computational geometry towards geometric engineering . Springer , 53--58. Mark H Overmars. 1996. Designing the computational geometry algorithms library CGAL. In Applied computational geometry towards geometric engineering. Springer, 53--58."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00287-5"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/646237.683018"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1352079.1352134"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145836"},{"key":"e_1_3_2_2_56_1","volume-title":"Mining of Massive Datasets","author":"Rajaraman Anand","unstructured":"Anand Rajaraman and Jeffrey David Ullman . 2011. Mining of Massive Datasets :. Cambridge University Press . Anand Rajaraman and Jeffrey David Ullman. 2011. Mining of Massive Datasets:. Cambridge University Press."},{"key":"e_1_3_2_2_57_1","unstructured":"RocksDB. -. (-). rockdb.org  RocksDB. -. (-). rockdb.org"},{"key":"e_1_3_2_2_58_1","volume-title":"The design and analysis of spatial data structures","unstructured":"HananSamet. 1990. The design and analysis of spatial data structures . Vol. 199 . Addison-Wesley Reading , MA. HananSamet. 1990. The design and analysis of spatial data structures. Vol. 199. Addison-Wesley Reading, MA."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536232"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391541.2391622"},{"key":"e_1_3_2_2_62_1","unstructured":"TBB -. Intel\u00ae Threading Building Blocks 2.0 for Open Source. (-). https:\/\/www.threadingbuildingblocks.org\/.  TBB -. Intel\u00ae Threading Building Blocks 2.0 for Open Source. (-). https:\/\/www.threadingbuildingblocks.org\/."},{"key":"e_1_3_2_2_63_1","unstructured":"Ziqi Wang Andrew Pavlo Hyeontaek Lim Viktor Leis Huanchen Zhang Michael Kaminsky and David G. Andersen. {n. d.}. Building A Bw-Tree Takes More Than Just Buzz Words {Experiments and Analyses} (Unpublished). ({n. d.}).  Ziqi Wang Andrew Pavlo Hyeontaek Lim Viktor Leis Huanchen Zhang Michael Kaminsky and David G. Andersen. {n. d.}. Building A Bw-Tree Takes More Than Just Buzz Words {Experiments and Analyses} (Unpublished). ({n. d.})."},{"key":"e_1_3_2_2_64_1","unstructured":"Wikimedia Foundation. 2016. Wikepedia:Database download. https:\/\/en.wikipedia.org\/wiki\/Wikipedia:Database_download. (2016).  Wikimedia Foundation. 2016. Wikepedia:Database download. https:\/\/en.wikipedia.org\/wiki\/Wikipedia:Database_download. (2016)."},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"PPoPP '18: 23nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Vienna Austria","acronym":"PPoPP '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178487.3178509","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178487.3178509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:08Z","timestamp":1750196348000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178509"}},"subtitle":["parallel augmented maps"],"short-title":[],"issued":{"date-parts":[[2018,2,10]]},"references-count":66,"alternative-id":["10.1145\/3178487.3178509","10.1145\/3178487"],"URL":"https:\/\/doi.org\/10.1145\/3178487.3178509","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3200691.3178509","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,2,10]]},"assertion":[{"value":"2018-02-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}