{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:34:07Z","timestamp":1790681647452,"version":"4.1.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319991320","type":"print"},{"value":"9783319991337","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99133-7_7","type":"book-chapter","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T14:38:25Z","timestamp":1533566305000},"page":"88-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Big Data Analytics: Exploring Graphs with Optimized SQL Queries"],"prefix":"10.1007","author":[{"given":"Sikder Tahsin","family":"Al-Amin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Ordonez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ladjel","family":"Bellatreche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"key":"7_CR1","volume-title":"Foundations of Databases : The Logical Level","author":"S Abiteboul","year":"1994","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases : The Logical Level, Facsimile edn. Pearson Education POD, Boston (1994)","edition":"Facsimile"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/88636.88888","volume":"15","author":"R Agrawal","year":"1990","unstructured":"Agrawal, R., Dar, S., Jagadish, H.: Direct and transitive closure algorithms: design and performance evaluation. ACM TODS 15(3), 427\u2013458 (1990)","journal-title":"ACM TODS"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. In: Proceedings of ACM SIGMOD Conference, pp. 16\u201352 (1986)","DOI":"10.1145\/16856.16859"},{"issue":"3\u20134","key":"7_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10619-017-7200-6","volume":"35","author":"W Cabrera","year":"2017","unstructured":"Cabrera, W., Ordonez, C.: Scalable parallel graph algorithms with matrix\u2013vector multiplication evaluated with queries. Distrib. Parallel Databases 35(3\u20134), 335\u2013362 (2017)","journal-title":"Distrib. Parallel Databases"},{"issue":"13","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.14778\/2733004.2733057","volume":"7","author":"A Jindal","year":"2014","unstructured":"Jindal, A., Rawlani, P., Wu, E., Madden, S., Deshpande, A., Stonebraker, M.: VERTEXICA: your relational friend for graph analytics!. Proc. VLDB Endow. 7(13), 1669\u20131672 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Johnson, T., Kanza, Y., Lakshmanan, L.V.S., Shkapenyuk, V.: Nepal: a path query language for communication networks. In: Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics, NDA 2016, pp. 6:1\u20136:8 (2016)","DOI":"10.1145\/2980523.2980530"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: a peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 229\u2013238 (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.14778\/2367502.2367518","volume":"5","author":"A Lamb","year":"2012","unstructured":"Lamb, A., et al.: The Vertica analytic database: C-store 7 years later. Proc. VLDB Endow. 5, 1790\u20131801 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR9","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-64823-2_13","volume-title":"Database Programming Languages","author":"L Libkin","year":"1998","unstructured":"Libkin, L., Wong, L.: Incremental recomputation of recursive queries with nested sets and aggregate functions. In: Cluet, S., Hull, R. (eds.) DBPL 1997. LNCS, vol. 1369, pp. 222\u2013238. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-64823-2_13"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/227604.227624","volume":"21","author":"I Mumick","year":"1996","unstructured":"Mumick, I., Finkelstein, S., Pirahesh, H., Ramakrishnan, R.: Magic Conditions. ACM TODS 21(1), 107\u2013155 (1996)","journal-title":"ACM TODS"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Mumick, I., Pirahesh, H.: Implementation of magic-sets in a relational database system. In: ACM SIGMOD, pp. 103\u2013114 (1994)","DOI":"10.1145\/191839.191860"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.is.2016.04.006","volume":"63","author":"C Ordonez","year":"2016","unstructured":"Ordonez, C., Cabrera, W., Gurram, A.: Comparing columnar, row and array DBMSs to process recursive queries on graphs. Inf. Syst. 63, 66\u201379 (2016)","journal-title":"Inf. Syst."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pavlo, A., et al.: A comparison of approaches to large-scale data analysis. In: Proceedings of ACM SIGMOD Conference, pp. 165\u2013178 (2009)","DOI":"10.1145\/1559845.1559865"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Rodriguez, M.A.: The Gremlin graph traversal machine and language (invited talk). In: Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015, pp. 1\u201310 (2015)","DOI":"10.1145\/2815072.2815073"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Seshadri, S., Naughton, J.: On the expected size of recursive Datalog queries. In: Proceedings of ACM PODS Conference, pp. 268\u2013279 (1991)","DOI":"10.1145\/113413.113438"},{"key":"7_CR17","unstructured":"Siek, J., Lee, L.Q., Lumsdaine, A.: Boost c++ libraries. https:\/\/www.boost.org\/"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.is.2013.10.007","volume":"41","author":"S Sakr","year":"2014","unstructured":"Sakr, S., Elnikety, S., He, Y.: Hybrid query execution engine for large attributed graphs. Inf. Syst. 41, 45\u201373 (2014)","journal-title":"Inf. Syst."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Tetzel, F., Voigt, H., Paradies, M., Lehner, W.: An analysis of the feasibility of graph compression techniques for indexing regular path queries. In: Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems, GRADES 2017, pp. 11:1\u201311:6 (2017)","DOI":"10.1145\/3078447.3078458"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-64468-4_6","volume-title":"Database and Expert Systems Applications","author":"H Thakkar","year":"2017","unstructured":"Thakkar, H., Punjani, D., Auer, S., Vidal, M.-E.: Towards an integrated graph algebra for graph pattern matching with Gremlin. In: Benslimane, D., Damiani, E., Grosky, W.I., Hameurlain, A., Sheth, A., Wagner, R.R. (eds.) DEXA 2017 Part I. LNCS, vol. 10438, pp. 81\u201391. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64468-4_6"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/3979.3980","volume":"10","author":"J Ullman","year":"1985","unstructured":"Ullman, J.: Implementation of logical query languages for databases. ACM Trans. Database Syst. 10(3), 289\u2013321 (1985)","journal-title":"ACM Trans. Database Syst."},{"key":"7_CR22","unstructured":"Valduriez, P., Boral, H.: Evaluation of recursive queries using join indices. In: Expert Database Systems, pp. 271\u2013293 (1986)"},{"issue":"1","key":"7_CR23","first-page":"52","volume":"4","author":"C Youn","year":"1992","unstructured":"Youn, C., Kim, H., Henschen, L., Han, J.: Classification and compilation of linear recursive queries in deductive databases. IEEE TKDE 4(1), 52\u201367 (1992)","journal-title":"IEEE TKDE"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J.X.: All-in-one: graph processing in RDBMSs revisited. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD, pp. 1165\u20131180 (2017)","DOI":"10.1145\/3035918.3035943"}],"container-title":["Communications in Computer and Information Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99133-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T22:09:25Z","timestamp":1571695765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99133-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319991320","9783319991337"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99133-7_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}