the pet’s owner. This behavior is referred to as N+1 and it should generally be avoided. For an in-depth guide to working with relationships and joins, refer to the Relationships and Joins documentation PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documentation another message yet another message Note Refer to the Relationships and Joins document for an in-depth discussion of foreign-keys, joins and relationships between models. For full documentation on fields

the pet’s owner. This behavior is referred to as N+1 and it should generally be avoided. For an in-depth guide to working with relationships and joins, refer to the Relationships and Joins documentation PooledPostgresqlExtDatabase • PooledMySQLDatabase • PooledSqliteDatabase • PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documen- another message yet another message Note: Refer to the Relationships and Joins document for an in-depth discussion of foreign-keys, joins and relation- ships between models. For full documentation on fields

tree and graph-structured data - imagine retrieving all of the relations of a graph node to a given depth, for example. Find the upward recommendation chain for member ID 27 Find the upward recommendation PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the Playhouse, extensions and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today)

PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documentation and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today) model_graph([refs=True[, backrefs=True[, depth_first=True]]]) refs (bool) – Follow foreign-key references. backrefs (bool) – Follow foreign-key back-references. depth_first (bool) – Do a depth-first search (False for

tree and graph-structured data - imagine retrieving all of the relations of a graph node to a given depth, for example. Find the upward recommendation chain for member ID 27 Find the upward recommendation PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documentation and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today)

tree and graph-structured data - imagine retrieving all of the relations of a graph node to a given depth, for example. Find the upward recommendation chain for member ID 27 Find the upward recommendation PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documentation and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today)

PooledPostgresqlExtDatabase • PooledMySQLDatabase • PooledSqliteDatabase • PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documen- and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today) backrefs=True[, depth_first=True]]]) Parameters • refs (bool) – Follow foreign-key references. • backrefs (bool) – Follow foreign-key back-references. • depth_first (bool) – Do a depth-first search (False

tree and graph- structured data - imagine retrieving all of the relations of a graph node to a given depth, for example. Find the upward recommendation chain for member ID 27 Find the upward recommendation PooledPostgresqlExtDatabase • PooledMySQLDatabase • PooledSqliteDatabase • PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documen- and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today)

tree and graph- structured data - imagine retrieving all of the relations of a graph node to a given depth, for example. Find the upward recommendation chain for member ID 27 Find the upward recommendation PooledPostgresqlExtDatabase • PooledMySQLDatabase • PooledSqliteDatabase • PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the playhouse documen- and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today)

PooledPostgresqlExtDatabase PooledMySQLDatabase PooledSqliteDatabase PooledSqliteExtDatabase For an in-depth discussion of peewee’s connection pool, see the Connection pool section of the Playhouse, extensions and or. Operator precedence is controlled by python and comparisons can be nested to an arbitrary depth: # User is both and admin and has logged in today (User.is_admin == True) & (User.last_login >= today) primary key of the given node. depth A field representing the relative depth of the given node. root A field representing the relative root node. descendants(node[, depth=None[, include_node=False]])