Towards Verifying Semistructured Data
- Title
- Towards Verifying Semistructured Data
- Author
- Lee, Scott Uk-Jin
- Issue Date
- 2007-01
- Publisher
- Australian Computer Society, Inc.
- Citation
- APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling, v. 67, Page. 11-14
- Abstract
- Semistructured data is now widely used in both web applications and database systems. There are many research challenges in this area, such as data integration, change management, view definition, and data normalization. Traditionally in these areas a formalism is defined for the database model, and properties of the algorithms can be reasoned about, such as the dependency preserving property of the normalization algorithm in the relational data model. Because research into semistructured data is still in its infancy, many algorithms have been defined in this area and a number of formalisms have been proposed but there is no widely accepted formalism that is generally accepted to reason about the properties of the algorithms. Such a formalism must capture all the necessary semantics required to model the algorithms, should not be too complex, and should be easy to use.
- URI
- https://dl.acm.org/citation.cfm?id=1274457https://repository.hanyang.ac.kr/handle/20.500.11754/106210
- ISBN
- 1-920-68285-X
- Appears in Collections:
- COLLEGE OF COMPUTING[E](소프트웨어융합대학) > COMPUTER SCIENCE(소프트웨어학부) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML