{"id":"https://openalex.org/W2171359627","doi":"https://doi.org/10.1137/s0097539797326319","title":"Restructuring Partitioned Normal Form Relations without Information Loss","display_name":"Restructuring Partitioned Normal Form Relations without Information Loss","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2171359627","doi":"https://doi.org/10.1137/s0097539797326319","mag":"2171359627"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797326319","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797326319","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068367622","display_name":"Millist W. Vincent","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Millist W. Vincent.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015725705","display_name":"Mark Levene","orcid":"https://orcid.org/0000-0001-8632-4732"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Levene.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8596,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81917731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"5","first_page":"1550","last_page":"1567"},"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.9997000098228455,"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.9997000098228455,"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.9959999918937683,"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.992900013923645,"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/equivalence-relation","display_name":"Equivalence relation","score":0.7671893835067749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566598773002625},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5385412573814392},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5110891461372375},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5065549612045288},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.48151645064353943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46959343552589417},{"id":"https://openalex.org/keywords/nested-set-model","display_name":"Nested set model","score":0.45365750789642334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44821327924728394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4366837441921234},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4207462668418884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31201064586639404},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.2754082679748535},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.22121018171310425}],"concepts":[{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.7671893835067749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566598773002625},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5385412573814392},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5110891461372375},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5065549612045288},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.48151645064353943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46959343552589417},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.45365750789642334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44821327924728394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4366837441921234},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4207462668418884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31201064586639404},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.2754082679748535},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22121018171310425},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539797326319","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797326319","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:CiteSeerX.psu:10.1.1.43.8763","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.unisa.edu.au/~cismwv/papers/COMAD97nest.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.8921","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.unisa.edu.au/~cismwv/papers/SIAMpaperfinal.ps","raw_type":"text"},{"id":"pmh:oai:eprints.bbk.ac.uk.oai2:44631","is_oa":false,"landing_page_url":"https://eprints.bbk.ac.uk/id/eprint/44631/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400466","display_name":"BIROn (Birkbeck, University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98259816","host_organization_name":"Birkbeck, University of London","host_organization_lineage":["https://openalex.org/I98259816"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W135323631","https://openalex.org/W206938344","https://openalex.org/W1493559668","https://openalex.org/W1497921804","https://openalex.org/W1503955515","https://openalex.org/W1534456577","https://openalex.org/W1558832481","https://openalex.org/W1561760692","https://openalex.org/W1567727685","https://openalex.org/W1585806150","https://openalex.org/W1721591907","https://openalex.org/W1969375478","https://openalex.org/W1974100509","https://openalex.org/W1975355536","https://openalex.org/W1989814238","https://openalex.org/W1999049787","https://openalex.org/W2002102365","https://openalex.org/W2025151754","https://openalex.org/W2030034817","https://openalex.org/W2047776098","https://openalex.org/W2057852703","https://openalex.org/W2060805613","https://openalex.org/W2081053428","https://openalex.org/W2089781037","https://openalex.org/W2100220081","https://openalex.org/W2120533455","https://openalex.org/W2143307282","https://openalex.org/W2146791030","https://openalex.org/W2185907055"],"related_works":["https://openalex.org/W1598356149","https://openalex.org/W2378405769","https://openalex.org/W4247436880","https://openalex.org/W2062503615","https://openalex.org/W2752896058","https://openalex.org/W2064989302","https://openalex.org/W1503929941","https://openalex.org/W3021469126","https://openalex.org/W1983426508","https://openalex.org/W2156982617"],"abstract_inverted_index":{"Nested":[0],"relations":[1,13],"in":[2,17,70],"partitioned":[3],"normal":[4],"form":[5],"(PNF)":[6],"are":[7,15,105,125,133],"an":[8],"important":[9,69],"subclass":[10],"of":[11,27,55,87,93,115,152,154],"nested":[12,36,50,97],"that":[14,102,130],"useful":[16],"many":[18,71],"applications.":[19],"In":[20],"this":[21],"paper":[22,89],"we":[23],"address":[24],"the":[25,60,88,112,120,131,139,147],"question":[26],"determining":[28],"when":[29],"every":[30],"PNF":[31,44],"relation":[32,37,45,51],"stored":[33,46],"under":[34,47],"one":[35],"scheme":[38,52,123,141],"can":[39,143],"be":[40,144],"transformed":[41,145],"into":[42,146],"another":[43],"a":[48,150,155],"different":[49],"without":[53],"loss":[54],"information,":[56],"referred":[57],"to":[58],"as":[59,76],"two":[61,91,103,113,121],"schemes":[62,104,132],"being":[63],"data":[64,94,106],"equivalent.":[65,126],"This":[66],"issue":[67],"is":[68,101,129],"database":[72],"application":[73],"areas":[74],"such":[75],"view":[77],"processing,":[78],"schema":[79,82],"integration,":[80],"and":[81,109,136,159],"evolution.":[83],"The":[84,99,127],"main":[85],"result":[86],"provides":[90],"characterizations":[92],"equivalence":[95],"for":[96],"schemes.":[98],"first":[100],"equivalent":[107,134],"if":[108,111,135,138],"only":[110,137],"sets":[114],"multivalued":[116],"dependencies":[117],"induced":[118],"by":[119,149],"corresponding":[122,140],"trees":[124,142],"second":[128],"other":[148],"sequence":[151],"applications":[153],"local":[156],"restructuring":[157],"operator":[158],"its":[160],"inverse.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}