{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T06:07:35Z","timestamp":1764828455254,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544895","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T15:02:52Z","timestamp":1372258972000},"page":"1033-1044","source":"Crossref","is-referenced-by-count":18,"title":["Top-k graph pattern matching over large graphs"],"prefix":"10.1109","author":[{"family":"Jiefeng Cheng","sequence":"first","affiliation":[]},{"family":"Xianggang Zeng","sequence":"additional","affiliation":[]},{"given":"J. X.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274578"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-010-0290-z"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142536"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"15","article-title":"Interactive searching and visualization of patterns in attributed graphs","author":"koenig","year":"0","journal-title":"Graphics Interface Conference 2010"},{"journal-title":"The PageRank Citation Ranking Bringing Order to the Web","year":"1998","author":"page","key":"33"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1007\/11914853_15","article-title":"Bpel processes match-making for service discovery","volume":"4275","author":"corrales","year":"2006","journal-title":"Lecture Notes in Computer Science"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142593"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859091"},{"key":"39","article-title":"On power-law relationships of the internet topology","volume":"29","author":"faloutsos","year":"0","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002976"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.141"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0128-2"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767893"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376676"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368956"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"27","article-title":"Efficient subgraph search over large uncertain graphs","author":"yuan","year":"2011","journal-title":"VLDB"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994756"},{"key":"29","article-title":"Discover: Keyword search in relational databases","author":"hristidis","year":"2002","journal-title":"VLDB"},{"key":"3","article-title":"Mining top-k large structural patterns in a massive network","author":"zhu","year":"2011","journal-title":"VLDB"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453909"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"5","article-title":"Fast graph pattern matching","author":"cheng","year":"2008","journal-title":"ICDE"},{"key":"31","article-title":"Top-k graph pattern matching: A twig query approach","author":"zeng","year":"2012","journal-title":"WAIM"},{"key":"4","article-title":"Stack-based algorithms for pattern matching on DAGs","author":"chen","year":"2005","journal-title":"VLDB"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"8","article-title":"Distancejoin: Pattern match query in a large graph database","author":"zou","year":"0","journal-title":"Proc Of VLDB'09 2009"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","start":{"date-parts":[[2013,4,8]]},"location":"Brisbane, QLD","end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544895.pdf?arnumber=6544895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T11:18:46Z","timestamp":1498043926000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544895\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544895","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}