{"id":"https://openalex.org/W2117430100","doi":"https://doi.org/10.1093/comjnl/bxq055","title":"A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization","display_name":"A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization","publication_year":2010,"publication_date":"2010-07-11","ids":{"openalex":"https://openalex.org/W2117430100","doi":"https://doi.org/10.1093/comjnl/bxq055","mag":"2117430100"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxq055","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq055","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/A5108438338","display_name":"Yizhong Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y. Wu","raw_affiliation_strings":["School of Informatics and Computing, Lindley Hall, Indiana University, Bloomington, IN 47405, USA"],"affiliations":[{"raw_affiliation_string":"School of Informatics and Computing, Lindley Hall, Indiana University, Bloomington, IN 47405, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110598353","display_name":"Dirk Van Gucht","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Van Gucht","raw_affiliation_strings":["School of Informatics and Computing, Lindley Hall, Indiana University, Bloomington, IN 47405, USA"],"affiliations":[{"raw_affiliation_string":"School of Informatics and Computing, Lindley Hall, Indiana University, Bloomington, IN 47405, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016874794","display_name":"Marc Gyssens","orcid":"https://orcid.org/0000-0002-5197-2817"},"institutions":[{"id":"https://openalex.org/I4210127597","display_name":"Transnational University Limburg","ror":"https://ror.org/02xyaf767","country_code":"BE","type":"education","lineage":["https://openalex.org/I4210127597"]},{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"M. Gyssens","raw_affiliation_strings":["Faculty of Sciences, Hasselt University & Transnational University of Limburg, Agoralaan, Bldg D, 3590 Diepenbeek, Belgium"],"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, Hasselt University & Transnational University of Limburg, Agoralaan, Bldg D, 3590 Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597","https://openalex.org/I878454856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079333668","display_name":"Jan Paredaens","orcid":null},"institutions":[{"id":"https://openalex.org/I149213910","display_name":"University of Antwerp","ror":"https://ror.org/008x57b05","country_code":"BE","type":"education","lineage":["https://openalex.org/I149213910"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"J. Paredaens","raw_affiliation_strings":["Department of Mathematics & Computer Science, University of Antwerp, Bldg. G, Middelheimlaan 1, 2020 Antwerpen, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, University of Antwerp, Bldg. G, Middelheimlaan 1, 2020 Antwerpen, Belgium","institution_ids":["https://openalex.org/I149213910"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108438338"],"corresponding_institution_ids":["https://openalex.org/I4210119109"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":2.7063,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.91091815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"54","issue":"7","first_page":"1091","last_page":"1118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9947999715805054,"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"}},{"id":"https://openalex.org/T10601","display_name":"Handwritten Text Recognition Techniques","score":0.9735000133514404,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.8260817527770996},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.815723180770874},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.7043924927711487},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6549813747406006},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6105759143829346},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5491294860839844},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5230147242546082},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5021522045135498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4397600293159485},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4307498633861542},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.42030495405197144},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.374711811542511},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.314301460981369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30874359607696533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30200135707855225},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.23275640606880188},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1995316445827484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1616789996623993},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14581015706062317},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.0730675458908081},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06425157189369202}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8260817527770996},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.815723180770874},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.7043924927711487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6549813747406006},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6105759143829346},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5491294860839844},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5230147242546082},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5021522045135498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4397600293159485},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4307498633861542},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.42030495405197144},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.374711811542511},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.314301460981369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30874359607696533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30200135707855225},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.23275640606880188},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1995316445827484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1616789996623993},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14581015706062317},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.0730675458908081},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06425157189369202},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxq055","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq055","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"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/12114","is_oa":false,"landing_page_url":"http://hdl.handle.net/1942/12114","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4387929624","https://openalex.org/W1601244756","https://openalex.org/W2258149899","https://openalex.org/W3000294084","https://openalex.org/W2038650947","https://openalex.org/W1964605444","https://openalex.org/W2222550902","https://openalex.org/W2158405910","https://openalex.org/W2124269710","https://openalex.org/W1759713541"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,49,57,63,117],"expressiveness":[3,23,118],"of":[4,8,24,51,56,105,119,123,155,167],"a":[5,54,78,91,101,130,146,164],"positive":[6],"fragment":[7,104],"path":[9,168],"queries,":[10,53],"denoted":[11],"Path+,":[12],"on":[13,170],"documents":[14],"that":[15,34,96,138],"can":[16,89,97,142],"be":[17,98,143],"represented":[18],"as":[19,45,47],"node-labeled":[20],"trees.":[21],"The":[22,69,153],"Path+":[25,35,76,82,92,106,120],"is":[26,36,134],"studied":[27],"from":[28,72],"two":[29,42],"angles.":[30],"First,":[31],"we":[32,88,115],"establish":[33],"equivalent":[37,148],"in":[38,100,121,129],"expressive":[39],"power":[40],"to":[41,48,75,126,136,145,162],"particular":[43],"subfragments,":[44],"well":[46],"class":[50,166],"tree":[52,73,140,151],"subclass":[55],"first-order":[58],"conjunctive":[59],"queries":[60,74,169],"defined":[61],"over":[62],"label,":[64],"parent\u2013child":[65],"and":[66,149],"child\u2013parent":[67],"predicates.":[68],"translation":[70],"algorithm":[71],"yields":[77,158],"normal":[79,86],"form":[80],"for":[81,107],"queries.":[83],"Using":[84],"this":[85],"form,":[87],"decompose":[90],"query":[93,141],"into":[94],"subqueries":[95],"expressed":[99],"very":[102],"small":[103],"which":[108],"efficient":[109],"evaluation":[110],"strategies":[111],"are":[112],"available.":[113],"Second,":[114],"characterize":[116],"terms":[122],"its":[124],"ability":[125],"resolve":[127],"nodes":[128],"document.":[131],"This":[132],"result":[133],"used":[135],"show":[137],"each":[139],"translated":[144],"unique,":[147],"minimal":[150],"query.":[152],"combination":[154],"these":[156],"results":[157],"an":[159],"effective":[160],"strategy":[161],"evaluate":[163],"large":[165],"documents.":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}