% Meeting about DHF

Talk info

1. State my interest
   • I’m interested in data structures to effectively and efficiiently store and maintain temporal data, networks, and structures
   • Base computer science efficiency would be flops or time/space complexity
   • There is more: What is effective?
     • Depends on what we want it to mean
     • Depends on what we’re doing
     • What is our driving application??
     • What we want as an appropriate application outcome
   • Time data and networks addressed in other applications. It’s been done before, but we’re doing something different, something more
     • Such as TAG, …
2. Emphasize Evolving
   • Evolve: form, dissolve, change major attributes (morph)
     • Entities (as nodes) that have these three characteristics
     • Relationships (as edges) that have these characteristics
   • Substantive node characteristics change
   • Relationships, edges: form and dissove, and hcange major characteristics (the 3 things that happen)
3. Temporal graphs are not a new idea
   • We’re expanding on current work
4. For time slide, don’t use the word “meaning”
   • In algorithms, there is a tradeoff:
     • More storage for to store precomputed steps for faster computing
     • Less storage, don’t store precomputed steps, and do a lazy evaluation : slower computing
     • Space vs Time Complexity Tradeoff