M. Linna, M. Wanne, and J. Töyli (Finland)
Knowledge Representation, Semistructured Data, Data Structure, Degree of Semistructured Data
In structured database systems the schema has two purposes. First it describes the structure or type of the data and second it describes some constraints on the system. However, there is data that is not constrained by a schema or the schema is loose. This type of data is called semistructured data. In this paper we consider such data, and present novel ideas of how the degree of the structure of the data can be evaluated. We also give a new definition of semistructured data based on the theory of the Adjacency Relation Systems (ARS) and present some motivating examples.
Important Links:
Go Back
