{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:21:26Z","timestamp":1771600886264,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989419","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"913-924","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":93,"title":["A memory efficient reachability data structure through bit vector compression"],"prefix":"10.1145","author":[{"given":"Sebastiaan J.","family":"van Schaik","sequence":"first","affiliation":[{"name":"University of Oxford & Utrecht University, Oxford, United Kingdom"}]},{"given":"Oege","family":"de Moor","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_2_1","first-page":"255","volume-title":"13th VLDB conference","author":"Agrawal R.","year":"1987","unstructured":"R. Agrawal and H. Jagadish . Direct algorithms for computing the transitive closure of database relations . In 13th VLDB conference , pages 255 -- 266 , 1987 . R. Agrawal and H. Jagadish. Direct algorithms for computing the transitive closure of database relations. In 13th VLDB conference, pages 255--266, 1987."},{"key":"e_1_3_2_1_3_1","first-page":"937","volume-title":"Symposium on Discrete Algorithms","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In Symposium on Discrete Algorithms , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Symposium on Discrete Algorithms, pages 937--946, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00271339"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00304-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/155271.155273"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90128-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940892"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/271338.271343"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_16_1","first-page":"216","article-title":"Transitivit\u00e9 et connexit\u00e9","volume":"249","author":"Roy B.","year":"1958","unstructured":"B. Roy . Transitivit\u00e9 et connexit\u00e9 . Comptes Rendus de l'Acad\u00e9mie des Sciences Paris , 249 : 216 -- 218 , 1958 . B. Roy. Transitivit\u00e9 et connexit\u00e9. Comptes Rendus de l'Acad\u00e9mie des Sciences Paris, 249:216--218, 1958.","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences Paris"},{"key":"e_1_3_2_1_17_1","volume-title":"Computing, 30(4)","author":"Schmitz L.","year":"1983","unstructured":"L. Schmitz . An improved transitive closure algorithm. Computing, 30(4) , 1983 . L. Schmitz. An improved transitive closure algorithm. Computing, 30(4), 1983."},{"key":"e_1_3_2_1_18_1","volume-title":"New Trends in Data Warehousing and Data Analysis","volume":"3","author":"Stockinger K.","year":"2008","unstructured":"K. Stockinger , J. Cieslewicz , K. Wu , D. Rotem , and A. Shoshani . Using bitmap indexing technology for combined numerical and text queries . In New Trends in Data Warehousing and Data Analysis , volume 3 of Annals of Information Systems, pages 1--23 , 2008 . K. Stockinger, J. Cieslewicz, K. Wu, D. Rotem, and A. Shoshani. Using bitmap indexing technology for combined numerical and text queries. In New Trends in Data Warehousing and Data Analysis, volume 3 of Annals of Information Systems, pages 1--23, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_3_2_1_21_1","volume-title":"Word-aligned hybrid compression for bitmap indices. Website with overview of applications http:\/\/crd.lbl.gov\/kewu\/fastbit\/compression.html","author":"Wu K.","year":"2010","unstructured":"K. Wu Word-aligned hybrid compression for bitmap indices. Website with overview of applications http:\/\/crd.lbl.gov\/kewu\/fastbit\/compression.html , 2010 . K. Wu et al. Word-aligned hybrid compression for bitmap indices. Website with overview of applications http:\/\/crd.lbl.gov\/kewu\/fastbit\/compression.html, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132864"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_12"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","location":"Athens Greece","acronym":"SIGMOD\/PODS '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:21Z","timestamp":1750245741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":21,"alternative-id":["10.1145\/1989323.1989419","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989419","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}