{"id":"https://openalex.org/W2083001584","doi":"https://doi.org/10.1137/s0097539790188168","title":"A Grammar-Based Approach Towards Unifying Hierarchical Data Models","display_name":"A Grammar-Based Approach Towards Unifying Hierarchical Data Models","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2083001584","doi":"https://doi.org/10.1137/s0097539790188168","mag":"2083001584"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539790188168","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790188168","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/1977714/Metis148719.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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/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":["BE","US"],"is_corresponding":true,"raw_author_name":"Marc Gyssens","raw_affiliation_strings":["Computer Science Department, Indiana University, Bloomington, Indiana 47405-4101. 1093 1094","Department of Math and Computer Science, University of Antwerp (UIA), B-2610 Antwerpen, Belgium","tDepartment WNI, University of Limburg (LUC), B-3590 Diepenbeek, Belgium"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Indiana University, Bloomington, Indiana 47405-4101. 1093 1094","institution_ids":["https://openalex.org/I4210119109"]},{"raw_affiliation_string":"Department of Math and Computer Science, University of Antwerp (UIA), B-2610 Antwerpen, Belgium","institution_ids":[]},{"raw_affiliation_string":"tDepartment WNI, University of Limburg (LUC), B-3590 Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079333668","display_name":"Jan Paredaens","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Paredaens","raw_affiliation_strings":["Mathematics and Computer Science"],"affiliations":[{"raw_affiliation_string":"Mathematics and Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110598353","display_name":"Dirk Van Gucht","orcid":null},"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/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":["BE","US"],"is_corresponding":false,"raw_author_name":"Dirk Van Gucht","raw_affiliation_strings":["tDepartment WNI, University of Limburg (LUC), B-3590 Diepenbeek, Belgium","Computer Science Department, Indiana University, Bloomington, Indiana 47405-4101. 1093 1094","Department of Math and Computer Science, University of Antwerp (UIA), B-2610 Antwerpen, Belgium"],"affiliations":[{"raw_affiliation_string":"tDepartment WNI, University of Limburg (LUC), B-3590 Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597"]},{"raw_affiliation_string":"Computer Science Department, Indiana University, Bloomington, Indiana 47405-4101. 1093 1094","institution_ids":["https://openalex.org/I4210119109"]},{"raw_affiliation_string":"Department of Math and Computer Science, University of Antwerp (UIA), B-2610 Antwerpen, Belgium","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016874794"],"corresponding_institution_ids":["https://openalex.org/I4210119109","https://openalex.org/I4210127597"],"apc_list":null,"apc_paid":null,"fwci":0.5386,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.73376321,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"6","first_page":"1093","last_page":"1137"},"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.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"}},"topics":[{"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9979000091552734,"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/decidability","display_name":"Decidability","score":0.6971458196640015},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6466959714889526},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6323431134223938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5984845161437988},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5334079265594482},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.517646849155426},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.49142587184906006},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.4869168996810913},{"id":"https://openalex.org/keywords/categorial-grammar","display_name":"Categorial grammar","score":0.47362276911735535},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.47162675857543945},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4255618751049042},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4255504608154297},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4252534806728363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.390556663274765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37061816453933716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35806959867477417},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34572693705558777},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.33740711212158203},{"id":"https://openalex.org/keywords/emergent-grammar","display_name":"Emergent grammar","score":0.33254703879356384},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.3129524886608124},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2571321129798889},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.2324191927909851},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.1686069369316101},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11514833569526672},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08177453279495239}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6971458196640015},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6466959714889526},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6323431134223938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5984845161437988},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5334079265594482},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.517646849155426},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.49142587184906006},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.4869168996810913},{"id":"https://openalex.org/C840598","wikidata":"https://www.wikidata.org/wiki/Q1841499","display_name":"Categorial grammar","level":5,"score":0.47362276911735535},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.47162675857543945},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4255618751049042},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4255504608154297},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4252534806728363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.390556663274765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37061816453933716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35806959867477417},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34572693705558777},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.33740711212158203},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.33254703879356384},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.3129524886608124},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2571321129798889},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2324191927909851},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.1686069369316101},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11514833569526672},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08177453279495239},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539790188168","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790188168","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/719e13c0-442b-4b07-9db2-f84fff9720f7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/719e13c0-442b-4b07-9db2-f84fff9720f7","pdf_url":"https://pure.tue.nl/ws/files/1977714/Metis148719.pdf","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":"Gyssens, M, Paredaens, J & Van Gucht, D 1994, 'A grammar-based approach towards unifying hierarchical data models', SIAM Journal on Computing, vol. 23, no. 6, pp. 1093-1137. https://doi.org/10.1137/S0097539790188168","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/719e13c0-442b-4b07-9db2-f84fff9720f7","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/719e13c0-442b-4b07-9db2-f84fff9720f7","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":"SIAM Journal on Computing, 23(6), 1093 - 1137. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/719e13c0-442b-4b07-9db2-f84fff9720f7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/719e13c0-442b-4b07-9db2-f84fff9720f7","pdf_url":"https://pure.tue.nl/ws/files/1977714/Metis148719.pdf","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":"Gyssens, M, Paredaens, J & Van Gucht, D 1994, 'A grammar-based approach towards unifying hierarchical data models', SIAM Journal on Computing, vol. 23, no. 6, pp. 1093-1137. https://doi.org/10.1137/S0097539790188168","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2083001584.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W180578187","https://openalex.org/W299519334","https://openalex.org/W1585806150","https://openalex.org/W1968945891","https://openalex.org/W2002102365","https://openalex.org/W2006513683","https://openalex.org/W2017945996","https://openalex.org/W2122789628","https://openalex.org/W2130474477","https://openalex.org/W2147869465","https://openalex.org/W2945526390","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W1543466370","https://openalex.org/W2034628900","https://openalex.org/W2806881211","https://openalex.org/W1556880224","https://openalex.org/W2010708274","https://openalex.org/W1547374399","https://openalex.org/W2362563713","https://openalex.org/W1498792811","https://openalex.org/W2362876085","https://openalex.org/W4289745821"],"abstract_inverted_index":{"A":[0],"simple":[1],"model":[2,46],"for":[3,41],"representing":[4],"the":[5,15,27,30,33,37,52,64,67,74,86,92],"hierarchical":[6],"structure":[7],"of":[8,32,60,78],"information":[9,34],"is":[10,18,55,80],"proposed.":[11],"This":[12],"model,":[13,17],"called":[14,51,66],"grammatical":[16,53,68,87],"based":[19,56],"on":[20,57,70,73],"trees":[21],"that":[22],"are":[23,47,89,96],"generated":[24],"by":[25,36],"grammars;":[26],"grammars":[28],"describe":[29],"hierarchy":[31],"represented":[35],"trees.":[38,75],"Two":[39],"methods":[40,95],"querying":[42,94],"in":[43],"this":[44],"data":[45],"given.":[48],"The":[49,76],"first,":[50],"algebra,":[54],"a":[58],"set":[59],"primitive":[61],"grammar-oriented":[62],"operators,":[63],"second,":[65],"calculus,":[69],"local":[71],"transformations":[72],"semantics":[77],"both":[79],"formally":[81],"defined.":[82],"Decidability":[83],"issues":[84],"regarding":[85],"calculus":[88],"investigated.":[90],"Finally,":[91],"two":[93],"proved":[97],"to":[98],"be":[99],"equally":[100],"expressive.":[101]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}