[{"_1":2,"_68":-5,"_69":-5},"loaderData",{"_3":4,"_38":39,"_66":-5,"_67":-5},"root",{"_5":-5,"_6":-5,"_7":8,"_22":23,"_24":25,"_26":27,"_30":31,"_36":37},"user","shoppingCartId","shoppingCart",{"_9":10,"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":14},"id","no-cart","count",0,"free",true,"updatedAt","","paymentGateway","STRIPE","cartItems",[],"loading","locale","en","readerTheme","light","constants",{"_28":29},"paypalClientId","AX53Cwz8jR6rVVzzZiZNWWXl0dGagi-GZrjG-S3Ua14E5nrKMn7DxDQ730O4R8LusLPp49ALn6aRVaEy","publishers",{"_32":33,"_34":35},"companies",[],"universities",[],"needsLocaleCookieSync",false,"routes/_store+/_readers+/email_author.$slug/route",{"_40":41,"_65":-5},"book",{"_9":42,"_43":44,"_45":46,"_47":48,"_49":50,"_51":52},"Z2lkOi8vbGVhbnB1Yi9TdG9yZTo6Qm9va1Byb2R1Y3QvNzY0ODM","title","LadybugDB for Edge Agent AI memory","state","published","contactAuthorMethod","email","aboutText","

Who This Book Is For

This book is for AI engineers, developers, and researchers who are building systems that need to *remember*. If you are working on AI agents, personal assistants, knowledge management tools, or any application where an AI needs persistent, structured, queryable memory — this book gives you the architecture and the implementation.

You do not need prior experience with graph databases. The book starts from first principles and builds up. Familiarity with any programming language and basic database concepts is sufficient.

What This Book Is About

AI agents today have a memory problem. Vector stores give them semantic search — the ability to find things that *sound like* a query. But human memory is not a search engine. It is a layered, structured system that captures relationships between things, causality between events, temporal ordering of experiences, and hierarchical composition of meaning.

This book shows you how to build that kind of memory using LadybugDB — an embedded graph database that speaks Cypher, runs inside your application process, and provides the structural foundation for knowledge that goes beyond retrieval.

We start with the property graph model and the Cypher query language, establishing the tools you need to work with graph data. We then move into typed schemas and ontologies — how table declarations in LadybugDB become a formal specification of what your knowledge graph can express, enforced by the database itself.

The middle chapters tackle the hard problems of knowledge representation. How do you model relationships that involve more than two participants? How do you create relationships *about* relationships? How do you reason about causality, temporal ordering, and hierarchical meaning? We solve these problems through hypergraphs, metagraphs, and the bipartite layered graph pattern — all implemented in standard Cypher without requiring specialized databases.

We then build the semantic spacetime framework, where every piece of knowledge has both a meaning and a lifespan, and where the graph captures not just what is known but *when* it was learned and *when* it expires.

The culminating chapter constructs a complete agentic memory ontology — a production-ready schema with entity hierarchies (Entity, Fact, Event, Memory), twelve typed edge node tables for relationships, a time tree for temporal anchoring, and vector indexes for semantic search. This is not a toy example. It is a working architecture for AI systems that need to understand context, causality, and the passage of time.

The final chapters cover practical integration: reading from relational databases, bulk data import, and graph algorithms that reveal hidden structure in the knowledge graph — importance rankings, community clusters, connectivity patterns, and causal cycles.

What You Will Learn

- How the labeled property graph model works and why it is better suited for AI memory than RDF triples
- The Cypher query language — creating, querying, and manipulating graph data in LadybugDB
- How typed schemas create enforceable ontologies, and how polymorphic relations reduce schema complexity by 5x
- Subgraphs for isolating knowledge by user, domain, or context
- The progression from triples to hypergraphs to metagraphs, and the bipartite pattern that makes metagraphs practical
- Semantic spacetime — organizing knowledge along axes of meaning and time
- Vector indexes and how to combine semantic search with graph traversal for retrieval that is both relevant and structurally grounded
- A complete, step-by-step construction of an agentic memory ontology
- Importing data from PostgreSQL, SQLite, DuckDB, CSV, and Parquet
- Graph algorithms for discovering importance, communities, and structural patterns in knowledge

How This Book Is Structured

The book follows a deliberate arc from foundations to architecture:

Foundations (Chapters 0–2) introduce the problem space, the property graph model, and the Cypher query language.

Structure (Chapters 3–4) show how typed schemas and subgraphs create the organizational framework for knowledge.

Expressiveness (Chapters 5–7) tackle increasingly powerful graph structures — hypergraphs, metagraphs, and the semantic spacetime framework — that model the complexity of human-like memory.

Application (Chapters 8–9) combine vector search with graph structure and build the complete agentic memory ontology.

Integration (Chapters 10–11) cover practical concerns: relational database interoperability and graph algorithms for knowledge analysis.

Each chapter builds on the previous ones. Code examples are executable against LadybugDB. The ontology constructed in Chapter 9 draws on every concept introduced in the preceding chapters.

Why LadybugDB

LadybugDB is an embedded property graph database built on the Kùzu engine. It runs inside your application process — no server, no network latency, no deployment infrastructure. It stores data in typed, schema-enforced tables with columnar storage and vectorized query processing. It supports ACID transactions, HNSW vector indexes, and polymorphic relationship tables.

For AI memory, these properties matter: the database travels with the agent, queries respond in microseconds, the schema enforces ontological rules, and vector search integrates with graph traversal in a single query. It is the right tool for building memory systems that need to be fast, portable, structured, and semantically searchable.

","authors",[53],{"_9":54,"_55":56,"_5":57},"Z2lkOi8vbGVhbnB1Yi9TdG9yZTo6UHJvZHVjdEF1dGhvci84MTg4MQ","name","Volodymyr Pavlyshyn",{"_58":59},"avatar",{"_60":61,"_62":63,"_64":14},"url","https://d39qdlcrvnra4b.cloudfront.net/avatars/211223/medium/552391298_4018935778371189_3873749716184464813_n.jpg?1758620373","styleName","medium","exists","currentUser","routes/_store+/_layout","routes/_store+/_readers+/_layout","actionData","errors"]

Email the Author