{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:08:14Z","timestamp":1765303694631,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,6]],"date-time":"2010-06-06T00:00:00Z","timestamp":1275782400000},"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":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807183","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"123-134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":77,"title":["Computing label-constraint reachability in graph databases"],"prefix":"10.1145","author":[{"given":"Ruoming","family":"Jin","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Hong","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Ruan","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263676"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_3_1","volume-title":"Combinatorics of Finite Sets","author":"Anderson Ian","year":"1987","unstructured":"Ian Anderson . Combinatorics of Finite Sets . Clarendon Press , Oxford , 1987 . Ian Anderson. Combinatorics of Finite Sets. Clarendon Press, Oxford, 1987."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_5_1","volume-title":"Computational Geometry","author":"Overmars M.","year":"2000","unstructured":"M.de Berg, M.van Kreveld, M. Overmars , and O. Schwarzkopf . Computational Geometry . Springer , 2000 . M.de Berg, M.van Kreveld, M.Overmars, and O.Schwarzkopf. Computational Geometry. Springer, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_7_1","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu Y. J.","year":"1965","unstructured":"Y. J. Chu and T. H. Liu . On the shortest arborescence of a directed graph . Science Sinica , 14 : 1396 -- 1400 , 1965 . Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396--1400, 1965.","journal-title":"Science Sinica"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/80156"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1060"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553426"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_13_1","first-page":"929","volume-title":"Science","author":"Christmas J. A.","year":"2001","unstructured":"Thorsson, V., Ranish, J. A. , Christmas , R., Buhler, J., Eng J. K. , Bumgarner , R., Goodlett, D. R. , Aebersold , R., Hood, L., Ideker, T. Integrated genomic and proteomic analyses of a systematically perturbed metabolic network . In Science , pages 929 -- 934 , 2001 . Thorsson, V., Ranish, J. A., Christmas, R., Buhler, J., Eng J. K., Bumgarner, R., Goodlett, D. R., Aebersold, R., Hood, L., Ideker, T. Integrated genomic and proteomic analyses of a systematically perturbed metabolic network. In Science, pages 929--934, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/107004.107032"},{"key":"e_1_3_2_1_18_1","first-page":"799","volume-title":"Science","author":"Rober N. J.","year":"2002","unstructured":"Rinaldi, N. J. , Rober ,t F., Odom, D. T. , Bar-Joseph , Z., Gerber, G. K. , Hannett , N. M. , Harbison , C. R. , Thompson , C. M. , Simon , I., Zeitlinger, J., Jennings, E. G. , Murray , H. L. , Gordon , D. B. , Ren , B., Wyrick, J. J. , Tagne , J. Volkert , T. L. , Fraenkel , E., Gifford, D. K. , Lee , T. I., and R. A. Young . Transcriptional regulatory networks in saccharomyces cerevisiae . In Science , pages 799 -- 804 , 2002 . Rinaldi, N. J., Rober,t F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. R., Thompson, C. M., Simon, I., Zeitlinger, J., Jennings, E. G., Murray, H. L., Gordon, D. B., Ren, B., Wyrick, J. J., Tagne, J. Volkert, T. L., Fraenkel, E., Gifford, D. K., Lee, T. I., and R. A. Young. Transcriptional regulatory networks in saccharomyces cerevisiae. In Science, pages 799--804, 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_44"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390241"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/00107510500052444"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"}],"event":{"name":"SIGMOD\/PODS '10: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Indianapolis Indiana USA","acronym":"SIGMOD\/PODS '10"},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807183","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:35Z","timestamp":1750249055000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":24,"alternative-id":["10.1145\/1807167.1807183","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807183","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}