Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: The Skiplist-Based LSM Tree
The log-structured merge-tree (LSM-tree)
HOT: A Height Optimized Trie Index for Main-Memory Database Systems
The adaptive radix tree: ARTful indexing for main-memory databases
A Fast Lock-Free Internal Binary Search Tree
Alternatives to splay trees with O(log n) worst-case access times
Splaying Log-Structured Merge-Trees
LSbM-tree: Re-Enabling Buffer Caching in Data Management for Mixed Reads and Writes
Multidimensional binary search trees used for associative searching
A practical scalable distributed B-tree
The hB-tree: a multiattribute indexing method with good guaranteed performance
Sorting And Indexing With Partitioned B-Trees
SLIK: scalable low-latency indexes for a key-value store
SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search
Deterministic skip lists
Self-adjusting binary search trees
A practical concurrent binary search tree
A Light-weight Compaction Tree to Reduce I / O Amplification toward Efficient Key-Value Stores
TLB misses: The Missing Issue of Adaptive Radix Tree?
CASTLE: fast concurrent internal binary search tree using edge-based locking
Persistent B+-Trees in Non-Volatile Main Memory
Room-Temperature Bonding of Wafers with Smooth Au Thin Films in Ambient Air Using a Surface-Activated Bonding Method
Two port reconfigurable CRLH leaky wave antenna with improved impedance matching and beam tuning
oral erythroplakia and speckled leukoplakia : retrospective analysis of 13 cases .
Dynamo: amazon's highly available key-value store
Biomedical Term Extraction: NLP Techniques in Computational Medicine