LEADER 03812nam  22006375  450 
001 996465734003316
005 20200629143033.0
010   $a3-540-47110-3
024 7 $a10.1007/3-540-55493-9
035   $a(CKB)1000000000233818
035   $a(SSID)ssj0000325081
035   $a(PQKBManifestationID)11234406
035   $a(PQKBTitleCode)TC0000325081
035   $a(PQKBWorkID)10321009
035   $a(PQKB)10263356
035   $a(DE-He213)978-3-540-47110-3
035   $a(PPN)15516452X
035   $a(EXLCZ)991000000000233818
100   $a20121227d1992      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 14$aThe Nested Universal Relation Database Model$b[electronic resource] /$fby Mark Levene
205   $a1st ed. 1992.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992.
215   $a1 online resource (X, 182 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v595
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-55493-9 
327   $aThe underlying database models -- The null extended nested relational model -- Null extended data dependencies and the extended chase -- A universal relation model for a nested database -- A universal relation model for a single nested relation -- Concluding remarks and ongoing research.
330   $aThis monograph describes a method of data modelling whose basic aim is to make databases easier to use by providing them with logical data independence. To achieve this, the nested UR (universal relation) model is defined by extending the classical UR model to nested relations. Nested relations generalize flat relations and allow hierarchically structured objects to be modelled directly, whereas the classical UR model allows the user to view the database as if it were composed of a single flat relation. The author presents a comprehensive formalisation of the nested relational model, which incorporated null values into the model. Functional data dependencies and the classical notion of lossless decomposition are extended to nested relations and an extended chase procedure is defined to test the satisfaction of the data dependencies. The nested UR model is defined, and the classical UR model is shown to be a special case of the nested model.This implies that an UR interface canbe implemented by using the nested UR model, thus gaining the full advantages of nested relations over flat relations.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v595
606   $aData structures (Computer science)
606   $aDatabase management
606   $aComputers
606   $aSoftware engineering
606   $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009
606   $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
615  0$aData structures (Computer science).
615  0$aDatabase management.
615  0$aComputers.
615  0$aSoftware engineering.
615 14$aData Structures and Information Theory.
615 24$aDatabase Management.
615 24$aComputation by Abstract Devices.
615 24$aSoftware Engineering.
676   $a005.75/6
700   $aLevene$b Mark$4aut$4http://id.loc.gov/vocabulary/relators/aut$0311716
906   $aBOOK
912   $a996465734003316
996   $aNested universal relation database model$91492489
997   $aUNISA