This paper gives the theoretical foundations of the Hypernode Model. In Section 2 we discuss the fundamentals of the model, namely hypernodes and types. We also discuss representational expressiveness and type checking complexity. In Section 3 we give the syntax and semantics of Hyperlog. We discuss the complexity of evaluating Hyperlog programs, and their computational and update expressiveness. We also show how Hyperlog can be used for database browsing. In Section 4 we compare our work with other graph-based languages and models. In Section 5 we describe an ongoing implementation.