What this package does | Data layout | Core DMD | Forecasting | How good is the fit? | DMD with control: when the system is driven | Extended DMD: when the dynamics are nonlinear | Hankel-DMD: one measured variable | Generalized Laplace Analysis | Phase space analysis | Harmonic time averages | Mesochronic plots | Where to go next | References

Vector Search | Creating Nodes with Embeddings | k-Nearest Neighbor Search | Hybrid Search | Semantic Search | Semantic Neighbors | Semantic Walk | Temporal Queries (Time-Travel) | Setting Up Temporal Edges | Querying at a Point in Time | neighbors_at | bfs_at | shortest_path_at | Use Case: Evolving Relationships | GraphRAG | Subgraph Extraction | Full GraphRAG Pipeline | Graph Algorithms | Centrality and Ranking | Community Detection and Components | Traversal, Lookups, and Statistics | Depth-First Search | Finding and Bulk-Deleting by Label | Subgraph Export and Statistics | Arrow Flight Transport | When to Use Arrow Flight | ArrowClient (Direct Use) | UnifiedClient (Automatic Transport Selection) | Authentication | Using an Auth Token | Handling Authentication Errors | Putting It All Together | Summary

What is AstraeaDB? | The Vector-Property Graph Data Model | Transport Options | Key Features at a Glance | Installation | From CRAN (when available) | Development Version from GitHub | Optional: Arrow Flight Support | Prerequisites | Quick Start Example | Where to Go Next

Overview | 1 -- Data Extraction | 2 -- Protocol Distribution | 3 -- Top Talkers | By total packets sent | By total bytes sent | Busiest conversations (IP pairs) | 4 -- Port Analysis | Service Port Distribution | Port-protocol cross-tabulation | 5 -- Temporal Patterns | 6 -- Network Graph Analysis | Degree distribution | Centrality measures | Community detection | 7 -- Anomaly Indicators | Potential scanners (high destination fan-out) | Port reconnaissance (many distinct service ports) | Send/receive asymmetry | 8 -- Interactive Network Map | 9 -- Payload Analysis | 10 -- AstraeaDB Graph Traversal Examples

Starting the Server | Connecting from R | Option A: Convenience Function | Option B: Explicit Construction | Creating Nodes | Reading Nodes | Updating Nodes | Deleting Nodes | Creating Edges | Reading and Updating Edges | Deleting Edges | Graph Traversals | Neighbors | Breadth-First Search (BFS) | Shortest Path | GQL Queries | Batch Operations | Batch Create | Batch Delete | Data Frame Integration | Importing Nodes from a Data Frame | Importing Edges from a Data Frame | Exporting Nodes to a Data Frame | Exporting BFS Results to a Data Frame | Disconnecting | Error Handling | Summary