DespiteextensiveresearchonR-trees,mostoftheproposedschemeshavenotbeenintegratedintoexistingDBMSowingtothelackofprotocolsofconcurrencycontrol.R-linktreeisanacceptabledatastructuretodealwiththisissue,butproblemslikephantomstillexist.Inthispaper,wefocusonaconflictdetectionschemebasedonR-linktreeforcompleteconcurrencycontrol.Anin-memoryoperationcontrollistisdesignedtosuspendconflictingoperations.Themainfeaturesofthisapproachare(1)itcanbeimplementedeasilyanddoesnotneedanyextrainformation;(2)Nodeadlocksareinvolvedinlockingscheme;(3)Non-conflictingoperationsarenotrestricted;and(4)PhantomproblemsinR-linktreeareavoidedthroughbeforehandpredication.Theexperimentresultsshowthatthisschemeiscorrectandgainsbettersystemperformance.