




已阅读5页,还剩10页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
0外文原文DataBaseSystem1、IntroductionThedevelopmentofcorporatedatabaseswillbeoneofthemostimportantdata-processingactivitiesfortherestofthe1970s.Datewillbeincreasinglyregardedasavitalcorporateresource,whichmustbeorganizedsoastomaximizetheirvalue.Inadditiontothedatabaseswithinanorganization,avastnewdemandisgrowingfordatabaseservices,whichwillcollect,organize,andselldata.Thefilesofdatawhichcomputerscanusearegrowingatastaggeringrate.Thegrowthrateinthesizeofcomputerstorageisgreaterthanthegrowthinthesizeorpowerofanyothercomponentintheexplodingdataprocessingindustry.Themoredatathecomputershaveaccessto,thegreateristheirpotentialpower.Inallwalksoflifeandinallareasofindustry,databankswillchangetheareasofwhatitispossibleformantodo.Intheendofthiscentury,historianswilllookbacktothecomingofcomputerdatabanksandtheirassociatedfacilitiesasastepwhichchangedthenatureoftheevolutionofsociety,perhapseventuallyhavingagreatereffectonthehumanconditionthaneventheinventionoftheprintingpress.Somemostimpressivecorporategrowthstoriesofthegenerationarelargelyattributabletotheexplosivegrowthintheneedofinformation.Thevastmajorityofthisinformationisnotyetcomputerized.However,thecostofdatastoragehardwareisdroppingmorerapidlythanothercostsindataprocessing.Itwillbecomecheapertostoredataoncomputerfilesthantostorethemonpaper.Notonlyprintedinformationwillbestored.Thecomputerindustryisimprovingitscapabilitytostorelinedrawing,datainfacsimileform,photo-graphs,humanspeech,etc.Infact,anyformofinformationotherthanthemostintimatecommunicationsbetweenhumanscanbetransmittedandstoreddigitally.Therearetwomaintechnologydevelopmentslikelytobecomeavailableinthenearfuture.First,thereareelectromagneticdevicesthatwillholdmuchmoredatathandisksbut1havemuchlongeraccesstime.Second,therearesolid-statetechnologiesthatwillgivemicrosecondaccesstimebutcapacitiesaresmallerthandisks.Disksthemselvesmaybeincreasedincapacitysomewhat.Forthelongertermfuturethereareanumberofnewtechnologieswhicharecurrentlyworkinginresearchlabswhichmayreplacedisksandmayprovideverylargemicrosecond-access-timedevices.Asteadystreamofnewstoragedevicesisthuslikelytoreachthemarketplaceoverthenext5years,rapidlyloweringthecostofstoringdata.Giventheavailabletechnologies,itislikelythaton-linedatabaseswillusetwoorthreelevelsofstorage.Onesolid-statewithmicrosecondaccesstime,oneelectromagneticwithaccesstimeofafractionofasecond.Iftwo,three,orfourlevelsofstorageareused,physicalstorageorganizationwillbecomemorecomplex,probablywithpagingmechanismstomovedatabetweenthelevels;solid-statestorageoffersthepossibilityofparallelsearchoperationandassociativememory.Boththequantityofdatastoredandthecomplexityoftheirorganizationaregoingupbyleapsandbounds.Thefirsttrillionbiton-linestoresarenowinuse.inafewyearstime,storesofthissizemaybecommon.Aparticularlyimportantconsiderationindatabasedesignistostorethedatasothatthecanbeusedforawidevarietyofapplicationsandsothatthewaytheycanbechangedquicklyandeasily.Oncomputerinstallationpriortothedatabaseeraithasbeenremarkablydifficulttochangethewaydataareused.Differentprogrammersviewthedataindifferentwaysandconstantlywanttomodifythemasnewneedsarisemodification,however,cansetoffachainreactionofchangestoexistingprogramsandhencecanbeexceedinglyexpensivetoaccomplish.Consequently,dataprocessinghastendedtobecomefrozenintoitsolddatastructures.Toachieveflexibilityofdatausagethatisessentialinmostcommercialsituations.Twoaspectsofdatabasedesignareimportant.First,itshouldbepossibletointerrogateandsearchthedatabasewithoutthelengthyoperationofwritingprogramsinconventionalprogramminglanguages.Second,thedatashouldbeindependentoftheprogramswhich2usethemsothattheycanbeaddedtoorrestructuredwithouttheprogramsbeingchanged.Theworkofdesigningadatabaseisbecomingincreasingdifficult,especiallyifitistoperforminanoptimalfashion.Therearemanydifferentwaysinwhichdatacanbestructured,andtheyhavedifferenttypesofdataneedtobeorganizedindifferentways.Differentdatahavedifferentcharacteristics,whichoughttoeffectthedataorganization,anddifferentusershavefundamentallydifferentrequirements.Soweneedakindofdatabasemanagementsystem(DBMS)tomanagedata.Databasedesignusingtheentity-relationshipmodelbeginswithalistoftheentitytypesinvolvedandtherelationshipsamongthem.Thephilosophyofassumingthatthedesignerknowswhattheentitytypesareattheoutsetissignificantlydifferentfromthephilosophybehindthenormalization-basedapproach.Theentity-relationship(E-R)approachusesentity-relationshipdiagrams.TheE-RapproachrequiresseveralstepstoprodureastructurethatisacceptablebytheparticularDBMS.Thesestepsare:(1)Dataanalysis(2)Producingandoptimizingtheentitymodel.(3)Logicalschemadevelopment(4)Physicaldatabasedesignprocess.Developingadatabasestructurefromuserrequirementsiscalleddatabasesdesign.Mostpractitionersagreethattherearetwoseparatephasestothedatabasedesignprocess.Thedesignofalogicaldatabasestructurethatisprocessablebythedatabasemanagementsystem(DBMS)describestheusersviewofdata,andistheselectionofaphysicalstructuresuchastheindexedsequentialordirectaccessmethodoftheintendedDBMS.Currentdatabasedesigntechnologyshowsmanyresidualeffectsofitsoutgrowthfromsingle-recordfiledesignmethods.Filedesignisprimarilyapplicationprogramdependentsincethedatahasbeendefinedandstructuredintermsofindividualapplicationstousethem.TheadventofDBMSrevisedtheemphasisindataandprogramdesignapproaches.3Therearemanyinterlockingquestionsinthedesignofdata-basesystemsandmanytypesoftechniquethatonecanuseisanswertothequestionsomany;infact,thatoneoftenseesvaluableapproachesbeingoverlookedinthedesignandvitalquestionsnotbeingasked.Therewillsoonbenewstoragedevices,newsoftwaretechniques,andnewtypesofdatabases.Thedetailswillchange,butmostoftheprincipleswillremain.Therefore,thereadershouldconcentrateontheprinciples.2、DatabasesystemTheconceptionusedfordescribingfilesanddatabaseshasvariedsubstantiallyinthesameorganization.Adatabasemaybedefinedasacollectionofinterrelateddatastoredtogetherwithaslittleredundancyaspossibletoserveonormoreapplicationsinanoptimalfashion;thedataarestoredsothattheyareindependentofprogramswhichusethedata;acommonandcontrolledapproachisusedinaddingnewdataandinmodifyingandretrievingexistingdatawithinthedatabase.Onesystemissaidtocontainacollectionofdatabasesiftheyareentirelyseparateinstructure.Adatabasemaybedesignedforbatchprocessing,real-timeprocessing,orin-lineprocessing.Adatabasesysteminvolveapplicationprogram,DBMS,anddatabase.Oneofthemostimportantcharacteristicsofmostdatabasesisthattheywillconstantlyneedtochangeandgrow.Easyrestructuringofthedatabasemustbepossibleasnewdatatypesandnewapplicationsareadded.Therestructuringshouldbepossiblewithouthavingtorewritetheapplicationprogramandingeneralshouldcauseaslittleupheavalaspossible.Theeasewithwhichadatabasecanbechangedwillhaveamajoreffectontherateatwhichdata-processingapplicationcanbedevelopedinacorporation.Thetermdataindependenceisoftenquotedasbeingoneofthemainattributesofadatabase.Itimpliesthatthedataandtheapplicationprogramswhichusethemareindependentsothateithermaybechangedwithoutchangingtheother.Whenasinglesetofdataitemsservesavarietyofapplications,differentapplicationprogramsperceivedifferentrelationshipsbetweenthedataitems.Toalargeextent,data-baseorganizationis4concernedwiththerepresentationofrelationshipbetweendataitemsandrecordsaswellashowandwherethedataarestored.Adatabaseusedformanyapplicationscanhavemultipleinterconnectionsbetweenthedataitemaboutwhichwemaywishtorecord.Itcandescribestherealworld.Thedataitemrepresentsanattribute,andtheattributemustbeassociatedwiththerelevantentity.Wedesignvaluestotheattributes,oneattributehasaspecialsignificanceinthatitidentifiestheentity.Anattributeorsetofattributewhichthecomputerusestoidentifyarecordortupleisreferredtoasakey.Theprimarykeyisdefinedasthatkeyusedtouniquelyidentifyonerecordortuple.Theprimarykeyisofgreatimportancebecauseitisusedbythecomputerinlocatingtherecordortuplebymeansofanindexoraddressingalgorithm.Ifthefunctionofadatabaseweremerelytostoredata,itsorganizationwouldbesimple.Mostofthecomplexitiesarisefromthefactthatismustalsoshowtherelationshipsbetweenthevariousitemsofdatathatarestored.Itisdifferenttodescribethedatainlogicalorphysical.Thelogicaldatabasedescriptionisreferredtoasaschema.Aschemaisachartofthetypesofdatathatoneused.Itgivesthenamesoftheentitiesandattributes,andspecificstherelationsbetweenthem.Itisaframeworkintowhichthevaluesofthedata-itemscanbefitted.Wemustdistinguishbetweenarecordtypeandainstanceoftherecord.Whenwetalkabouta“personnelrecord”,thisisreallyarecordtype.Therearenodatavaluesassociatedwithit.Thetermschemaisusedtomeananoverallchartofallofthedataitemtypesandrecordtypesstoredinadataheuses.Manydifferentsubschemacanbederivedfromoneschema.Theschemaandthesubschemaarebothusedbythedata-basemanagementsystem,theprimaryfunctionofwhichistoservetheapplicationprogramsbyexecutingtheirdataoperations.ADBMSwillusuallybehandingmultipledatacallsconcurrently.Itmustorganizeitssystembufferssothatdifferentdataoperationscanbeinprocesstogether.Itprovidesa5datadefinitionlanguagetospecifytheconceptualschemaandmostlikely,someofthedetailsregardingtheimplementationoftheconceptualschemabythephysicalschema.Thedatadefinitionlanguageisahigh-levellanguage,enablingonetodescribetheconceptualschemaintermsofa“datamodel”.Thechoiceofadatamodelisadifficultone,sinceitmustberichenoughinstructuretodescribesignificantaspectsoftherealworld,yetitmustbepossibletodeterminefairlyautomaticallyanefficientimplementationoftheconceptualschemabyaphysicalschema.ItshouldbeemphasizedthatwhileaDBMSmightbeusedtobuildsmalldatabases,manydatabasesinvolvemillionsofbytes,andaninefficientimplementationcanbedisastrous.Wewilldiscussthedatamodelinthefollowing.3、ThreeDataModelsLogicalschemasaredefinedasdatamodelswiththeunderlyingstructureofparticulardatabasemanagementsystemssuperimposedonthem.Atthepresenttime,therearethreemainunderlyingstructuresfordatabasemanagementsystems.Theseare:RelationalHierarchicalNetworkThehierarchicalandnetworkstructureshavebeenusedforDBMSsincethe1960s.Therelationalstructurewasintroducedintheearly1970s.Intherelationalmodel,theentitiesandtheirrelationshipsarerepresentedbytwo-dimensionaltables.Everytablerepresentsanentityandismadeupofrowsandcolumns.Relationshipsbetweenentitiesarerepresentedbycommoncolumnscontainingidenticalvaluesfromadomainorrangeofpossiblevalues.Thelastuserispresentedwithasimpledatamodel.Hisandherrequestareformulatedintermsoftheinformationcontentanddonotreflectanycomplexitiesduetosystem-orientedaspects.Arelationaldatamodeliswhattheusersees,butitisnotnecessarilywhatwillbeimplementedphysically.Therelationaldatamodelremovesthedetailsofstoragestructureandaccessstrategyfromtheuserinterface.Themodelprovidesarelativelyhigherdegreeofdata.Tobeableto6makeuseofthispropertyoftherelationaldatamodelhowever,thedesignoftherelationsmustbecompleteandaccurate.AlthoughsomeDBMSbasedontherelationaldatamodelarecommerciallyavailabletoday,itisdifficulttoprovideacompletesetofoperationalcapabilitieswithrequiredefficiencyonalargescale.Itappearstodaythattechnologicalimprovementsinprovidingfasterandmorereliablehardwaremayanswerthequestionpositively.Thehierarchicaldatamodelisbasedonatree-likestructuremadeupofnodesandbranches.Anodeisacollectionofdataattributesdescribingtheentityatthatpoint.Thehighestnodeofthehierarchicaltreestructureiscalledaroot.Thenodesatsucceedinglowerlevelsarecalledchildren.Ahierarchicaldatamodelalwaysstartswitharootnode.Everynodeconsistsofoneormoreattributesdescribingtheentityatthatnode.Dependentnodescanfollowthesucceedinglevels.Thenodeintheprecedinglevelbecomestheparentnodeofthenewdependentnodes.Aparentnodecanhaveonechildnodeasadependentormanychildrennodes.Themajoradvantageofthehierarchicaldatamodelistheexistenceofprovendatabasemanagementsystemsthatusethehierarchicaldatamodelasthebasicstructure.Thereisareductionofdatadependencybutanychildnodeisaccessibleonlythroughitsparentnode,themany-tomanyrelationshipcanbeimplementedonlyinaclumsyway.Thisoftenresultsinaredundancyinstoreddata.Thenetworkdatamodelinterconnectstheentitiesofanenterpriseintoanetwork.Inthenetworkdatamodeladatabaseconsistsofanumberofareas.Anareacontainsrecords.Inturn,arecordmayconsistoffields.Asetwhichisagroupingofrecords,mayresideinanareaorspananumberofareas.Asettypeisbasedontheownerrecordtypeandthememberrecordtype.Themany-tomanyrelation-ship,whichoccursquitefrequentlyinreallifecanbeimplementedeasily.Thenetworkdatamodelisverycomplex,theapplicationprogrammermustbefamiliarwiththelogicalstructureofthedatabase.4、LogicalDesignandPhysicalDesignLogicaldesignofdatabasesismainlyconcernedwithsuperimposingtheconstructsofthedatabasemanagementsystemonthelogicaldatamodel.Therearethreemainly7models:hierarchical,relational,networkwehavementionedabove.Thephysicalmodelisaframeworkofthedatabasetobestoredonphysicaldevices.Themodelmustbeconstructedwitheveryregardgiventotheperformanceoftheresultingdatabase.Oneshouldcarryoutananalysisofthephysicalmodelwithaveragefrequenciesofoccurrencesofthegroupingsofthedataelements,withexpectedspaceestimates,andwithrespecttotimeestimatesforretrievingandmaintainingthedata.Thedatabasedesignermayfinditnecessarytohavemultipleentrypointsintoadatabase,ortoaccessaparticularsegmenttypewithmorethanonekey.Toprovidethistypeofaccess;itmaybenecessarytoinvertthesegmentonthekeys.ThephysicaldesignermusthaveexpertiseinknowledgeoftheDBMSfunctionsandunderstandingofthecharacteristicsofdirectaccessdevicesandknowledgeoftheapplications.Manydatabaseshavelinksbetweenonerecordandanother,calledpointers.Apointerisafieldinonerecordwhichindicateswhereasecondrecordislocatedonthestoragedevices.Recordsthatexistonstoragedevicesisagivenphysicalsequence.Thissequencingmaybeemployedforsomepurpose.Themostcommonpuposeisthatrecordsareneededinagivensequencebycertaindata-processingoperationsandsotheyarestoredinthatsequences.Differentapplicationsmayneedrecordsindifferentsequences.Themostcommonmethodoforderingrecordsistohavetheminsequencebyakeythatkeywhichismostcommonlyusedforaddressingthem.Anindexisrequiredtofindanyrecordwithoutalengthysearchofthefile.Ifthedatarecordsarelaidoutsequentiallybykey,theindexforthatkeycanbemuchsmallerthantheyarenonsequential.Hashinghasbeenusedforaddressingrandom-accessstoragessincetheyfirstcameintoexistenceinthemid-1950s.Butnobodyhadthetemeritytousethewordhashinguntil1968.Manysystemsanalysishasavoidedtheuseofhashinginthesuspicionthatitiscomplicated.Infact,itissimpletouseandhastwoimportantadvantagesoverindexing.8First,itfindsmostrecordswithonlyoneseekandsecond,insertionanddeletionscanbehandledwithoutaddedcomplexity.Indexing,however,canbeusedwithafilewhichissequentialbyprimekeyandthisisanoverridingadvantage,forsomebatch-pro-cessingapplications.Manydata-basesystemsusechainstointerconnectrecordsalso.Achainreferstoagroupofrecordsscatterswithinthefilesandinterconnectedbyasequenceofpointers.Thesoftwarethatisusedtoretrivethechainedrecordswillmakethemappeartotheapplicationprogrammerasacontiguouslogicalfile.Theprimarydisadvantageofchainedrecordsisthatmanyreadoperationsareneededinordertofollowlengthychains.Sometimesthisdoesnotmatterbecausetherecordshavetobereadanyway.Inmostsearchoperations,however,thechainshavetobefollowedthroughrecordswhichwouldnototherwisetoread.Insomefileorganizationsthechainscanbecontainedwithinblockedphysicalrecordssothatexcessivereadsdonotoccur.Ringshavebeenusedinmanyfileorganizations.Theyareusedtoeliminateredundancy.Whenaringorachainisenteredatapointsomedistancefromitshead,itmaybedesirabletoobtaintheinformationattheheadquicklywithoutsteppingthroughalltheinterveninglinks.5、DataDescriptionLanguagesItisnecessaryforboththeprogrammersandthedataadministratortobeabletodescribetheirdataprecisely;theydosobymeansofdatadescriptionlanguages.Adatadescriptionlanguageisthemeansofdeclaringtodata-basemanagementsystemwhatdatastructureswillbeused.Adatadescriptionlanguagesgivingalogicaldatadescriptionshouldperformthefolloeingfunctions:Itshouldgiveauniquenametoeachdata-itemtype,filetype,databaseandotherdatasubdivision.Itshouldidentifythetypesofdatasubdivisionsuchasdataitemsegment,recordandbasefile.Itmaydefinethetypeofencodingtheprogramusesinthedataitems(binary,9character,bitstring,etc.)Itmaydefinethelengthofthedataitemsandtherangeofthevaluesthatadataitemcanassume.Itmayspecifythesequenceofrecordsinafileorthesequenceofgroupsofrecordinthedatabase.Itmayspecifymeansofcheckingforerrorsinthedata.Itmayspecifyprivacylocksforpreventingunauthorizedreadingormodificationofthedata.Thesemayoperateatthedata-item,segment,record,fileordata-baselevelandifnecessarymaybeextendedtothecontents(value)ofindividualdataitems.Theauthorizationmay,ontheotherhand,beseparatedefined.Itismoresubjecttochangethanthedatastructures,andchangesinauthorizationproceduresshouldnotforcechangesinapplicationprograms.Alogicaldatadescriptionshouldnotspecifyaddressing,indexing,orsearchingtechniquesorspecifytheplacementofdataonthestorageunits,becausethesetopicsareinthedomainofphysical,notlogicalorganization.Itmaygiveanindicationofhowthedatawillbeusedorofsearchingrequirement.Sothatthephysicaltechniquecanbeselectedoptimallybutsuchindicationsshouldnotbelogicallylimiting.MostDBMShavetheirownlanguagesfordefiningtheschemasthatareused.Inmostcasesthesedatadescriptionlanguagesaredifferenttootherprogrammerlanguage,becauseotherprogrammerdonothavethecapabilitytodefinetovarietyofrelationshipthatmayexitintheschemas.10中文翻译数据库系统1、介绍在20世纪70年代后期综合数据库的发展是最重要的数据处理活动之一。数据越来越被视为一种重要的综合资源,它必须被组织以扩大他们的价值。另外,在组织内的数据库,对数据库服务将有大量的新要求,就是收集、组织和出售数据。计算机使用数据文件正以令人难以置信的速度增长。计算机存贮量大小的增长速度比爆炸式的数据处理工业中的任何其它元件在规模或能量上的增长速度大得多。计算机存取的数据越多,它们的潜能就越大,在所有社会生活及工业范围中,数据库将改变人们可能做到的领域,在本世纪末,历史学家回过来将把计算机数据库和其有关的设备的出现,作为改变社会发展的自然规律的步骤,或许比起印刷业的发明来,会对人类环境产生更大的影响。某些使人印象深刻的成长历程很大程度上归因于所需信息的爆长。这些信息的绝大多灵数尚未计算机化,然而,储存数据的硬件的花费比数据处理的其它花费更迅速地下降。而且数据储存在计算机文件上比储存在纸上更便宜,储存不仅仅是打印信息。计算机工业正在改进储存绘图、传真表格中的数据、照片、人类语言等等的能力。事实上,除了人类之间私下交流的信息以外,任何信息形式均可以数字化地传输和储存。在不久的将来,两种主要的技术有希望变得实用,首先,有一种电磁设备将比磁盘存贮更多的数据,但存取时间长;第二,有一种固态技术将给出微秒级存取时间,但容量比磁盘小。磁盘本身在某些能力上可能提高,在未来的一段长时期内,将有大量的目前还在研究室中服务的新技术代替磁盘,并可能提供更快的微秒级存取时间的设备,新储存设备的发展趋势稳定,因此很有希望在下一个五年中上市,并迅速地降低储存数据的成本。若给出可用的技
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2025黑龙江哈尔滨“丁香人才周”(春季)事业单位引才招聘模拟试卷及答案详解(全优)
- 2025年国家知识产权局知识产权检索咨询中心社会招聘(16人)考前自测高频考点模拟试题及答案详解参考
- 2025安徽芜湖市中西医结合医院(湾沚区总医院)招聘第三方救护车驾驶员(第二批)1人考前自测高频考点模拟试题完整参考答案详解
- 2025江西省财通供应链金融集团有限公司劳务派遣制人员招聘8人考前自测高频考点模拟试题及答案详解(有一套)
- 2025广东广州翰城房地产开发有限公司招聘工作人员、进入人员模拟试卷附答案详解
- 2025河南中医药大学招聘辅导员、行政岗等13名考前自测高频考点模拟试题及答案详解(考点梳理)
- 2025北京市房山区燕山教育委员会所属事业单位第一批招聘教师30人考前自测高频考点模拟试题及答案详解(名师系列)
- 2025南平延平峡阳镇卫生院招聘驾驶员模拟试卷及完整答案详解
- 2025河北保定市雄安新区雄县事业单位招聘89人模拟试卷(含答案详解)
- 2025广东珠海市第二批拟引进业务骨干人员模拟试卷及答案详解参考
- 第49部分:碳酸根、重碳酸根和氢氧根离子的测定 滴定法(报批稿)
- T/CAAM 0004-2023针刺临床试验中假针刺对照设置与报告指南
- 配网全过程管理
- 立陶宛语儿童文学的语言特点论文
- 民宿的内涵专题课件
- 高职高考数学复习第五章数列5-1数列课件
- 高一必修一英语单词默写表
- GB/T 40816.2-2024工业炉及相关工艺设备能量平衡测试及能效计算方法第2部分:钢加热炉
- 增值税发票清单模板
- 人教版六年级数学上册第一单元测试卷
- 2024年注册安全工程师生产技术押密试题及答案
评论
0/150
提交评论