Upload File

top-down tree long short-term memory networks · top-down tree long short-term memory networks...

  • Home
  • Documents
  • Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh
47
Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh 12th June, 2016 Zhang et al., 2016 Tree LSTM 12th June, 2016 1 / 18

Upload: others

Post on 23-Jun-2020

10 views

Category:

Documents


0 download

Report

TRANSCRIPT

Page 1: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Top-down Tree Long Short-Term Memory Networks

Xingxing Zhang, Liang Lu, Mirella Lapata

School of Informatics, University of Edinburgh

12th June, 2016

Zhang et al., 2016 Tree LSTM 12th June, 2016 1 / 18

Page 2: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Sequential Language Models

P(S = w1,w2, . . . ,wn) =n∏

i=1

P(wi |w1:i−1) (1)

State of the Art

based on Long Short Term Memory Network Language Model(Hochreiter and Schmidhuber, 1997; Sundermeyer et al., 2012)Billion word benchmark results reported in Jozefowicz et al., (2016)

Models PPLKN5 67.6LSTM 30.6LSTM+CNN INPUTS 30.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 2 / 18

Page 3: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Will tree structures help LMs?

Probably yes

LMs based on Constituency Parsing (Chelba and Jelinek, 2000; Roark,2001; Charniak, 2001)LMs based on Dependency Parsing (Shen et al., 2008; Zhang, 2009;Sennrich, 2015)

Zhang et al., 2016 Tree LSTM 12th June, 2016 3 / 18

Page 4: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Will tree structures help LMs?

Probably yes

LMs based on Constituency Parsing (Chelba and Jelinek, 2000; Roark,2001; Charniak, 2001)LMs based on Dependency Parsing (Shen et al., 2008; Zhang, 2009;Sennrich, 2015)

Zhang et al., 2016 Tree LSTM 12th June, 2016 3 / 18

Page 5: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

LSTMs + Dependency Trees = TreeLSTMs

+

Why?

Sentence Length N v.s. Tree Height log(N)

How?

Top-down GenerationBreadth-first searchreminiscent of Eisner (1996)

Zhang et al., 2016 Tree LSTM 12th June, 2016 4 / 18

Page 6: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

LSTMs + Dependency Trees = TreeLSTMs

+

Why?

Sentence Length N v.s. Tree Height log(N)

How?

Top-down GenerationBreadth-first searchreminiscent of Eisner (1996)

Zhang et al., 2016 Tree LSTM 12th June, 2016 4 / 18

Page 7: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 8: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 9: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 10: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 11: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 12: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 13: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Generation Process (Unlabeled Trees)

The luxury auto manufacturer last year sold 1,214 cars in the U.S.

Zhang et al., 2016 Tree LSTM 12th June, 2016 5 / 18

Page 14: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

P(S) =n∏

i=1

P(wi |w1:i−1) (2)

⇓

P(S |T ) =∏

w∈BFS(T )\root

P(w |D(w)) (3)

D(w) is the Dependency Path of w .

D(w) is a generated sub-tree.

Works on projective and unlabeled dependency trees.

Zhang et al., 2016 Tree LSTM 12th June, 2016 6 / 18

Page 15: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 16: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 17: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 18: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 19: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 20: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 21: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 7 / 18

Page 22: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

One Limitation of Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 8 / 18

Page 23: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Left Dependent Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 9 / 18

Page 24: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Left Dependent Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 9 / 18

Page 25: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Left Dependent Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 9 / 18

Page 26: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Left Dependent Tree LSTM

Zhang et al., 2016 Tree LSTM 12th June, 2016 9 / 18

Page 27: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Experiments

Zhang et al., 2016 Tree LSTM 12th June, 2016 10 / 18

Page 28: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

MSR Sentence Completion Challenge

Training set: 49 million words (around 2 million sentences)

development set: 4000 sentences

test set: 1040 completion questions.

Zhang et al., 2016 Tree LSTM 12th June, 2016 11 / 18

Page 29: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Zhang et al., 2016 Tree LSTM 12th June, 2016 12 / 18

