{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:07Z","timestamp":1750221307515,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T00:00:00Z","timestamp":1515628800000},"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":[[2018,1,11]]},"DOI":"10.1145\/3152494.3152506","type":"proceedings-article","created":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T15:28:46Z","timestamp":1518535726000},"page":"128-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient RDF dictionaries with B+ trees"],"prefix":"10.1145","author":[{"given":"Gurkirat","family":"Singh","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kanpur"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhawal","family":"Upadhyay","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Medha","family":"Atre","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. MonetDB. http:\/\/www.monetdb.org\/. ({n. d.}).  {n. d.}. MonetDB. http:\/\/www.monetdb.org\/. ({n. d.})."},{"key":"e_1_3_2_1_2_1","unstructured":"{n. d.}. Virtuoso Opensource Edition. http:\/\/virtuoso.openlinksw.com\/dataspace\/doc\/dav\/wiki\/Main\/. ({n. d.}).  {n. d.}. Virtuoso Opensource Edition. http:\/\/virtuoso.openlinksw.com\/dataspace\/doc\/dav\/wiki\/Main\/. ({n. d.})."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746483"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889390"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772696"},{"key":"e_1_3_2_1_6_1","volume-title":"Hendler","author":"Atre Medha","year":"2008","unstructured":"Medha Atre , Jagannathan Srinivasan , and James A . Hendler . 2008 . BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Querie. In ISWC ( posters and demos). Medha Atre, Jagannathan Srinivasan, and James A. Hendler. 2008. BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Querie. In ISWC (posters and demos)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2340416.2340422"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559911"},{"key":"e_1_3_2_1_10_1","volume-title":"SSWS workshop at International Semantic Web Conference.","author":"Nguyen Minh Khoa","year":"2010","unstructured":"Minh Khoa Nguyen , Cosmin Basca , and Abraham Bernstein . 2010 . B+Hash Tree: Optimizing query execution times for on-Disk Semantic Web data structures . In SSWS workshop at International Semantic Web Conference. Minh Khoa Nguyen, Cosmin Basca, and Abraham Bernstein. 2010. B+Hash Tree: Optimizing query execution times for on-Disk Semantic Web data structures. In SSWS workshop at International Semantic Web Conference."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454227"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536352"}],"event":{"name":"CoDS-COMAD '18: The ACM India Joint International Conference on Data Science & Management of Data","acronym":"CoDS-COMAD '18","location":"Goa India"},"container-title":["Proceedings of the ACM India Joint International Conference on Data Science and Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152494.3152506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3152494.3152506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:31Z","timestamp":1750212811000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152494.3152506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,11]]},"references-count":11,"alternative-id":["10.1145\/3152494.3152506","10.1145\/3152494"],"URL":"https:\/\/doi.org\/10.1145\/3152494.3152506","relation":{},"subject":[],"published":{"date-parts":[[2018,1,11]]},"assertion":[{"value":"2018-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}