a practical succinct data structure for tree like graphs
play

A Practical Succinct Data Structure for Tree-Like Graphs Johannes - PowerPoint PPT Presentation

Mar 04, 2024 •17 likes •587 views

A Practical Succinct Data Structure for Tree-Like Graphs Johannes Fischer TU Dortmund, Germany joint work with Daniel Peters (PTB Berlin) leading adj(x,y) neighbours(x) deg(x) terms [bits] n 2 lg arbitrary O(1) O(1) O(#in) or

  1. A Practical Succinct Data Structure for Tree-Like Graphs Johannes Fischer TU Dortmund, Germany joint work with Daniel Peters (PTB Berlin)

  2. leading adj(x,y) neighbours(x) deg(x) terms [bits] � n 2 � lg arbitrary O(1) O(1) O(#in) or O(#out) m

  3. leading adj(x,y) neighbours(x) deg(x) terms [bits] � n 2 � lg arbitrary O(1) O(1) O(#in) or O(#out) m x-page 2m + xn O(x) planar 2(m+n) O(#neighbours) O(1) O(1) triangular 2m+n separable O(n)

  4. leading adj(x,y) neighbours(x) deg(x) terms [bits] � n 2 � lg arbitrary O(1) O(1) O(#in) or O(#out) m x-page 2m + xn O(x) and not planar! planar 2(m+n) O(#neighbours) O(1) O(1) triangular 2m+n separable O(n)

  5. What if …

  6. What if … • … the graph is neither planar/separable/x-page/…

  7. What if … • … the graph is neither planar/separable/x-page/… • …but still “ easy “, in particular not dense?

  8. What if … • … the graph is neither planar/separable/x-page/… • …but still “ easy “, in particular not dense? • ⇒ adjacency array ?? 
 (m lg n + n lg m bits)

  9. leading adj(x,y) neighbours(x) deg(x) terms [bits] � n 2 � lg arbitrary O(1) O(1) O(#in) or O(#out) m k-page 2m + kn O(k) planar 2(m+n) O(#neighbours) O(1) O(1) triangular 2m+n separable O(n) (lg 3)(m+n) tree-like O(1) #out: O(1) O(#in) and O(#out) +k lg n

  10. leading adj(x,y) neighbours(x) deg(x) terms [bits] � n 2 � lg arbitrary O(1) O(1) O(#in) or O(#out) m k-page 2m + kn O(k) planar 2(m+n) O(#neighbours) O(1) O(1) triangular 2m+n separable O(n) (lg 3)(m+n) tree-like O(1) #out: O(1) O(#in) and O(#out) +k lg n k: # non-tree edges

  11. 1 2 4 3 7 8 5 6 9

  12. 1 2 4 3 7 8 5 6 9

  13. 1 2 4 3 7 8 3 5 6 9 4 2 4

  14. 0 1 2 4 3 7 8 3 5 6 9 4 2 4

  15. 0 1 2 4 3 7 8 3 5 6 9 4 2 4

  16. 0 10 0 1 1 2 4 3 7 8 3 5 6 9 4 2 4

  17. 0 10 0 1 1 1110 1 2 3 4 2 4 3 7 8 3 5 6 9 4 2 4

  18. 0 10 0 1 1 1110 1 2 3 4 2 4 3 2 4 20110110 3 5 6 7 8 3 7 8 3 5 6 9 4 2 4

  19. 0 10 0 1 1 1110 1 2 3 4 2 4 3 2 4 20110110 3 5 6 7 8 3 5 6 7 8 7 8 1022000 3 5 6 9 4 2 9 4 2 4

  20. 0 10 0 1 1 1110 1 2 3 4 2 4 3 2 4 20110110 3 5 6 7 8 3 5 6 7 8 7 8 1022000 3 5 6 9 4 2 9 20 4 9 4 2 4

  21. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4

  22. 10111020110110102200020 3 4 2 4

  23. n+m trits 10111020110110102200020 3 4 2 4

  24. n+m trits 10111020110110102200020 3 4 2 4 k log n bits

  25. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 Successors 9

  26. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 3 7 8 Listing 5 6 Successors 9

  27. 0 1 2 3 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 3 7 8 Listing 5 6 Successors 9

  28. 0 1 2 3 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 5 6 6 7 8 9 4 2 4 1 2 4 3 3 7 8 Listing 5 6 Successors 9

  29. 0 1 2 3 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 5 6 6 7 8 9 4 2 4 1 2 4 3 3 7 8 Listing 5 5 6 6 Successors 9

  30. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 Successors 9

  31. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 6 Successors 9

  32. 0 1 2 3 4 5 6 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 6 Successors 9

  33. 0 1 2 3 4 5 6 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 4 2 2 4 1 2 4 3 7 8 Listing 5 6 6 Successors 9

  34. 0 1 2 3 4 5 6 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 4 2 2 4 1 2 2 4 4 3 7 8 Listing 5 6 6 Successors 9

  35. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 Successors 9

  36. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 needs rank 2 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 Listing 5 6 Successors 9

  37. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 Listing 3 Predecessors 7 8 5 6 9

  38. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  39. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 4 3 5 6 7 8 9 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  40. 0 1 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 4 3 5 6 7 8 9 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  41. 0 1 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 4 3 5 6 7 8 9 4 2 4 1 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  42. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  43. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  44. 0 1 2 3 4 5 6 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  45. 0 1 2 3 4 5 6 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 6 9

  46. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  47. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  48. 0 1 2 3 4 5 6 7 8 9 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9

  49. 0 1 2 3 4 5 6 7 8 9 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 4 1 2 4 4 Listing 3 Predecessors 7 8 5 6 9 9

  50. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 Listing 3 Predecessors 7 8 5 6 9

  51. needs select α 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 ⇒ could be represen- 1 2 3 4 3 5 6 7 8 9 4 2 4 ted as wavelet tree 1 2 4 Listing 3 Predecessors 7 8 5 6 9

  52. Practical Results

  53. Size

  54. Time

  55. Realistic Test: BFS Graph Space [MByte] Time for BFT [sec] GLOUDS WebGraph GLOUDS WebGraph amazon-2008 8 . 551 13 . 654 0 . 95 0 . 86 cnr-2000 3 . 069 2 . 765 0 . 36 0 . 63 in-2004 15 . 813 11 . 231 1 . 60 1 . 59 uk-2002 324 . 108 187 . 494 32 . 04 22 . 96 enwiki-2013 208 . 896 322 . 257 5 . 58 12 . 57 dblp-2010 0 . 992 1 . 752 0 . 36 0 . 54 dblp-2011 5 . 348 8 . 501 1 . 18 1 . 26 hollywood-2011 202 . 991 18 . 532 2 . 59 14 . 37 WebGraph: Boldi/Vigna 2004 WebGraph: Claude/Navarro 2010

  56. Realistic Test: BFS sizeGLOUDS m Graph n sizeWebGraph amazon-2008 7 . 015 0.626 cnr-2000 9 . 879 1.109 in-2004 12 . 232 1.408 uk-2002 16 . 096 1.728 enwiki-2013 24 . 093 0.648 dblp-2010 4 . 952 0.566 dblp-2011 6 . 800 0.628 hollywood-2011 105 . 003 10.95 WebGraph: Boldi/Vigna 2004 WebGraph: Claude/Navarro 2010

  57. 0 1 2 3 4 5 6 7 8 9 10111020110110102200020 1 2 3 4 3 5 6 7 8 9 4 2 4 1 2 4 3 7 8 ! 5 6 t i s ’ t a h T 9

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

In-memory processing of big data via succinct data structures Rajeev Raman University of

In-memory processing of big data via succinct data structures Rajeev Raman University of

In-memory processing of big data via succinct data structures Rajeev Raman University of Leicester SDP Workshop, University of Cambridge Introduction Succinct Data Structuring Succinct Tries Applications & Libraries End Overview

321 views • 18 slides
Succinct Trie Indexes Made Practical Huanchen Zhang David G. Andersen, Michael Kaminsky, Andrew

Succinct Trie Indexes Made Practical Huanchen Zhang David G. Andersen, Michael Kaminsky, Andrew

Succinct Trie Indexes Made Practical Huanchen Zhang David G. Andersen, Michael Kaminsky, Andrew Pavlo, Kimberly Keeton DRAM price wont fall forever Price Year Memory-efficient data structures are helpful Smaller data structures More

1.49k views • 75 slides
Su SuRF: : PRACTICAL RANGE FILTERING WITH FA FAST ST SU SUCCINCT TRIES Huanchen Zhang Hu

Su SuRF: : PRACTICAL RANGE FILTERING WITH FA FAST ST SU SUCCINCT TRIES Huanchen Zhang Hu

Su SuRF: : PRACTICAL RANGE FILTERING WITH FA FAST ST SU SUCCINCT TRIES Huanchen Zhang Hu Hy Hyeontaek Lim, Viktor r Leis, David G. Anders rsen Michael Kaminsky, Kimberl rly Keeton, Andre rew Pa Pavlo Fi Filters answer approximate

525 views • 50 slides
Objec&ves Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 26,

Objec&ves Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 26,

1/26/18 Objec&ves Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 26, 2018 CSCI211 - Sprenkle 1 Review What is a priority queue? What is a heap? Proper&es Implementa&on What is the

342 views • 17 slides
Objectives Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 25, 2019

Objectives Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 25, 2019

1/25/19 Objectives Data structure: Heaps Data structure: Graphs Submit problem set 2 Jan 25, 2019 CSCI211 - Sprenkle 1 Review What is a priority queue? What is a heap? Properties Implementation What is the process for

215 views • 19 slides
Space-efficient construction of succinct de Bruijn graphs Felipe A. Louza University of S ao

Space-efficient construction of succinct de Bruijn graphs Felipe A. Louza University of S ao

Space-efficient construction of succinct de Bruijn graphs Felipe A. Louza University of S ao Paulo, Brazil Joint work with Lavinia Egidi and Giovanni Manzini. LSD/LAW London, 6-7 Feb. 2019 Outline 1. Introduction 2. BOSS construction 3.

992 views • 77 slides
Practical Steady-State Scheduling for Tree-Shaped Task Graphs Skou D IAKIT 1 , Loris M ARCHAL

Practical Steady-State Scheduling for Tree-Shaped Task Graphs Skou D IAKIT 1 , Loris M ARCHAL

Practical Steady-State Scheduling for Tree-Shaped Task Graphs Skou D IAKIT 1 , Loris M ARCHAL 2 , Jean-Marc N ICOD 1 , Laurent P HILIPPE 1 - 19/11/2009 1 : Laboratoire dInformatique de Franche-Comt Universit de France Comt, France 2 :

968 views • 43 slides
Tree Decomposition Maren Kaluza HELMHOLTZ CENTRE FOR ENVIRONMENTAL November 2018 RESEARCH -

Tree Decomposition Maren Kaluza HELMHOLTZ CENTRE FOR ENVIRONMENTAL November 2018 RESEARCH -

Tree Decomposition Maren Kaluza HELMHOLTZ CENTRE FOR ENVIRONMENTAL November 2018 RESEARCH - UFZ UFZ Table Of Contents Introduction Parallelization Graphs, Trees rivernetwork (Hydrology) Tree Decomposition Goal Tree Data Structure Cut

1.31k views • 119 slides
Trees Chapter 4 1 Objectives Understand the terminology of the tree data structure Represent

Trees Chapter 4 1 Objectives Understand the terminology of the tree data structure Represent

Trees Chapter 4 1 Objectives Understand the terminology of the tree data structure Represent a tree structure in a program Understand the importance of the binary trees Use a binary search tree for storing ordered elements 2 Motivation

651 views • 22 slides
Graphs 3 4 8 1 ORD SFO 802 1743 337 1 2 3 3 LAX DFW Outline / Reading Graphs (6.1)

Graphs 3 4 8 1 ORD SFO 802 1743 337 1 2 3 3 LAX DFW Outline / Reading Graphs (6.1)

Graphs 3 4 8 1 ORD SFO 802 1743 337 1 2 3 3 LAX DFW Outline / Reading Graphs (6.1) Definition Applications Terminology Properties ADT Data structures for graphs (6.2) Edge list structure

443 views • 15 slides
Algorithms in Bioinformatics: A Practical Introduction Phylogenetic Tree comparison and

Algorithms in Bioinformatics: A Practical Introduction Phylogenetic Tree comparison and

Algorithms in Bioinformatics: A Practical Introduction Phylogenetic Tree comparison and Consensus Trees Phylogenetic Tree comparison Why tree comparison? Different phylogenies are resulted using different Kind of data (different

1.2k views • 95 slides
Graphs Outline and Reading Graphs (12.1) Definition Applications Terminology

Graphs Outline and Reading Graphs (12.1) Definition Applications Terminology

1 ORD DFW 802 1233 1843 3 4 7 1 LAX 337 SFO Graphs Graphs Outline and Reading Graphs (12.1) Definition Applications Terminology Properties ADT Data structures for graphs (12.2) Edge list structure

1.34k views • 129 slides
CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set

CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set

CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set of nodes (vertices) and edges connecting them 2 Graph Applications Road network Social media networks Knowledge bases 3 Graph Representations

807 views • 66 slides
CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set

CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set

CS141: Intermediate Data Structures and Algorithms Graphs Amr Magdy Graph Data Structure A set of nodes (vertices) and edges connecting them 2 Graph Applications Road network Social media networks Knowledge basesS 3 Graph Representations

1.33k views • 73 slides
Statistical Encoding of Succinct Data Structures alez 1 Gonzalo Navarro 1 Rodrigo Gonz 1

Statistical Encoding of Succinct Data Structures alez 1 Gonzalo Navarro 1 Rodrigo Gonz 1

Outline Statistical Encoding of Succinct Data Structures alez 1 Gonzalo Navarro 1 Rodrigo Gonz 1 Department of Computer Science Universidad de Chile Combinatorial Pattern Matching, 2006 Gonz alez, Navarro Statistical Encoding of Succinct

1.17k views • 80 slides
Algorithms in Bioinformatics: A Practical Introduction Suffix tree Overview What is suffix

Algorithms in Bioinformatics: A Practical Introduction Suffix tree Overview What is suffix

Algorithms in Bioinformatics: A Practical Introduction Suffix tree Overview What is suffix tree? Simple application of suffix tree Linear time algorithm for constructing suffix tree Suffix array FM-index 1-mismatch search

1.53k views • 111 slides
Adjacency Matrices Representations memory? 1. Adjacency matrices. 2. Adjacency lists. 3.

Adjacency Matrices Representations memory? 1. Adjacency matrices. 2. Adjacency lists. 3.

Lecture 11 | Part 1 Adjacency Matrices Representations memory? 1. Adjacency matrices. 2. Adjacency lists. 3. Dictionary of sets How do we store a graph in a computers Three approaches: Adjacency Matrices Assume nodes are

927 views • 26 slides
Charlie Garrod Michael Hilton School of Computer Science 15-214 1 Administrivia HW2 due

Charlie Garrod Michael Hilton School of Computer Science 15-214 1 Administrivia HW2 due

Principles of Software Construction: Objects, Design, and Concurrency Part 1: Designing Classes Design for Reuse Charlie Garrod Michael Hilton School of Computer Science 15-214 1 Administrivia HW2 due Thursday Sep 14, 11:59 p.m.

755 views • 52 slides
LOCAL AUTHORI TY OVER FI REARM S J E F F W E LT Y U N C S C H O O L O F G OV E R N M E N T

LOCAL AUTHORI TY OVER FI REARM S J E F F W E LT Y U N C S C H O O L O F G OV E R N M E N T

1/11/2018 LOCAL AUTHORI TY OVER FI REARM S J E F F W E LT Y U N C S C H O O L O F G OV E R N M E N T THE BI G PI CTURE (I ) A well regulated Militia, being necessary to the security of a free State, the right of the people to keep

579 views • 4 slides
Physics of Glaciers, Chapter 5: Glacier Flow Martin Lthi HS 2020 Introduction: Description of

Physics of Glaciers, Chapter 5: Glacier Flow Martin Lthi HS 2020 Introduction: Description of

Physics of Glaciers, Chapter 5: Glacier Flow Martin Lthi HS 2020 Introduction: Description of Glacier Flow Flow of Glaciers Martin Lthi 1 Introduction: Flow of Glaciers, Deformation of Ice and Tensors Day Topic C.P. P. H. Lecturer

323 views • 21 slides
Geometric clique structures in association schemes Xiaorui Sun 1 John Wilmes 2 1 Department of

Geometric clique structures in association schemes Xiaorui Sun 1 John Wilmes 2 1 Department of

Geometric clique structures in association schemes Xiaorui Sun 1 John Wilmes 2 1 Department of Computer Science Columbia University xiaoruisun@cs.columbia.edu 2 Department of Mathematics University of Chicago wilmesj@math.uchicago.edu Modern

780 views • 47 slides
DGtal: Topology module Jacques-Olivier Lachaud Equipe LIMD Laboratoire de Math ematiques -

DGtal: Topology module Jacques-Olivier Lachaud Equipe LIMD Laboratoire de Math ematiques -

Laboratoire de Math ematiques Universit e de Savoie DGtal: Topology module Jacques-Olivier Lachaud Equipe LIMD Laboratoire de Math ematiques - UMR CNRS 5127 Universit e de Savoie DGtal meeting: Jan. 3rd, 2011 J.-O. Lachaud

342 views • 10 slides
Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse

Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse

Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse a graph like for a tree Graph traversal may start at an arbitrary vertex. (Tree traversal generally starts at root vertex) Two difficulties

339 views • 6 slides
Semantics and Pragmatics of NLP and Functions Lascarides & Propositional Logic, Predicates

Semantics and Pragmatics of NLP and Functions Lascarides & Propositional Logic, Predicates

SPNLP: Propositional Logic, Predicates Semantics and Pragmatics of NLP and Functions Lascarides & Propositional Logic, Predicates and Klein Functions Outline Motivation Propositional Logic Alex Lascarides & Ewan Klein

724 views • 35 slides

More recommend