Page 30: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Zhang et al., 2016 Tree LSTM 12th June, 2016 12 / 18

Page 31: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Zhang et al., 2016 Tree LSTM 12th June, 2016 12 / 18

Page 32: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Zhang et al., 2016 Tree LSTM 12th June, 2016 12 / 18

Page 33: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Dependency Parsing Reranking

Rerank 2nd Order MSTParser (McDonald and Pereira, 2006)

We train TreeLSTM and LdTreeLSTM as language models.

We only use words as input features; POS tags, dependency labels orcomposition features are not used.

Zhang et al., 2016 Tree LSTM 12th June, 2016 13 / 18

Page 34: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Dependency Parsing Reranking

NN: Chen & Manning, 2014; S-LSTM: Dyer et al., 2015Zhang et al., 2016 Tree LSTM 12th June, 2016 14 / 18

Page 35: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Dependency Parsing Reranking

NN: Chen & Manning, 2014; S-LSTM: Dyer et al., 2015Zhang et al., 2016 Tree LSTM 12th June, 2016 14 / 18

Page 36: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Dependency Parsing Reranking

NN: Chen & Manning, 2014; S-LSTM: Dyer et al., 2015Zhang et al., 2016 Tree LSTM 12th June, 2016 14 / 18

Page 37: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Dependency Parsing Reranking

NN: Chen & Manning, 2014; S-LSTM: Dyer et al., 2015Zhang et al., 2016 Tree LSTM 12th June, 2016 14 / 18

Page 38: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Left? No!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 39: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Right? Yes!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 40: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Right? Yes!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 41: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Next Right? No!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 42: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Left? Yes!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 43: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Left? Yes!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 44: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Next Left? No!

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 45: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Four binary classifiers:

Add Left?

Add Right?

Add Next Left?

Add Next Right?

Features: hidden states andword embeddings

Classifiers Accuracies

Add-Left 94.3Add-Right 92.6Add-Nx-Left 93.4Add-Nx-Right 96.0

Zhang et al., 2016 Tree LSTM 12th June, 2016 15 / 18

Page 46: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Tree Generation

Zhang et al., 2016 Tree LSTM 12th June, 2016 16 / 18

Page 47: Top-down Tree Long Short-Term Memory Networks · Top-down Tree Long Short-Term Memory Networks Xingxing Zhang, Liang Lu, Mirella Lapata School of Informatics, University of Edinburgh

Conclusions

Syntax can help language modeling.

Predicting tree structures with Neural Networks is possible.

Next Steps:

Sequence to Tree ModelsTree to Tree Models

code available:https://github.com/XingxingZhang/td-treelstm

Thanks & Questions?

Zhang et al., 2016 Tree LSTM 12th June, 2016 17 / 18


WiredTiger In-Memory - vs WiredTiger B-Tree · ∙ B-Tree ∙ Practically WiredTiger, but without disk access Based on WiredTiger 5 ... WiredTiger In-Memory - vs WiredTiger B-Tree

TPR – tree Running in Main Memory · 2012. 2. 14. · (TPR-tree), proposed by Saltenis et al. [14], working in main memory environment. To the best of our knowledge this is the

The adaptive radix tree: ARTful indexing for main-memory databases

The Adaptive Radix Tree: ARTful Indexing for Main …leis/papers/ART.pdf · The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases ... proposed a cache conscious B +-tree

Improving Memory Space Efficiency of Kd-tree for Real-time

A Quantum Light Source for Light-Matter Interaction by Xingxing Xing A thesis submitted in

Tree Decompositions of Graphs: Saving Memory in …...Tree Decompositions of Graphs: Saving Memory in Dynamic Programming1,2 Nadja Betzlera Rolf Niedermeierb Johannes Uhlmanna aWilhelm-Schickard-Institut

The HV-tree: a Memory Hierarchy Aware Version Index

The Memory Tree - Saint Francis Hospice · Our Memory Tree “Our Memory Tree is a way for us to thank our devoted supporters who make an extra-ordinary contribution to the work we

