{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:03:24Z","timestamp":1729609404558,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/icdim.2010.5664712","type":"proceedings-article","created":{"date-parts":[[2010,12,14]],"date-time":"2010-12-14T15:28:00Z","timestamp":1292340480000},"page":"174-181","source":"Crossref","is-referenced-by-count":0,"title":["An efficient filtering technique for super-graph query processing"],"prefix":"10.1109","author":[{"given":"Mohamed","family":"Saber","sequence":"first","affiliation":[]},{"given":"Mostafa","family":"Aref","sequence":"additional","affiliation":[]},{"given":"Tarek F.","family":"Gharib","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"595","article-title":"Efficiently Answering Reachability Queries on Very Large Directed Graphs","author":"ruoming","year":"2008","journal-title":"SIGMOD"},{"journal-title":"Proceedings of the 3rd ACM Symposium on Theory of Computing","article-title":"The complexity of theorem-proving procedures","year":"1971","key":"ref11"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/1114244.1114248","article-title":"Graph Indexing Based on Discriminative Frequent Structure Analysis","volume":"30","author":"xifeng","year":"2005","journal-title":"ACM Transactions on Database Systems"},{"key":"ref13","first-page":"766","article-title":"Substructure Similarity Search in Graph Databases","author":"xifeng","year":"2005","journal-title":"SIGMOD"},{"key":"ref14","article-title":"Closure-Tree: An Index Structure for Graph Queries","author":"he","year":"2006","journal-title":"Proceedings of the 22nd International Conference on Data Engineering IEEE"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"364","DOI":"10.14778\/1453856.1453899","article-title":"Taming Verification Hardness: An Efficient Algorithm for Testing Sub-graph Isomorphism","volume":"1","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1508857.1508859"},{"key":"ref19","article-title":"Towards Graph Containment Search and Indexing","author":"chen","year":"2007","journal-title":"VLDB Conference"},{"key":"ref4","first-page":"553","article-title":"C-Store: A Column Oriented DBMS","author":"stonebraker","year":"2005","journal-title":"VLDB"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"article-title":"Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications","year":"2002","author":"boncz","key":"ref6"},{"year":"0","key":"ref5"},{"year":"0","key":"ref8"},{"year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/356662.356664"},{"year":"0","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref22","article-title":"A Novel Approach for Efficient Super-graph Query Processing on Graph Databases","author":"zhang","year":"2009","journal-title":"EDBT Conference"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"journal-title":"GraphGen A Graph Synthetic Generator","year":"2006","author":"cheng","key":"ref23"}],"event":{"name":"2010 Fifth International Conference on Digital Information Management (ICDIM)","start":{"date-parts":[[2010,7,5]]},"location":"Thunder Bay, ON, Canada","end":{"date-parts":[[2010,7,8]]}},"container-title":["2010 Fifth International Conference on Digital Information Management (ICDIM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5644872\/5662242\/05664712.pdf?arnumber=5664712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T13:14:38Z","timestamp":1497878078000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5664712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/icdim.2010.5664712","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}