Count-Constraints for generating XML

  • Authors:
  • Sara Cohen

  • Affiliations:
  • Technion—Israel Institute of Technology

  • Venue:
  • NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 countand (2) 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.