Shared-Memory Synchronizationnhonarmand/... · Software Combining Tree Barrier •Shared variable represented as a tree of variables –Each node of the tree in a different cache

WiredTiger In-Memory - vs WiredTiger B-Tree...∙ Introducing Percona Memory Engine for MongoDB ∙ Percona Server for MongoDB manual

The Jericho 2017 Memory Tree - jerichobeca.org · The Jericho 2017 Christmas Memory Tree ... Barbara Marasco David Gallant ... Linda Lapointe Maureen Hogan Linda Mol Maurice Casey

The Memory Tree. - Beatrice Tate School

Research Says Tree Climbing Improves Your Memory

WiredTiger In-Memory vs WiredTiger B-Tree

BST Numbers, Memory, Removal & Tree Maps. BST Numbers n = number values contained h = height

A Globally Arbitrated Memory Tree for Mixed-Time ...eprints.whiterose.ac.uk/109069/...comp_memory_tree.pdf · A Globally Arbitrated Memory Tree for Mixed-Time-Criticality Systems

Memory Tree - s3.amazonaws.com€¦ · Memory Tree You will be invited during the service to hang an ornament on the tree in the Sanctuary in memory of a loved one. HOLIDAY CHILDCARE

KISS-Tree: Smart Latch-Free In-Memory Indexing on Modern ... · KISS-Tree: Smart Latch-Free In-Memory Indexing on Modern Architectures Thomas Kissinger, Benjamin Schlegel, Dirk Habich,

THE TREE OF MEMORY - Navicent · PDF fileTHE TREE OF MEMORY HONORING The Tree of Memory at The Wellness Center is a lasting reflection of love and friendship, providing opportunities

Crab-tree: A Crash Recoverable B+-tree Variant for Persistent … · 2020-07-23 · Crab-tree: A Crash Recoverable B+-tree Variant for Persistent Memory with ARMv8 Architecture ZZZ:3

Mycorrhizal Networks Facilitate Tree Communication ...€¦ · Mycorrhizal Networks Facilitate Tree Communication, Learning, and Memory Suzanne W. Simard Abstract Mycorrhizal fungal

The Adaptive Radix Tree: ARTful Indexing for Main-Memory

Memory Tree - Enviro-Stories

IPL B -tree for Flash Memory Database Systems*

Home|Xingxing Shen - Contentious relationships in ...Xing-Xing Shen1, Chris Todd Hittinger2 and Antonis Rokas1* Phylogenomic studies have resolved countless branches of the tree of

An Efficient B-Tree Layer for Flash-Memory Storage Systems

International Workshop on Web and DatabasesStorage engine PostgreSQL rank optrank Storage engine allowable index types are MyISAM: B-TREE, InnoDB: B-TREE, Memory: HASH B-TREE PostgreSQL

Nanjing Jianning Primary School Li Xingxing

Chapter 6 External Memory Structuresedijason.github.io/courses/DBA1718/handouts/ch6... · Chapter Outline •External Disk Storage •Working with External Data •B-tree •B+-tree

Device Tree Tools Status - eLinux.org · 2016. 11. 2. · dtb'' [ dtb' ] dtb'' FDT memory: (flattened device tree) linux kernel EDT (expanded device tree) scripts/dtc/dtx_diff Process

New Hardware Platforms The Bw-Tree: A B-tree forcs.brown.edu/courses/cs227/archives/2015/slides/week2/2-sam-BW… · Bw-tree search logic In-memory pages Bw-tree Layer Cache Layer

RESTORATION OF MEMORY LANE Juke · tree USE TRACK AS tree CONNECTION OF COMMUNITY Memorial tree tree Memorial tracks, relaxing at special designed park furniture, lay on the green

d2y1pz2y630308.cloudfront.net · Assisted Living & Memory Care 216.230.5690 | • tree removal • tree trimming • stump removal • brush chipping • crane work (216) 780-3760

WORT: Write Optimal Radix Tree for Persistent Memory