1 / 19

Exploring Hyperstructures: A Comparison of Multitrees, Polyarchies, Zzstructures, and mSpaces

This work presents a detailed comparison of innovative data access structures: Multitrees, Polyarchies, Zzstructures, and mSpaces. Each structure offers unique properties for organizing data, emphasizing overlaps, edges, and dimensional sorting. Multitrees allow for shared subtrees, while Polyarchies focus on multiple trees with arbitrary overlaps. Zzstructures introduce edge-colored directed multigraphs, constrained by node restrictions. mSpaces enable multivariate organization, facilitating dimensional complexity. The paper aims to inspire new hypermedia systems and requires visualization applications for clarity.

braima
Télécharger la présentation

Exploring Hyperstructures: A Comparison of Multitrees, Polyarchies, Zzstructures, and mSpaces

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies By: McGuffin & Schraefel Presented by: Travis Gadberry

  2. Abstract • Background • Smaller chunks of info (not full pages) • Focus on the structures, not implementation • Desire for new ways of accessing data

  3. Structures • Multitrees • Polyarchies • Zzstructures • mSpaces

  4. Multitrees • Kind of DAG • Can contain multiple overlapping trees • Overlaps must share subtrees • Ex. Human genealogies

  5. Multitrees

  6. Polyarchies • Can contain multiple overlapping trees • Overlaps may contain subtrees • Overlaps may happen at arbitrary nodes • Coloring edges distinguishes different trees

  7. Polyarchies

  8. Zzstructures • Kind of directed multigraph • Subject to a single restriction R: • Each node in a zzstructure may have at most one incoming edge of each color, and at most one outgoing edge of each color • Edges of each color form paths/cycles that do not intersect within the same color

  9. Zzstructures

  10. Zzstructures

  11. mSpaces • Difficult to visualize • Ability to organize data points in multivariate space • Allows for dimensional sorting, changing structure of the tree.

  12. mSpace polyarchy for a 3D 2x2x2 multivariate space. 3! (6) overlapping bi. trees Each row displays 1 slice less (3D, 2D, 1D, 0D) mSpaces

  13. mSpaces

  14. Taxonomy

  15. Analysis • Zzstructures ?= edge-colored directed multigraphs ? (ecdm) • Zzstructures == ecdm + R • R can be simulated by node cloning • Advantages?

  16. Comparisons • Zzstructure’s Space • non-Euclidean • Not easy to flatten and visualize • May be changed independently of content • More freedom • Can be much more confusing • Dimensions are like containers • Nodes have a relative position in some dimensions

  17. Comparisons • mSpace’s Space • Euclidean • Like a high-dimensional grid • Slices can be taken and visualized • Space determined by attributes on content • More structured • Changing location of nodes doesn’t affect space • Dimensions are variables • Nodes have a value in every dimension

  18. Comparisons • Nature of overlap between trees • Polyarchy – arbitrary • Zzstructure – arbitrary • Multitree – one subtree is shared • mSpace – all subtrees at certain depth are shared

  19. Conclusions & Future Work • New ways to create hypermedia systems • This paper has shown the differences • Visualization applications are needed • Other hybrid or extended structures

More Related