{"id":"https://openalex.org/W4410491319","doi":"https://doi.org/10.1093/comjnl/bxaf061","title":"Optimization of Kleene closure regular path query on large RDF graphs","display_name":"Optimization of Kleene closure regular path query on large RDF graphs","publication_year":2025,"publication_date":"2025-04-26","ids":{"openalex":"https://openalex.org/W4410491319","doi":"https://doi.org/10.1093/comjnl/bxaf061"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxaf061","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxaf061","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028399492","display_name":"Tenglong Ren","orcid":"https://orcid.org/0009-0007-4215-4170"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tenglong Ren","raw_affiliation_strings":["College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,","institution_ids":["https://openalex.org/I162868743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030524599","display_name":"Xiaowang Zhang","orcid":"https://orcid.org/0000-0002-3931-3886"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaowang Zhang","raw_affiliation_strings":["College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,","institution_ids":["https://openalex.org/I162868743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100736532","display_name":"Zhiyong Feng","orcid":"https://orcid.org/0000-0001-8158-7453"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiyong Feng","raw_affiliation_strings":["College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Intelligence and Computing , Tianjin University, No. 135, Ya Guan Road, Jinnan District, Tianjin,","institution_ids":["https://openalex.org/I162868743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030524599"],"corresponding_institution_ids":["https://openalex.org/I162868743"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10525747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"11","first_page":"1595","last_page":"1609"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9983999729156494,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.801677942276001},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5242248177528381},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5102756023406982},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5024805068969727},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4753382205963135},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.46980151534080505},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4537908136844635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3738742768764496},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.31642353534698486},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.19963431358337402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16642311215400696},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13159939646720886},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11830908060073853}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.801677942276001},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5242248177528381},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5102756023406982},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5024805068969727},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4753382205963135},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.46980151534080505},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4537908136844635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3738742768764496},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.31642353534698486},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.19963431358337402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16642311215400696},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13159939646720886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11830908060073853}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxaf061","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxaf061","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4304333080","display_name":null,"funder_award_id":"61972455","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W1921622259","https://openalex.org/W2008080405","https://openalex.org/W2034956447","https://openalex.org/W2105775150","https://openalex.org/W2113310608","https://openalex.org/W2121859659","https://openalex.org/W2135282325","https://openalex.org/W2278614270","https://openalex.org/W2405066551","https://openalex.org/W2622037077","https://openalex.org/W2668736619","https://openalex.org/W2945579404","https://openalex.org/W2987109790","https://openalex.org/W3119719864","https://openalex.org/W3214396411","https://openalex.org/W4252462081","https://openalex.org/W4303427146","https://openalex.org/W6604189946","https://openalex.org/W6671627848","https://openalex.org/W6675468344","https://openalex.org/W6713578294","https://openalex.org/W6731653358","https://openalex.org/W6739506183","https://openalex.org/W6740996482","https://openalex.org/W6749314778","https://openalex.org/W6749858451","https://openalex.org/W6794019421","https://openalex.org/W6809700047"],"related_works":["https://openalex.org/W2556786504","https://openalex.org/W2152149667","https://openalex.org/W4244527061","https://openalex.org/W2469357693","https://openalex.org/W3125756434","https://openalex.org/W1977383094","https://openalex.org/W2572349046","https://openalex.org/W2413368787","https://openalex.org/W1515213763","https://openalex.org/W1779612025"],"abstract_inverted_index":{"Abstract":[0],"As":[1],"the":[2,10,79,90,136,205,257,262],"core":[3,99],"operator":[4],"of":[5,81,93,101,115,132,190,264],"regular":[6],"path":[7,240],"query":[8,67,161],"(RPQ),":[9],"Kleene":[11,44,94,119,180,217],"closure":[12,45,95,120,218],"is":[13,33],"essentially":[14],"a":[15,151,174,246],"recursive":[16,48,91,106],"operation":[17],"based":[18,70,266],"on":[19,71,199,267],"predicates.":[20],"It":[21],"has":[22],"more":[23],"expressive":[24],"power":[25],"than":[26],"first-order":[27],"logic,":[28],"but":[29],"its":[30],"algorithmic":[31],"complexity":[32,83],"an":[34,65],"NP-hard":[35,82],"problem":[36],"and":[37,74,84,111,143,215,226,239],"expensive":[38],"to":[39,77,159,185,221,245],"execute.":[40],"Most":[41],"approaches":[42],"implement":[43],"via":[46],"online":[47,145],"queries":[49,121,219],"(inefficient":[50],"for":[51,171,213,232],"large-scale":[52,200],"data),":[53],"yet":[54],"significant":[55],"reusable":[56],"intermediate":[57,113,156],"results":[58,114],"emerge":[59],"during":[60],"execution.":[61],"This":[62,128],"paper":[63],"proposes":[64],"efficient":[66],"optimization":[68],"method":[69,206,258],"offline":[72],"preprocessing":[73,238],"tree-structured":[75],"strategies":[76],"address":[78],"challenges":[80],"low":[85],"execution":[86],"efficiency":[87],"caused":[88],"by":[89,109,211],"nature":[92],"RPQs":[96],"(KRPQs).":[97],"The":[98],"contributions":[100],"this":[102],"work":[103],"include:":[104],"(i)":[105],"index":[107,138,251],"tree:":[108],"precomputing":[110],"materializing":[112],"predicate":[116],"paths":[117],"offline,":[118],"are":[122],"transformed":[123],"into":[124],"non-recursive":[125],"SPARQL":[126],"queries.":[127,235],"allows":[129],"direct":[130],"retrieval":[131],"answer":[133],"branches":[134],"from":[135,183],"preconstructed":[137],"tree,":[139],"eliminating":[140],"redundant":[141,165],"computations":[142],"reducing":[144],"complexity.":[146],"(ii)":[147],"Selectivity-driven":[148],"dynamic":[149],"optimization:":[150],"heuristic":[152],"cost":[153],"model":[154],"estimates":[155],"result":[157],"sizes":[158],"guide":[160],"plan":[162],"generation,":[163],"minimizing":[164],"operations.":[166],"(3)":[167],"Query":[168],"decomposition":[169,176],"tree":[170],"nested":[172,179,196,234],"KRPQs:":[173],"hierarchical":[175],"algorithm":[177],"processes":[178],"closures":[181],"layer-by-layer":[182],"inner":[184],"outer":[186],"expressions,":[187],"overcoming":[188],"limitations":[189],"existing":[191],"methods":[192],"in":[193,250],"handling":[194],"complex":[195,233],"structures.":[197],"Experiments":[198,254],"RDF":[201,269],"datasets":[202],"demonstrate":[203],"that":[204,256],"reduces":[207],"average":[208],"response":[209],"times":[210],"50%\u201370%":[212],"single-predicate":[214],"expression-based":[216],"compared":[220],"systems":[222],"like":[223],"Virtuoso,":[224],"Jena,":[225],"KRPQ,":[227],"with":[228],"over":[229],"60%":[230],"improvement":[231],"Additionally,":[236],"multithreaded":[237],"pool":[241],"optimizations":[242],"achieve":[243],"up":[244],"76$\\times":[247],"$":[248],"reduction":[249],"construction":[252],"time.":[253],"show":[255],"can":[259],"significantly":[260],"reduce":[261],"time":[263],"KRPQs":[265],"large":[268],"graphs.":[270]},"counts_by_year":[],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}