این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
صفحه اصلی
درباره پایگاه
فهرست سامانه ها
الزامات سامانه ها
فهرست سازمانی
تماس با ما
JCR 2016
جستجوی مقالات
دوشنبه 24 آذر 1404
مدیریت فناوری اطلاعات
، جلد ۱۷، شماره Special Issue، صفحات ۸۷-۱۰۷
عنوان فارسی
چکیده فارسی مقاله
کلیدواژههای فارسی مقاله
عنوان انگلیسی
Incorporating Retroactive Operations in Large Temporal Databases Using Retroactive B-Tree
چکیده انگلیسی مقاله
Temporal databases, quickly rising in size, are distinguished by their capacity to maintain the older version of data objects against actions on them, allowing logical deletions. Queries for historical data are particularly costly due to the linear scanning of temporal versions. Temporal data structures like time-split B-Tree or multiversion B-Tree are working underlying the state-of-the-art temporal databases. So far, most efficient temporal data structures are partially persistent or fully persistent, but none of them support retroactive queries. On the other hand, efficient temporal indexing is required to address bulk loading in a real-life application. To the best of our knowledge, there is no efficient solution for bulk loading and updating retroactive index structures. This article seeks to offer a new data structure, the Retroactive B-Tree (RBT), to facilitate retroactive operations in temporal databases as well as bulk loading. It presents theoretical and empirical research and analysis of the suggested data structure and its relevant operations. The experiments were conducted to demonstrate the performance of the proposed retroactive B-Tree in terms of execution time, I/O complexity, space complexity, and bulk loading. The obtained results show that indexing with a buffer is the most powerful model for existing temporal databases for implementing a retroactive B-Tree. The tree of lists architecture is observed as an I/O efficient data structure for all variants of temporal indexing for large databases.
کلیدواژههای انگلیسی مقاله
Indexing,Retroactive Query Answering,Temporal Databases,Retroactive B-Tree,Persistent B-Tree,Temporal Database Indexing Problem
نویسندگان مقاله
Santosh Kumar Verma |
Assistant Prof., Department of Computer Science and Engineering, JK Lakshmipat University – Jaipur, Rajasthan, India.
Suman Saha |
Assistant Prof., Department of Computer Science and Engineering, Jaypee University, Anoopshahr, UP, India.
Sanjay Goel |
Prof., Department of Computer Science and Engineering, Jaypee University, Anoopshahr, UP, India.
نشانی اینترنتی
https://jitm.ut.ac.ir/article_102923_0826e3148d5e9d7b460092caf597cbba.pdf
فایل مقاله
فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده
en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به:
صفحه اول پایگاه
|
نسخه مرتبط
|
نشریه مرتبط
|
فهرست نشریات