On the performances of checking XML key and functional dependency satisfactions
Files
(Published version)
Date
2009
Authors
Shahriar, M.S.
Liu, J.
Editors
Meersman, R.
Dillon, T.
Herrero, P.
Dillon, T.
Herrero, P.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Book chapter
Citation
Source details - Title: Lecture notes in computer science, 2009 / Meersman, R., Dillon, T., Herrero, P. (ed./s), vol.5871, pp.1254-1271
Statement of Responsibility
Conference Name
Abstract
We propose an implementation and analyze the performances of checking XML key and functional dependency (XFD) satisfaction. The work is based on the definitions of XML key and XFD we proposed for the ordered XML model. It investigates how the number of occurrences of elements in the document and the number of paths in the constraints affect the behavior of XML key and XFD satisfaction checking. The results of the study show that both XML key and XFD can be checked in linear time with the number of tuples and with the number of paths involved in key and XFD. Also, XFD can be checked linearly with the number of XFDs.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2009 Springer-Verlag Berlin Heidelberg