{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T15:57:19Z","timestamp":1721836639476},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>A lot of real-life data are of graph nature. However, it is not until recently that business begins to exploit data's connectedness for business insights. On the other hand, RDBMSs are a mature technology for data management, but they are not for graph processing. Take graph traversal, a common graph operation for example, it heavily relies on a graph primitive that accesses a given node's neighborhood. We need to join tables following foreign keys to access the nodes in the neighborhood if an RDBMS is used to manage graph data. Graph exploration is a fundamental building block of many graph algorithms. But this simple operation is costly due to a large volume of I\/O caused by the massive amount of table joins. In this paper, we present G-SQL, our effort toward the integration of a RDBMS and a native in-memory graph processing engine. G-SQL leverages the fast graph exploration capability provided by the graph engine to answer multi-way join queries. Meanwhile, it uses RDBMSs to provide mature data management functionalities, such as reliable data storage and additional data access methods. Specifically, G-SQL is a SQL dialect augmented with graph exploration functionalities and it dispatches query tasks to the in-memory graph engine and its underlying RDMBS. The G-SQL runtime coordinates the two query processors via a unified cost model to ensure the entire query is processed efficiently. Experimental results show that our approach greatly expands capabilities of RDBMs and delivers exceptional performance for SQL-graph hybrid queries.<\/jats:p>","DOI":"10.14778\/2994509.2994510","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T15:27:03Z","timestamp":1473175623000},"page":"900-911","source":"Crossref","is-referenced-by-count":11,"title":["G-SQL"],"prefix":"10.14778","volume":"9","author":[{"given":"Hongbin","family":"Ma","sequence":"first","affiliation":[{"name":"eBay, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Shao","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanghua","family":"Xiao","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang Jeff","family":"Chen","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[{"name":"Facebook, Menlo Park"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050036"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.129222"},{"key":"e_1_2_1_3_1","first-page":"1138","volume-title":"VLDB","author":"P\u00f6ss M.","year":"2007","unstructured":"M. P\u00f6ss , R. O. Nambiar , and D. Walrath . Why you should run TPC-DS: A workload analysis . In VLDB , pages 1138 -- 1149 , 2007 . M. P\u00f6ss, R. O. Nambiar, and D. Walrath. Why you should run TPC-DS: A workload analysis. In VLDB, pages 1138--1149, 2007."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_1_6_1","volume-title":"Maintenance of materialized views: Problems, techniques, and applications","author":"Gupta A.","year":"1995","unstructured":"A. Gupta and I. S. Mumick . Maintenance of materialized views: Problems, techniques, and applications . IEEE Data Eng. Bull ., 18(2), 1995 . A. Gupta and I. S. Mumick. Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Eng. Bull., 18(2), 1995."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273595"},{"key":"e_1_2_1_9_1","volume-title":"Virtual screening for bioactive molecules","author":"Kubinyi H.","year":"2008","unstructured":"H. Kubinyi , R. Mannhold , H. Timmerman , H.-J. B\u00f6hm , and G. Schneider . Virtual screening for bioactive molecules . John Wiley & Sons , 2008 . H. Kubinyi, R. Mannhold, H. Timmerman, H.-J. B\u00f6hm, and G. Schneider. Virtual screening for bioactive molecules. John Wiley & Sons, 2008."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.26"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095430.1081753"},{"key":"e_1_2_1_12_1","volume-title":"Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1006.4990","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1006.4990 , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1006.4990, 2010."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_14_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . In OSDI , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI, 2012."},{"key":"e_1_2_1_15_1","volume-title":"Graph NoSQL Database {online}","author":"Developers N.","year":"2012","unstructured":"N. Developers . Neo4j. Graph NoSQL Database {online} , 2012 . N. Developers. Neo4j. Graph NoSQL Database {online}, 2012."},{"key":"e_1_2_1_16_1","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a pc . In OSDI , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In OSDI, 2012."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298593"},{"key":"e_1_2_1_20_1","first-page":"12","volume-title":"VLDB","volume":"94","author":"G\u00fcting R. H.","year":"1994","unstructured":"R. H. G\u00fcting . Graphdb : Modeling and querying graphs in databases . In VLDB , volume 94 , pages 12 -- 15 . Citeseer , 1994 . R. H. G\u00fcting. Graphdb: Modeling and querying graphs in databases. In VLDB, volume 94, pages 12--15. Citeseer, 1994."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754973"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30475-3_5"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002976"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11431053_24"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/951953.952382"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0125-y"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453965"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453927"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463718"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2994509.2994510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:51:21Z","timestamp":1672224681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2994509.2994510"}},"subtitle":["fast query processing via graph exploration"],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.14778\/2994509.2994510"],"URL":"https:\/\/doi.org\/10.14778\/2994509.2994510","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}