CAJ | 학술논문

基于TPR-树(Time parameterized R-tree,TPR-树)提出的LUTPR-树采用基于主存的更新方法,更新对象的删除操作在内存中完成,故避免了TPR-树中对象更新所导致的耗时的查找操作.同时,LUTPR-树能有效利用主存资源.实验结果表明,与TPR-树相比,LUTPR-树以牺牲很小部分查询性能为代价,大大提高了更新效率,更加适用于更新密集型应用.
기우TPR-수(Time parameterized R-tree,TPR-수)제출적LUTPR-수채용기우주존적경신방법,경신대상적산제조작재내존중완성,고피면료TPR-수중대상경신소도치적모시적사조조작.동시,LUTPR-수능유효이용주존자원.실험결과표명,여TPR-수상비,LUTPR-수이희생흔소부분사순성능위대개,대대제고료경신효솔,경가괄용우경신밀집형응용.
A novel TPR-tree based indexing structure,called the(Lazy update TPR)LUTPR-tree for minimizing the updates COSt,is presented.The LUTPR-tree processes object deletions in a memorybased approach,thus avoiding disk accesses for cleaning the obsolete entries during the update process.And the LUTPR-tree can efficiently use the available main-memory.Experimental results igdicate that the LUTPR-tree efficiency can improve compared with the TPR-tree in update-intensive applications.