{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:35:53Z","timestamp":1775054153895,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/icde.2011.5767858","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T16:45:21Z","timestamp":1305650721000},"page":"39-50","source":"Crossref","is-referenced-by-count":102,"title":["Adding regular expressions to graph reachability and pattern queries"],"prefix":"10.1109","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shuai","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Nan","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Yinghui","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Dual labeling: Answering graph reachability queries in constant time","author":"wang","year":"2006","journal-title":"ICDE"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687727"},{"key":"ref36","article-title":"Containment for XPath fragments under DTD constraints","author":"wood","year":"2003","journal-title":"ICDT"},{"key":"ref35","year":"0","journal-title":"Wikipedia F-measure"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559907"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335429"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1331904.1331908"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275503"},{"key":"ref17","article-title":"Matching structure and semantics: A survey on graph-based pattern matching","author":"gallagher","year":"2006","journal-title":"AAAI FS"},{"key":"ref18","article-title":"Graphs-at-a-time: query language and access methods for graph databases","author":"he","year":"2009","journal-title":"SIGMOD"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492576"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"ref4","author":"bang-jensen","year":"2008","journal-title":"Digraphs Theory Algorithms and Applications"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.172"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050005","article-title":"The Lorel query language for semistructured data","volume":"1","author":"abiteboul","year":"1997","journal-title":"Int J on Digital Libraries"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357183"},{"key":"ref29","year":"0","journal-title":"SPARQL"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807089"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/635499.635502"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050084"},{"key":"ref2","author":"abiteboul","year":"1995","journal-title":"Foundations of Databases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376678"},{"key":"ref1","year":"0","journal-title":"Terrorist organization network"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0222067"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"ref24","article-title":"XPath containment in the presence of disjunction, DTDs, and variables","author":"neven","year":"2003","journal-title":"ICDT"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.8"},{"key":"ref25","author":"papadimitriou","year":"1994","journal-title":"Computational Complexity"}],"event":{"name":"2011 IEEE International Conference on Data Engineering (ICDE 2011)","location":"Hannover, Germany","start":{"date-parts":[[2011,4,11]]},"end":{"date-parts":[[2011,4,16]]}},"container-title":["2011 IEEE 27th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5765035\/5767827\/05767858.pdf?arnumber=5767858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T17:33:47Z","timestamp":1560188027000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5767858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icde.2011.5767858","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}