On the public citation graph
\(\mathsf{B}^{p}\) - \(\mathsf{Tree}\) : A Predictive \(\mathsf{B}^{+}\) - \(\mathsf{Tree}\) for Reducing Writes on Phase Change Memory
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-60220-8_74openalex-snapshot
The buffer tree: A new technique for optimal I/O-algorithms
inferredcites →https://doi.org/10.1007/s002360050048openalex-snapshot
The log-structured merge-tree (LSM-tree)
inferredcites →https://doi.org/10.1016/b978-012088469-8.50060-7openalex-snapshot
Write-Optimized B-Trees
inferredcites →https://doi.org/10.1109/aina.2007.141openalex-snapshot
TS-Trees: A Non-Alterable Search Tree Index for Trustworthy Databases on Write-Once-Read-Many (WORM) Storage
inferredcites →https://doi.org/10.1109/esscirc.2003.1257065openalex-snapshot
Emerging non-volatile memory technologies
inferredcites →https://doi.org/10.1109/icc.2012.6364145openalex-snapshot
A Destination Prediction Model based on historical data, contextual knowledge and spatial conceptual maps
inferredcites →https://doi.org/10.1109/isscc.2008.4523240openalex-snapshot
A Multi-Level-Cell Bipolar-Selected Phase-Change Memory
inferredcites →https://doi.org/10.1109/tkde.2004.1318568openalex-snapshot
Main Memory Indexing: The Case for BD-Tree
inferredcites →https://doi.org/10.1109/tkde.2005.46openalex-snapshot
Indexing high-dimensional data for efficient in-memory similarity search
inferredcites →https://doi.org/10.1145/121132.121137openalex-snapshot
The design and implementation of a log-structured file system
inferredcites →https://doi.org/10.1145/1275986.1275991openalex-snapshot
An efficient B-tree layer implementation for flash-memory storage systems
inferredcites →https://doi.org/10.1145/1555754.1555758openalex-snapshot
Architecting phase change memory as a scalable dram alternative
inferredcites →https://doi.org/10.1145/1555754.1555759openalex-snapshot
A durable and energy efficient main memory using phase change memory technology
inferredcites →https://doi.org/10.1145/1555754.1555760openalex-snapshot
Scalable high performance main memory system using phase-change memory technology
inferredcites →https://doi.org/10.1145/1669112.1669117openalex-snapshot
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
inferredcites →https://doi.org/10.1145/1815961.1815980openalex-snapshot
Use ECP, not ECC, for hard failures in resistive memories
inferredcites →https://doi.org/10.1145/1995896.1995911openalex-snapshot
Page placement in hybrid memory systems
inferredcites →https://doi.org/10.1145/342009.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1147/rd.524.0465openalex-snapshot
Phase-change random access memory: A scalable technology
inferredcites →https://doi.org/10.14778/1920841.1920990openalex-snapshot
Tree indexing on solid state drives
inferredcites →https://doi.org/10.5555/1182635.1164213openalex-snapshot
Trustworthy keyword search for regulatory-compliant records retention
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11390-021-1247-6openalex-snapshot
Write-Optimized B+ Tree Index Technology for Persistent Memory
inferred← citeshttps://doi.org/10.1007/s11704-014-4185-4openalex-snapshot
Exploiting write power asymmetry to improve phase change memory system performance
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.08.002openalex-snapshot
Linked Block-based Multiversion B-Tree index for PCM-based embedded databases
inferred← citeshttps://doi.org/10.1109/compsac.2017.267openalex-snapshot
xB+-Tree: Access-Pattern-Aware Cache-Line-Based Tree for Non-volatile Main Memory Architecture
inferred← citeshttps://doi.org/10.1109/iisa.2015.7388040openalex-snapshot
Efficient solution of large sparse linear systems in modern hardware
inferred← citeshttps://doi.org/10.1109/tcad.2021.3049677openalex-snapshot
Beyond Write-Reduction Consideration: A Wear-Leveling-Enabled B⁺-Tree Indexing Scheme Over an NVRAM-Based Architecture
inferred← citeshttps://doi.org/10.1145/2950060openalex-snapshot
Space-Efficient Index Scheme for PCM-Based Multiversion Databases in Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1145/3190508.3190524openalex-snapshot
Reducing DRAM footprint with NVM in Facebook
inferred← citeshttps://doi.org/10.1145/3399666.3399900openalex-snapshot
Data structure primitives on persistent memory
inferred← citeshttps://doi.org/10.3390/mi10050346openalex-snapshot
The Matrix KV Storage System Based on NVM Devices
inferred← citeshttps://doi.org/10.3390/mi11121075openalex-snapshot
A New Embedded Key–Value Store for NVM Device Simulator
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.