摘要
DespiteextensiveresearchonR-trees,mostoftheproposedschemeshavenotbeenintegratedintoexistingDBMSowingtothelackofprotocolsofconcurrencycontrol.R-linktreeisanacceptabledatastructuretodealwiththisissue,butproblemslikephantomstillexist.Inthispaper,wefocusonaconflictdetectionschemebasedonR-linktreeforcompleteconcurrencycontrol.Anin-memoryoperationcontrollistisdesignedtosuspendconflictingoperations.Themainfeaturesofthisapproachare(1)itcanbeimplementedeasilyanddoesnotneedanyextrainformation;(2)Nodeadlocksareinvolvedinlockingscheme;(3)Non-conflictingoperationsarenotrestricted;and(4)PhantomproblemsinR-linktreeareavoidedthroughbeforehandpredication.Theexperimentresultsshowthatthisschemeiscorrectandgainsbettersystemperformance.
出版日期
2003年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
