LEADER 01989oam  2200457zu 450 
001 9910139115203321
005 20241212215900.0
010   $a9780769541020
010   $a076954102X
035   $a(CKB)2560000000009662
035   $a(SSID)ssj0000452332
035   $a(PQKBManifestationID)12167298
035   $a(PQKBTitleCode)TC0000452332
035   $a(PQKBWorkID)10468691
035   $a(PQKB)11511439
035   $a(NjHacI)992560000000009662
035   $a(EXLCZ)992560000000009662
100   $a20160829d2009      uy 
101 0 $aeng
135   $aur|||||||||||
181   $ctxt
182   $cc
183   $acr
200 10$a2009 Second International Workshop on Requirements Engineering and Law
210 31$a[Place of publication not identified]$cIEEE$d2009
215   $a1 online resource
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a9781424476961 
311 08$a1424476968 
330   $aRelational databases contain a large number intertwined transaction level facts that can collectively (or independently) represent innumerable business records. In this paper we present a framework for defining business records contained in a database system as queries and then specifying retention policies over them. We also highlight several key issues for both policy makers and database administrators to consider when designing and implementing records retention policies over relationally stored records. Records retention, relational databases, records management policies.
606   $aRequirements engineering$vCongresses
615  0$aRequirements engineering
676   $a005
702   $aieee
712 02$aInstitute of Electrical and Electronics Engineers.
712 12$aInternational Workshop on Requirements Engineering and Law
801  0$bPQKB
906   $aPROCEEDING
912   $a9910139115203321
996   $a2009 Second International Workshop on Requirements Engineering and Law$92522592
997   $aUNINA