Abstract
The paper is focused on a functional querying in graph databases. An attention is devoted to functional modelling of graph databases both at a conceptual and data level.
The notions of graph conceptual schema and graph database schema are considered. The notion of typed attribute is used as a basic structure both on the conceptual and database level.
As a formal approach to declarative graph database querying a version of typed lambda calculus is used.