{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:21:32Z","timestamp":1729614092382,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113299","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T19:23:28Z","timestamp":1433359408000},"page":"375-386","source":"Crossref","is-referenced-by-count":8,"title":["Answering regular path queries on workflow provenance"],"prefix":"10.1109","author":[{"given":"Xiaocheng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuowei","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan B.","family":"Davidson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180919"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-008-0050-4"},{"key":"ref30","article-title":"Fast and practical indexing and querying of very large graphs","author":"tribi","year":"2007","journal-title":"SIGMOD"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/564724.564727"},{"key":"ref11","article-title":"Adding structure to unstructured data","author":"buneman","year":"1997","journal-title":"ICDT"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303996"},{"key":"ref13","article-title":"Stack-based algorithms for pattern matching on dags","author":"chen","year":"2005","journal-title":"VLDB"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2034863.2034865"},{"key":"ref15","first-page":"44","article-title":"Provenance in scientific workflow systems","volume":"30","author":"davidson","year":"2007","journal-title":"IEEE Data Eng Bull"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2457317.2457353"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655753"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376716"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"2007","author":"hopcroft","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.06.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350240"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2010.07.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989375"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807089"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807244"},{"key":"ref8","article-title":"Querying business processes","author":"beeri","year":"2006","journal-title":"VLDB"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2389241.2389250"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994704"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2688"},{"year":"0","key":"ref1"},{"journal-title":"Answering regular path queries on workflow provenance-tech report arXiv 1408 0528","year":"2014","author":"huang","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"ref23","article-title":"Indexing and querying XML data for regular path expressions","author":"li","year":"2001","journal-title":"VLDB"},{"key":"ref26","article-title":"Finding regular simple paths in graph databases","author":"mendelzon","year":"1989","journal-title":"VLDB"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1145\/2213556.2213573","article-title":"The complexity of evaluating path expressions in SPARQ L","author":"losemann","year":"2012","journal-title":"PODS"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2015,4,13]]},"location":"Seoul, South Korea","end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113299.pdf?arnumber=7113299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T02:22:14Z","timestamp":1566786134000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7113299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113299","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}