{"id":"https://openalex.org/W1918640076","doi":"https://doi.org/10.1007/978-3-642-02843-4_14","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":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1918640076","doi":"https://doi.org/10.1007/978-3-642-02843-4_14","mag":"1918640076"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02843-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02843-4_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5047960393","display_name":"Yuqing Wu","orcid":"https://orcid.org/0009-0001-1409-6993"},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuqing Wu","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110598353","display_name":"Dirk Van Gucht","orcid":null},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dirk Van Gucht","raw_affiliation_strings":["Indiana University, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"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":"Marc Gyssens","raw_affiliation_strings":["Hasselt University & Transnational University of Limburg, Belgium"],"affiliations":[{"raw_affiliation_string":"Hasselt University & Transnational University of Limburg, 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":"Jan Paredaens","raw_affiliation_strings":["University of Antwerp, Belgium"],"affiliations":[{"raw_affiliation_string":"University of Antwerp, Belgium","institution_ids":["https://openalex.org/I149213910"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047960393"],"corresponding_institution_ids":["https://openalex.org/I592451"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16650485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983999729156494,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"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/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.841465175151825},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7815594673156738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7307961583137512},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.6906230449676514},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6063343286514282},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5352756381034851},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5216434597969055},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.47771120071411133},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.45682409405708313},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4534270465373993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4371787905693054},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.3538236618041992},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3046245872974396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2989634871482849},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.27598491311073303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23126426339149475},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.22714638710021973},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1548631489276886},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13374623656272888},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.06844073534011841}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.841465175151825},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7815594673156738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7307961583137512},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.6906230449676514},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6063343286514282},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5352756381034851},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5216434597969055},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.47771120071411133},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.45682409405708313},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4534270465373993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4371787905693054},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.3538236618041992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3046245872974396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2989634871482849},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.27598491311073303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23126426339149475},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22714638710021973},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1548631489276886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13374623656272888},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.06844073534011841},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-02843-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02843-4_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2fe791bf-16ca-4deb-a248-39c676778e4b","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2fe791bf-16ca-4deb-a248-39c676778e4b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wu, Y, Van Gucht, D, Gyssens, M & Paredaens, J 2009, A study of a positive fragment of path queries: Expressiveness, normal form, and minimization. in A P Sexton (ed.), Dataspace: The Final Frontier (26th British National Conference on Databases, BNCOD 26, Birmingham, UK, July 7-9, 2009. Proceedings). Lecture Notes in Computer Science, vol. 5588, Springer, Berlin, pp. 133-145. https://doi.org/10.1007/978-3-642-02843-4_14","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:663366","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=663366","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:663366","is_oa":false,"landing_page_url":"http://repository.tue.nl/663366","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/2fe791bf-16ca-4deb-a248-39c676778e4b","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2fe791bf-16ca-4deb-a248-39c676778e4b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dataspace: The Final Frontier (26th British National Conference on Databases, BNCOD 26, Birmingham, UK, July 7-9, 2009. Proceedings), 133 - 145","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W172857819","https://openalex.org/W194940788","https://openalex.org/W203985604","https://openalex.org/W1967483816","https://openalex.org/W1969312099","https://openalex.org/W1979514837","https://openalex.org/W1984218983","https://openalex.org/W1988580879","https://openalex.org/W1994081385","https://openalex.org/W1995213245","https://openalex.org/W2006006495","https://openalex.org/W2018944629","https://openalex.org/W2027156036","https://openalex.org/W2033176822","https://openalex.org/W2068157134","https://openalex.org/W2097396510","https://openalex.org/W2113836856","https://openalex.org/W2128710701","https://openalex.org/W2134826526","https://openalex.org/W2145565330","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2161728285","https://openalex.org/W2170702660","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4387929624","https://openalex.org/W1601244756","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","https://openalex.org/W2574914925"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}