{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:59:17Z","timestamp":1759683557758},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tkde.2014.2310207","type":"journal-article","created":{"date-parts":[[2014,3,11]],"date-time":"2014-03-11T18:02:41Z","timestamp":1394560961000},"page":"2803-2817","source":"Crossref","is-referenced-by-count":10,"title":["Scaling Hop-Based Reachability Indexing for Fast Graph Pattern Query Processing"],"prefix":"10.1109","volume":"26","author":[{"given":"Ronghua","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Zhuge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaorui","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_33"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11733836_21"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1320003"},{"key":"ref31","first-page":"960","article-title":"Selectivity estimation of twig queries over cyclic graphs","author":"peng","year":"2011","journal-title":"Proc IEEE 27th Int Conf Data Eng"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187963"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497491"},{"key":"ref28","first-page":"361","article-title":"Indexing and querying XML data for regular path expressions","author":"li","year":"2001","journal-title":"Proc 27th Int Conf Very Large Data Bases"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367644"},{"key":"ref29","first-page":"193","article-title":"From region encoding to extended dewey: On efficient processing of xml twig pattern matching","author":"lu","year":"2005","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/564724.564727"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CW.2008.11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"ref21","author":"jeffrey","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"ref24","first-page":"169","article-title":"SCARAB: Scaling reachability computation on large graphs","author":"jin","year":"2011","journal-title":"Proc ACM SIGMOD Int Conf Manage of Data"},{"key":"ref23","first-page":"595","article-title":"Effcient answering reachability queries on very large directed graphs","author":"jin","year":"2008","journal-title":"Proc ACM SIGMOD Int Conf Manage of Data"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687577"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0238-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/ICDE.2006.53","article-title":"Dual labeling: Answering graph reachability queries in constant time","author":"wang","year":"2006","journal-title":"Proc 20th Int l Conf Data Eng"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"ref13","article-title":"Matching structure and semantics: A survey on graph-based pattern matching","author":"gallagher","year":"2006","journal-title":"Proc AAAI Fall Symp"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.117"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1060"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376676"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099708"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50032-X"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/APSCC.2008.15"},{"key":"ref4","first-page":"493","article-title":"Stack-based algorithms for pattern matching on dags","author":"chen","year":"2005","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871457"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353370"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767832"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544895"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.169"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687727"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50031-7"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212355"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","article-title":"GRAIL: A scalable index for reachability queries in very large graphs","volume":"21","author":"y?ld?r?m","year":"2012","journal-title":"VLDB J"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.06.013"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180919"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/ICDE.2005.98","article-title":"On the sequencing of tree structures for XML indexing","author":"wang","year":"2005","journal-title":"Proc 11th Int Conf Data Engineering"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453909"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/872773.872774"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/6915958\/06763111.pdf?arnumber=6763111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:30Z","timestamp":1642006350000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6763111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":50,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2310207","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}