TY - GEN
T1 - Count-constraints for generating XML
AU - Cohen, Sara
PY - 2006
Y1 - 2006
N2 - The problem of automatically generating XML documents that satisfy given user constraints is considered. Specifically, given (1) a count-constraint C, expressed using XPath and the aggregate function count and (S) a DTD D, the problem of generating an XML document that satisfies both C and D is studied. Classes of count-constraints and DTDs for which the satisfiability problem is polynomial are identified. For these classes it is shown that a satisfying document can be generated efficiently in terms of the input and the output.
AB - The problem of automatically generating XML documents that satisfy given user constraints is considered. Specifically, given (1) a count-constraint C, expressed using XPath and the aggregate function count and (S) a DTD D, the problem of generating an XML document that satisfies both C and D is studied. Classes of count-constraints and DTDs for which the satisfiability problem is polynomial are identified. For these classes it is shown that a satisfying document can be generated efficiently in terms of the input and the output.
UR - http://www.scopus.com/inward/record.url?scp=33747020066&partnerID=8YFLogxK
U2 - 10.1007/11780991_14
DO - 10.1007/11780991_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33747020066
SN - 3540354727
SN - 9783540354727
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 153
EP - 164
BT - Next Generation Information Technologies and Systems - 6th International Conference, NGITS 2006, Proceedings
PB - Springer Verlag
T2 - 6th International Conference on Next Generation Information Technologies and Systems, NGITS 2006
Y2 - 4 July 2006 through 6 July 2006
ER -