[go: up one dir, main page]

Xu et al., 2022 - Google Patents

Building a fast and efficient lsm-tree store by integrating local storage with cloud storage

Xu et al., 2022

View PDF @Full View
Document ID
2986671556710705952
Author
Xu P
Zhao N
Wan J
Liu W
Chen S
Zhou Y
Albahar H
Liu H
Tang L
Tan Z
Publication year
Publication venue
ACM Transactions on Architecture and Code Optimization (TACO)

External Links

Snippet

The explosive growth of modern web-scale applications has made cost-effectiveness a primary design goal for their underlying databases. As a backbone of modern databases, LSM-tree based key–value stores (LSM store) face limited storage options. They are either …
Continue reading at dl.acm.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Free address space management in non-volatile memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/28—Using a specific disk cache architecture
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601—Dedicated interfaces to storage systems
    • G06F3/0628—Dedicated interfaces to storage systems making use of a particular technique
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99951—File or database maintenance
    • Y10S707/99952—Coherency, e.g. same view to multiple users
    • Y10S707/99953—Recoverability
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring

Similar Documents

Publication Publication Date Title
Kadekodi et al. WineFS: a hugepage-aware file system for persistent memory that ages gracefully
US11755427B2 (en) Fast recovery and replication of key-value stores
US9772949B2 (en) Apparatus, system and method for providing a persistent level-two cache
US8499121B2 (en) Methods and apparatus to access data in non-volatile memory
Paulo et al. A survey and classification of storage deduplication systems
EP3170106B1 (en) High throughput data modifications using blind update operations
US9734607B2 (en) Graph processing using a mutable multilevel graph representation
Xu et al. Building a fast and efficient lsm-tree store by integrating local storage with cloud storage
Zhang et al. Nvlsm: A persistent memory key-value store using log-structured merge tree with accumulative compaction
Shukla et al. Schema-agnostic indexing with Azure DocumentDB
US20160077746A1 (en) Optimized segment cleaning technique
US20160203135A1 (en) In-memory latch-free index structure
US10733045B2 (en) Online repair of metadata for structured data including file systems
US20130268770A1 (en) Cryptographic hash database
US11829291B2 (en) Garbage collection of tree structure with page mappings
Kim et al. Exploiting compression-induced internal fragmentation for power-off recovery in SSD
Duffy et al. Dotori: A key-value ssd based kv store
Dayan et al. GeckoFTL: Scalable flash translation techniques for very large flash devices
Jiao et al. BetrFS: A compleat file system for commodity SSDs
Yu et al. Lsmgraph: A high-performance dynamic graph storage system with multi-level csr
Huang et al. Removing {Double-Logging} with passive data persistence in {LSM-tree} based relational databases
Wang et al. Revisiting Secondary Indexing in {LSM-based} Storage Systems with Persistent Memory
Liu et al. Zen+: a robust NUMA-aware OLTP engine optimized for non-volatile main memory
Chen et al. A unified framework for designing high performance in-memory and hybrid memory file systems
Li et al. CCL-BTree: A crash-consistent locality-aware b+-tree for reducing xpbuffer-induced write amplification in persistent memory