{"id":"https://openalex.org/W2028336642","doi":"https://doi.org/10.1145/2815072.2815081","title":"Relative expressive power of downward fragments of navigational query languages on trees and chains","display_name":"Relative expressive power of downward fragments of navigational query languages on trees and chains","publication_year":2015,"publication_date":"2015-10-27","ids":{"openalex":"https://openalex.org/W2028336642","doi":"https://doi.org/10.1145/2815072.2815081","mag":"2028336642"},"language":"en","primary_location":{"id":"doi:10.1145/2815072.2815081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2815072.2815081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Database Programming Languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109581854","display_name":"Jelle Hellings","orcid":"https://orcid.org/0000-0003-0290-1438"},"institutions":[{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]},{"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"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Jelle Hellings","raw_affiliation_strings":["University of Hasselt, Belgium / Transnational University of Limburg, Belgium","University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium","institution_ids":["https://openalex.org/I4210127597"]},{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#","institution_ids":["https://openalex.org/I878454856"]}]},{"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/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]},{"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"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Marc Gyssens","raw_affiliation_strings":["University of Hasselt, Belgium / Transnational University of Limburg, Belgium","University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium","institution_ids":["https://openalex.org/I4210127597"]},{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#","institution_ids":["https://openalex.org/I878454856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047960393","display_name":"Yuqing Wu","orcid":"https://orcid.org/0009-0001-1409-6993"},"institutions":[{"id":"https://openalex.org/I177881444","display_name":"Pomona College","ror":"https://ror.org/0074grg94","country_code":"US","type":"education","lineage":["https://openalex.org/I177881444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuqing Wu","raw_affiliation_strings":["Pomona College, USA","Pomona College (USA)"],"affiliations":[{"raw_affiliation_string":"Pomona College, USA","institution_ids":["https://openalex.org/I177881444"]},{"raw_affiliation_string":"Pomona College (USA)","institution_ids":["https://openalex.org/I177881444"]}]},{"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","Indiana University , USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]},{"raw_affiliation_string":"Indiana University , USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089823917","display_name":"Jan Van den Bussche","orcid":"https://orcid.org/0000-0003-0072-3252"},"institutions":[{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]},{"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"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jan Van den Bussche","raw_affiliation_strings":["University of Hasselt, Belgium / Transnational University of Limburg, Belgium","University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium","institution_ids":["https://openalex.org/I4210127597"]},{"raw_affiliation_string":"University of Hasselt, Belgium / Transnational University of Limburg, Belgium#TAB#","institution_ids":["https://openalex.org/I878454856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022558461","display_name":"Stijn Vansummeren","orcid":"https://orcid.org/0000-0001-7793-9049"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Stijn Vansummeren","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019818981","display_name":"George Fletcher","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George H. L. Fletcher","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands","Eindhoven University of Technology, Netherlands,"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands,","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5109581854"],"corresponding_institution_ids":["https://openalex.org/I4210127597","https://openalex.org/I878454856"],"apc_list":null,"apc_paid":null,"fwci":1.1577,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78743323,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9995999932289124,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9987000226974487,"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/intersection","display_name":"Intersection (aeronautics)","score":0.7456551194190979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6896159648895264},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6602915525436401},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.627936065196991},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5233587026596069},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5226112008094788},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5036067366600037},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.49925971031188965},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.499159574508667},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.49463769793510437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.493417888879776},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46590548753738403},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.46252211928367615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30538228154182434},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.24688270688056946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2123454213142395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20189037919044495},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19335302710533142},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18824106454849243}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7456551194190979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6896159648895264},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6602915525436401},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.627936065196991},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5233587026596069},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5226112008094788},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5036067366600037},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.49925971031188965},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.499159574508667},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.49463769793510437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.493417888879776},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46590548753738403},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.46252211928367615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30538228154182434},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.24688270688056946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2123454213142395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20189037919044495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19335302710533142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18824106454849243},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/2815072.2815081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2815072.2815081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Database Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/228321","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/228321","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: Proceedings of the 15th Symposium on Database Programming Languages. ACM","raw_type":"info:ulb-repo/semantics/openurl/proceeding"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/21032","is_oa":false,"landing_page_url":"http://hdl.handle.net/1942/21032","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/conferenceObject"},{"id":"pmh:oai:library.tue.nl:883094","is_oa":false,"landing_page_url":"http://repository.tue.nl/883094","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:pure.tue.nl:openaire_cris_publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hellings , J A J , Fletcher , G H L , Gyssens , M , Wu , Y , Van Gucht , D , Van den Bussche , J & Vansummeren , S 2015 , Relative expressive power of downward fragments of navigational query languages on trees and chains . in 15th Symposium on Data Base Programming Languages (DBPL), 27 October 2015, Pittsburgh, Pennsylvania .","raw_type":"contributionToPeriodical"},{"id":"pmh:tue:oai:pure.tue.nl:publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"15th Symposium on Data Base Programming Languages (DBPL), 27 October 2015, Pittsburgh, Pennsylvania","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/686b6cc4-ddb0-4ac8-80d7-ac3bb14d25aa","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hellings , J A J , Fletcher , G H L , Gyssens , M , Wu , Y , Van Gucht , D , Van den Bussche , J & Vansummeren , S 2015 , Relative expressive power of downward fragments of navigational query languages on trees and chains . in 15th Symposium on Data Base Programming Languages (DBPL), 27 October 2015, Pittsburgh, Pennsylvania .","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W142969493","https://openalex.org/W1489366126","https://openalex.org/W1528943166","https://openalex.org/W1664954303","https://openalex.org/W1971852817","https://openalex.org/W1988580879","https://openalex.org/W2002089154","https://openalex.org/W2003517056","https://openalex.org/W2006006495","https://openalex.org/W2034956447","https://openalex.org/W2059052871","https://openalex.org/W2117430100","https://openalex.org/W2118328008","https://openalex.org/W2128710701","https://openalex.org/W2137935204","https://openalex.org/W2144171837","https://openalex.org/W2155066775","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2185907055","https://openalex.org/W2294034341","https://openalex.org/W2611888112","https://openalex.org/W2624871385","https://openalex.org/W2962721563","https://openalex.org/W2988119170","https://openalex.org/W4285719527","https://openalex.org/W6641506132"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2383282217","https://openalex.org/W2012063573","https://openalex.org/W2391133415","https://openalex.org/W2371151875","https://openalex.org/W2376206211","https://openalex.org/W2152776432","https://openalex.org/W2605526166"],"abstract_inverted_index":{"Motivated":[0],"by":[1,33],"the":[2,6,12,38,42,51,54,71,99,117],"continuing":[3],"interest":[4],"in":[5],"tree":[7],"data":[8],"model,":[9],"we":[10,29,58,94,108,122],"study":[11,50,68],"expressive":[13,55],"power":[14,56],"of":[15,18,73,103,116],"downward":[16],"fragments":[17],"navigational":[19,26,118],"query":[20,27,119],"languages":[21,120],"on":[22,53,79,85,134],"trees.":[23,135],"The":[24],"basic":[25],"language":[28],"consider":[30],"expresses":[31],"queries":[32,75],"building":[34],"binary":[35],"relations":[36,40],"from":[37],"edge":[39],"and":[41,47,65,76,81,84,87,130],"identity":[43],"relation,":[44],"using":[45],"composition":[46],"union.":[48],"We":[49,67],"effects":[52],"when":[57,132],"add":[59],"transitive":[60],"closure,":[61],"projections,":[62],"coprojections,":[63],"intersection,":[64],"difference.":[66],"expressiveness":[69],"at":[70],"level":[72],"boolean":[74],"path":[77],"queries,":[78],"labeled":[80,86],"unlabeled":[82,88],"trees,":[83],"chains.":[89],"In":[90,106],"all":[91],"these":[92],"cases,":[93],"are":[95],"able":[96,110],"to":[97,111],"present":[98],"complete":[100],"Hasse":[101],"diagram":[102],"relative":[104],"expressiveness.":[105],"particular,":[107],"were":[109],"decide,":[112],"for":[113],"each":[114],"fragment":[115],"that":[121],"study,":[123],"whether":[124],"it":[125],"is":[126],"closed":[127],"under":[128],"difference":[129],"intersection":[131],"applied":[133]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}