{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T17:36:13Z","timestamp":1771522573182,"version":"3.50.1"},"reference-count":159,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica (CONICYT) Programa Formaci\u00f3n de Capital Humano Avanzado (PFCHA)\/Beca de Doctorado Nacional\/2019","doi-asserted-by":"publisher","award":["21192157"],"award-info":[{"award-number":["21192157"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo (ANID) Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico (FONDECYT), Chile","doi-asserted-by":"publisher","award":["1221727"],"award-info":[{"award-number":["1221727"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3371976","type":"journal-article","created":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T18:40:43Z","timestamp":1709318443000},"page":"33154-33172","source":"Crossref","is-referenced-by-count":1,"title":["Path Querying in Graph Databases: A Systematic Mapping Study"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6466-4541","authenticated-orcid":false,"given":"Roberto","family":"Garc\u00eda","sequence":"first","affiliation":[{"name":"Engineering Systems Doctoral Program, Faculty of Engineering, Universidad de Talca, Curico, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6740-9711","authenticated-orcid":false,"given":"Renzo","family":"Angles","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Engineering, Universidad de Talca, Curico, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63962-8_75-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3434642"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.trit.2016.03.011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-022-03540-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1749"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh411"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-199"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.0076"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526057"},{"key":"ref14","first-page":"1:1","article-title":"A researcher\u2019s digest of GQL","volume-title":"Proc. Leibniz Int. Inform. (LIPIcs)","author":"Francis"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2012.31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/s1793351x15500129"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-7998-3479-3.ch053"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/database\/baab026"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989307"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3335409.3335411"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00849-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101816"},{"key":"ref26","article-title":"Guidelines for performing systematic literature reviews in software engineering","author":"Kitchenham","year":"1051"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14236\/ewic\/EASE2008.8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2015.03.007"},{"key":"ref29","volume-title":"ACM Digital Library","year":"2021"},{"key":"ref30","volume-title":"Advancing Technology for Humanity","year":"2021"},{"key":"ref31","volume-title":"Springer Link","year":"2021"},{"key":"ref32","volume-title":"Scopus","year":"2021"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113299"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2602702"},{"issue":"4","key":"ref35","first-page":"791","article-title":"Road network modeling with layered abstraction for path discovery in vehicle navigation systems","volume":"7","author":"Pan","year":"2016","journal-title":"J. Inf. Hiding Multim. Signal Process."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2980523.2980530"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/BDCloud.2014.101"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/959060.959076"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190654"},{"key":"ref40","volume-title":"Neo4j Graph Platform The Leader in Graph Databases","year":"2020"},{"key":"ref41","volume-title":"SPARQL Query Language for RDF (W3C Recommendation)","author":"Prud\u2019hommeaux","year":"2008"},{"key":"ref42","volume-title":"GraphQL | A Query Language for Your API","year":"2016"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01864-0"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF02812436"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2009.672"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/582353.582368"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SISY.2008.4664953"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IISA.2015.7388092"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/356651.356653"},{"key":"ref50","first-page":"207","article-title":"Compiling path queries","volume-title":"Proc. USENIX Conf. Networked Syst. Design Implement. (NSDI)","author":"Narayana"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/BDCloud.2014.11"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487937"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.67"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739084"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.jag.2010.07.003"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ACCT.2012.83"},{"issue":"2","key":"ref57","first-page":"124","article-title":"Path discovery and selection for energy efficient routing with transmit power control in MANET","volume":"26","author":"Bhanumathi","year":"2013","journal-title":"Malaysian J. Comput. Sci."},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352089"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029355"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_9"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.4171\/dms\/6\/19"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2068984.2068990"},{"key":"ref63","first-page":"657","article-title":"A new path algebra for finding paths in graphs","volume-title":"Proc. Int. Conf. Inf. Technol. Interfaces (ITI)","volume":"1","author":"Manger"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.14257\/astl.2013.30.20"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339491"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90098-8"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238550"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/536"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TOOLS.1998.750030"},{"key":"ref70","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"2010"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2010.5452732"},{"key":"ref72","first-page":"550","article-title":"Shortest path discovery problems: A framework, algorithms and experimental results","volume-title":"Proc. Conf. Artif. Intell","author":"Szepesv\u00e1ri"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.013"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655753"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2389241.2389250"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0401-5"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322273"},{"key":"ref78","volume-title":"SPARQL 1.1 Query Language (W3C Recommendation)","author":"Harris","year":"2013"},{"key":"ref79","volume-title":"SPARQL 1.1 Property Paths","author":"Seaborne","year":"2010"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46523-4_38"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/2494529"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27811-5_8"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263676"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61133-0_7"},{"key":"ref86","first-page":"143","article-title":"Aggregation query model for OODBMS","volume-title":"Proc. Int. Conf. Tools Pacific, Objects Internet, Mobile Embedded Appl. (CRPIT)","author":"Rahayu"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.12.002"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/SMAP.2016.7753376"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(4:1)2015"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49493-7_3"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465216"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247651"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1805"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.39"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1145\/3055167.3055173"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1145\/3335783.3335791"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387663"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0177-1"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05082-4_16"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1145\/2815072.2815082"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984326"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-7557-9_6"},{"key":"ref105","volume-title":"SQL, The Complete Reference","author":"Weinberg","year":"2010"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-020-0112-y"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00871-w"},{"key":"ref108","first-page":"13","article-title":"On optimization of wireless mesh networks using genetic algorithms","volume":"1","author":"Pries","year":"2010","journal-title":"Int. J. Advance Internet Technol."},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1002\/0470018860.s00065"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(92)90135-5"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1048"},{"key":"ref112","article-title":"Social network analysis taxonomy based on graph representation","author":"Alamsyah","year":"2021","journal-title":"arXiv:2102.08888"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25953-1_5"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.1993.263893"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2018.8460116"},{"key":"ref118","volume-title":"Graph Query Language GQL","year":"2020"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/DASFAA.1999.765741"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/512976.512987"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3024664"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1117\/12.673672"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/CSCWD.2018.8465373"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00024"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/2949689.2949711"},{"key":"ref126","first-page":"95","article-title":"A path-based relational RDF database","volume-title":"Proc. Australas. Database Conf. (ADC)","volume":"39","author":"Matono"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233358"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90074-X"},{"key":"ref129","first-page":"46","article-title":"A domain-specific language for the specification of path algebras","volume-title":"Proc. Workshop Automated Theory Eng. (ATE)","volume":"760","author":"Naud\u017eiunas"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxq055"},{"key":"ref131","first-page":"37","article-title":"Processing regular path queries on Giraph","volume-title":"Proc. Workshop EDBT\/ICDT Joint Conf.","volume":"1133","author":"Nol\u00e8"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-005-9016-8"},{"key":"ref133","first-page":"109","article-title":"Learning path queries on graph databases","volume-title":"Proc. Int. Conf. Extending Database Technol. (EDBT)","author":"Bonifati"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.4018\/JDM.2016070101"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00670-4"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01391-2_9"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43984-5_6"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412269"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236245"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210264"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2011.5767613"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448512"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/3331446"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274592"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213573"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375569"},{"issue":"2","key":"ref148","first-page":"259","article-title":"Preferential regular path queries","volume":"89","author":"Grahne","year":"2008","journal-title":"Fundam. Inf."},{"key":"ref149","first-page":"761","article-title":"Conjunctive regular path queries in lightweight description logics","volume-title":"Proc. Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Bienvenu"},{"key":"ref150","first-page":"19:1","article-title":"Evaluation and enumeration problems for regular path queries","volume-title":"Proc. Int. Conf. Database Theory (ICDT)","volume":"98","author":"Martens"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.10.021"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023063919574"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22996-2_10"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45442-X_12"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1145\/2815072.2815081"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1007\/BF01419587"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411229"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768819070041"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1145\/3448734.3450900"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10456906.pdf?arnumber=10456906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T19:01:34Z","timestamp":1709924494000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10456906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":159,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3371976","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}