Nova databases are browsable. A user or application program can browse the relationship structure from any doclet to any other doclet it has a link to. The content of any immediate neighbouring doclets can be queried, as well as the entire Nova database itself.

Because there are no rules governing the structure of a Nova database, and there are no theoretical limits to the size, Nova can manage large structures of messy data. It does not impose order in the form of rows, columns and tables, as with relational databases and spreadsheets. Nor does it impose heirarchical tree structures as with file systems. Nova can model all of these structures, as well as any arbitrary structure. A Nova database begins with a single root doclet and from there, doclets can be created, and relationships defined between them. Such structures can evolve organically over time in ways not originially anticipated. Order is NOT imposed by the system itself, but by the user or the application program. Relationships between doclets can be created arbitrarily.

Since there is no inherent heirarchy in Nova databases, any doclet in a database can serve as "root." It all depends on the user's or application program's view. This makes Nova extremely simple and flexible.

What are possible applications for Nova? Many things. A library catalog. Inventory control. Data modeling. Semantic maps. It could be used as the basis of a dictionary or a concordance to a book or an entire library. It could be used as an embedded database in games. Because of minimal imposition of order, the possibilities are endless. A Nova database is essentially a blank sheet of paper -- a medium -- just waiting to contain a message.