Research into Verifying Semistructured Data
- Cite this paper as:
- Dobbie G., Sun J., Li Y.F., Lee S.UJ. (2006) Research into Verifying Semistructured Data. In: Madria S.K., Claypool K.T., Kannan R., Uppuluri P., Gore M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg
Semistructured data is now widely used in both web applications and database systems. Much of the research into this area defines algorithms that transform the data and schema, such as data integration, change management, view definition, and data normalization. While some researchers have defined a formalism for the work they have undertaken, there is no widely accepted formalism that can be used for the comparison of algorithms within these areas. The requirements of a formalism that would be helpful in these situations are that it must capture all the necessary semantics required to model the algorithms, it should not be too complex and it should be easy to use. This paper describes a first step in defining such a formalism. We have modelled the semantics expressed in the ORA-SS (Object Relationship Attribute data model for SemiStructured data) data modelling notation in two formal languages that have automatic verification tools. We compare the two models and present the findings.
Keywordsdata model semistructured data automatic verification
Unable to display preview. Download preview PDF.