{"id":"https://openalex.org/W2224428998","doi":"https://doi.org/10.2168/lmcs-11(4:14)2015","title":"Datalog Rewritings of Regular Path Queries using Views","display_name":"Datalog Rewritings of Regular Path Queries using Views","publication_year":2015,"publication_date":"2015-12-22","ids":{"openalex":"https://openalex.org/W2224428998","doi":"https://doi.org/10.2168/lmcs-11(4:14)2015","mag":"2224428998"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(4:14)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:14)2015","pdf_url":"https://lmcs.episciences.org/1615/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1615/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001191322","display_name":"Nadime Francis","orcid":"https://orcid.org/0009-0009-4531-7435"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nadime Francis","raw_affiliation_strings":["ENS-Cachan, Inria","Inria, ENS-Cachan"],"affiliations":[{"raw_affiliation_string":"ENS-Cachan, Inria","institution_ids":["https://openalex.org/I11559806"]},{"raw_affiliation_string":"Inria, ENS-Cachan","institution_ids":["https://openalex.org/I11559806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042411667","display_name":"Luc Segoufin","orcid":"https://orcid.org/0000-0002-9564-7581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luc Segoufin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5060233663","display_name":"Cristina Sirangelo","orcid":"https://orcid.org/0000-0003-2559-512X"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cristina Sirangelo","raw_affiliation_strings":["LSV at ENS-Cachan, Inria, CNRS"],"affiliations":[{"raw_affiliation_string":"LSV at ENS-Cachan, Inria, CNRS","institution_ids":["https://openalex.org/I11559806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001191322"],"corresponding_institution_ids":["https://openalex.org/I11559806"],"apc_list":null,"apc_paid":null,"fwci":1.4979,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88538408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 11, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8928999900817871,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8928999900817871,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.04600000008940697,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.016300000250339508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.9180936813354492},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6571152210235596},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5255062580108643},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5159597992897034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5132832527160645},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5108878016471863},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4992222785949707},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.47580012679100037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47013574838638306},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4431760609149933},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4362871050834656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4152892231941223},{"id":"https://openalex.org/keywords/database-query","display_name":"Database query","score":0.41421884298324585},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.4141913056373596},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.4124825596809387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4003846049308777},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3827707767486572},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.267976313829422},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14613613486289978},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.08858343958854675}],"concepts":[{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.9180936813354492},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6571152210235596},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5255062580108643},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5159597992897034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5132832527160645},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5108878016471863},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4992222785949707},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.47580012679100037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47013574838638306},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4431760609149933},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4362871050834656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4152892231941223},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.41421884298324585},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4141913056373596},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.4124825596809387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4003846049308777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3827707767486572},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.267976313829422},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14613613486289978},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.08858343958854675},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2168/lmcs-11(4:14)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:14)2015","pdf_url":"https://lmcs.episciences.org/1615/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/f94070de-0314-482f-b871-b855264c7779","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/f94070de-0314-482f-b871-b855264c7779","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Francis, N, Segoufin, L & Sirangelo, C 2015, 'Datalog Rewritings of Regular Path Queries using Views', Logical Methods in Computer Science, vol. 11, no. 4. https://doi.org/10.2168/LMCS-11(4:14)2015","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1511.00938","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.00938","pdf_url":"https://arxiv.org/pdf/1511.00938","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:c2252384dbf74ee6afbf88af8dadaadb","is_oa":true,"landing_page_url":"https://doaj.org/article/c2252384dbf74ee6afbf88af8dadaadb","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 4 (2015)","raw_type":"article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/f94070de-0314-482f-b871-b855264c7779","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/datalog-rewritings-of-regular-path-queries-using-views(f94070de-0314-482f-b871-b855264c7779).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Francis, N, Segoufin, L & Sirangelo, C 2015, 'Datalog Rewritings of Regular Path Queries using Views', Logical Methods in Computer Science, vol. 11, no. 4. https://doi.org/10.2168/LMCS-11(4:14)2015","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(4:14)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:14)2015","pdf_url":"https://lmcs.episciences.org/1615/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2224428998.pdf","grobid_xml":"https://content.openalex.org/works/W2224428998.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W187851124","https://openalex.org/W1558832481","https://openalex.org/W1952678003","https://openalex.org/W1976580206","https://openalex.org/W1980622548","https://openalex.org/W1994840586","https://openalex.org/W1999377429","https://openalex.org/W2059052871","https://openalex.org/W2066684585","https://openalex.org/W2150339067","https://openalex.org/W2154293623","https://openalex.org/W2160133521","https://openalex.org/W2160983447"],"related_works":["https://openalex.org/W20972493","https://openalex.org/W2338525844","https://openalex.org/W2951257011","https://openalex.org/W4299540831","https://openalex.org/W2896766859","https://openalex.org/W4288363924","https://openalex.org/W2740681086","https://openalex.org/W2926816154","https://openalex.org/W3203590019","https://openalex.org/W1900017563"],"abstract_inverted_index":{"We":[0,15,54],"consider":[1,17],"query":[2,62,115,125,147],"answering":[3],"using":[4,153],"views":[5,18],"on":[6,81],"graph":[7,36,67],"databases,":[8],"i.e.":[9],"databases":[10,68],"structured":[11],"as":[12,112],"edge-labeled":[13],"graphs.":[14],"mainly":[16],"and":[19],"queries":[20,29],"specified":[21],"by":[22],"Regular":[23],"Path":[24],"Queries":[25],"(RPQ).":[26],"These":[27],"are":[28,39],"selecting":[30],"pairs":[31],"of":[32,46,110,135],"nodes":[33],"in":[34,129,132,151],"a":[35,42,57,61,88,108,113],"database":[37],"that":[38,56,100,140],"connected":[40],"via":[41],"path":[43],"whose":[44],"sequence":[45],"edge":[47],"labels":[48],"belongs":[49],"to":[50,78,94],"some":[51],"regular":[52],"language.":[53],"say":[55],"view":[58,71,118],"V":[59],"determines":[60],"Q":[63,80,111],"if":[64],"for":[65],"all":[66],"D,":[69],"the":[70,117,123,133],"image":[72],"V(D)":[73,93],"always":[74],"contains":[75],"enough":[76],"information":[77],"answer":[79],"D.":[82],"In":[83,121],"other":[84],"words,":[85],"there":[86,106],"is":[87,104,142],"well":[89],"defined":[90],"function":[91,103],"from":[92],"Q(D).":[95],"Our":[96],"main":[97],"result":[98],"shows":[99],"when":[101],"this":[102,138],"monotone,":[105],"exists":[107],"rewriting":[109,124],"Datalog":[114,152],"over":[116],"instance":[119],"V(D).":[120,136],"particular":[122],"can":[126,148],"be":[127,149],"evaluated":[128],"time":[130],"polynomial":[131],"size":[134],"Moreover":[137],"implies":[139],"it":[141],"decidable":[143],"whether":[144],"an":[145],"RPQ":[146,154],"rewritten":[150],"views.":[155]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-11-23T00:00:00"}