Download Free Indexing On Non Volatile Memory Book in PDF and EPUB Free Download. You can read online Indexing On Non Volatile Memory and write the review.

This book focuses on online transaction processing indexes designed for scalable, byte-addressable non-volatile memory (NVM) and provides a systematic review and summary of the fundamental principles and techniques as well as an outlook on the future of this research area. In this book, the authors divide the development of NVM indexes into three “eras”— pre-Optane, Optane and post-Optane—based on when the first major scalable NVM device (Optane) became commercially available and when it was announced to be discontinued. The book will analyze the reasons for the slow adoption of NVM and give an outlook for indexing techniques in the post-Optane era. The book assumes only basic undergraduate-level understanding on indexing (e.g., B+-trees, hash tables) and database systems in general. It is otherwise self-contained with the necessary background information, including an introduction to NVM hardware and software/programming issues, a detailed description of different indexes in highly concurrent systems for non-experts and new researchers to get started in this area.
This book explores the implications of non-volatile memory (NVM) for database management systems (DBMSs). The advent of NVM will fundamentally change the dichotomy between volatile memory and durable storage in DBMSs. These new NVM devices are almost as fast as volatile memory, but all writes to them are persistent even after power loss. Existing DBMSs are unable to take full advantage of this technology because their internal architectures are predicated on the assumption that memory is volatile. With NVM, many of the components of legacy DBMSs are unnecessary and will degrade the performance of data-intensive applications. We present the design and implementation of DBMS architectures that are explicitly tailored for NVM. The book focuses on three aspects of a DBMS: (1) logging and recovery, (2) storage and buffer management, and (3) indexing. First, we present a logging and recovery protocol that enables the DBMS to support near-instantaneous recovery. Second, we propose a storage engine architecture and buffer management policy that leverages the durability and byte-addressability properties of NVM to reduce data duplication and data migration. Third, the book presents the design of a range index tailored for NVM that is latch-free yet simple to implement. All together, the work described in this book illustrates that rethinking the fundamental algorithms and data structures employed in a DBMS for NVM improves performance and availability, reduces operational cost, and simplifies software development.
This book explores the implications of non-volatile memory (NVM) for database management systems (DBMSs). The advent of NVM will fundamentally change the dichotomy between volatile memory and durable storage in DBMSs. These new NVM devices are almost as fast as volatile memory, but all writes to them are persistent even after power loss. Existing DBMSs are unable to take full advantage of this technology because their internal architectures are predicated on the assumption that memory is volatile. With NVM, many of the components of legacy DBMSs are unnecessary and will degrade the performance of data-intensive applications. We present the design and implementation of DBMS architectures that are explicitly tailored for NVM. The book focuses on three aspects of a DBMS: (1) logging and recovery, (2) storage and buffer management, and (3) indexing. First, we present a logging and recovery protocol that enables the DBMS to support near-instantaneous recovery. Second, we propose a storage engine architecture and buffer management policy that leverages the durability and byte-addressability properties of NVM to reduce data duplication and data migration. Third, the book presents the design of a range index tailored for NVM that is latch-free yet simple to implement. All together, the work described in this book illustrates that rethinking the fundamental algorithms and data structures employed in a DBMS for NVM improves performance and availability, reduces operational cost, and simplifies software development.
Data warehouses differ significantly from traditional transaction-oriented operational database applications. Indexing techniques and index structures applied in the transaction-oriented context are not feasible for data warehouses. This work develops specific heuristic indexing techniques which process range queries on aggregated data more efficiently than those traditionally used in transaction-oriented systems. The book presents chapters on: - the state of the art in data warehouse research - data storage and index structures - finding optimal tree-based index structures - aggregated data in tree-based index structures - performance models for tree-based index structures - and techniques for comparing index structures.
The non-volatile memory technique advanced rapidly in recent years. First, mature NAND flash memory is getting cheaper and denser. It has impacted our daily life. Second, emerging persistent memory technologies such as 3d XPoint have demonstrated great potentials in revolutionizing modern memory hierarchy. In this research, we first carry out a project on the mature NAND-flash-based solid state drives. We propose a new RAID5 technique called CR5M to enhance data reliability within a single SSD for safety-critical mobile applications. We also proposed an associated data reconstruction strategy called MCR to further shrink the window of vulnerability. Compared with traditional RAID5, CR5M can achieve up to 40.2% performance improvement. The data recovery speed is also improved by 7.5%. Because persistent memory is byte-addressable and has near-DRAM access speed, it exhibits a huge potential to build a hybrid memory system where both DRAM and PM are directly connected to a CPU. We designed a concurrent hash-assisted radix tree for DRAM-PM Hybrid Memory Systems. In such a system, an efficient indexing data structure such as a persistent tree becomes an indispensable component. Designing a capable persistent tree, however, is challenging as it has to ensure consistency, persistence, and scalability without substantially degrading performance. We propose a novel concurrent and persistent tree called HART (Hash-assisted ART), which employs a hash table to manage ARTs. HART not only optimize its performance but also prevent persistent memory leaks. In most cases, HART significantly outperforms WOART and FPTree, two state-of-the-art persistent trees. Also, it scales well in concurrent scenarios. Then, we proposed multi-hashing, a dual-level hash table indexing for a highperformance, large-capacity, and low-cost in-memory database. Multi-hashing is also built on a DRAM-PM hybrid memory system. On the DRAM level, an indexing structure is designed to be memory-efficient to manage hot indexes. On the PM level, another indexing data structure is designed to be performance-optimized. The indexes in DRAM will be merged into PM periodically. Our experimental results show that multi-hashing shows better performance under Sparse workloads when compared with HART. It also consumes less memory under both Dense and Sparse workloads.
This book contains a number of chapters on transactional database concurrency control. A two-sentence summary of the volume's entire sequence of chapters is this: traditional locking techniques can be improved in multiple dimensions, notably in lock scopes (sizes), lock modes (increment, decrement, and more), lock durations (late acquisition, early release), and lock acquisition sequence (to avoid deadlocks). Even if some of these improvements can be transferred to optimistic concurrency control, notably a fine granularity of concurrency control with serializable transaction isolation including phantom protection, pessimistic concurrency control is categorically superior to optimistic concurrency control, i.e., independent of application, workload, deployment, hardware, and software implementation.
This book presents the latest techniques for characterization, modeling and design for nano-scale non-volatile memory (NVM) devices. Coverage focuses on fundamental NVM device fabrication and characterization, internal state identification of memristic dynamics with physics modeling, NVM circuit design and hybrid NVM memory system design-space optimization. The authors discuss design methodologies for nano-scale NVM devices from a circuits/systems perspective, including the general foundations for the fundamental memristic dynamics in NVM devices. Coverage includes physical modeling, as well as the development of a platform to explore novel hybrid CMOS and NVM circuit and system design. • Offers readers a systematic and comprehensive treatment of emerging nano-scale non-volatile memory (NVM) devices; • Focuses on the internal state of NVM memristic dynamics, novel NVM readout and memory cell circuit design and hybrid NVM memory system optimization; • Provides both theoretical analysis and practical examples to illustrate design methodologies; • Illustrates design and analysis for recent developments in spin-toque-transfer, domain-wall racetrack and memristors.