Skip to main content

Count-Constraints for Generating XML

  • Conference paper
Next Generation Information Technologies and Systems (NGITS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4032))

  • 475 Accesses

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 count and (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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aboulnaga, A., Naughton, J., Zhang, C.: Generating synthetic complex-structured xml data. In: Proc. 5th International Workshop on the Web and Databases, Madison Wisconsin, USA (May 2001)

    Google Scholar 

  2. Barbosa, D., Mendelzon, A., Keenleyside, J., Lyons, K.: ToXgene: an extensible template-based data generator for XML. In: Proc. 4th International Workshop on the Web and Databases, Santa Barbara California, USA (June 2002)

    Google Scholar 

  3. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of dtds. In: Proc. 24th Symposium on Principles of Database Systems, Baltimore, Maryland, USA. ACM Press, New York (2005)

    Google Scholar 

  4. Böhme, T., Rahm, E.: XMach-1: A benchmark for XML data management. In: Datenbanksysteme in Büro, Technik und Wissenschaft, Oldenburg, Germany (2001)

    Google Scholar 

  5. Bressan, S., Dobbie, G., Lacroix, Z., Lee, M., Li, Y., Nambiar, U., Wadhwa, B.: X007: applying 007 benchmark to XML query processing tool. In: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, Atlanta, Georgia, USA (November 2001)

    Google Scholar 

  6. Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 122–137. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Hidders, J.: Satisfiability of XPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Runapongsa, K., Patel, J., Jagadish, H., Chen, Y., Al-Khalifa, S.: The Michigan benchmark: towards XML query performance diagnostics. Information Systems 31(2), 73–97 (2006)

    Article  Google Scholar 

  9. Schmidt, A., Waas, F., Kersten, M., Carey, M., Manolescu, I., Busse, R.: XMark: a benchmark for XML data management. In: Proc. 28th International Conference on Very Large Data Bases, Hong Kong, China. Morgan Kaufmann Publishers, San Francisco (2002)

    Google Scholar 

  10. Yao, B., Özsu, M., Khandelwal, N.: XBench benchmark and performance testing of XML dbmss. In: Proc. 20th International Conference on Data Engineering, Boston, Massachusetts, USA. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, S. (2006). Count-Constraints for Generating XML. In: Etzion, O., Kuflik, T., Motro, A. (eds) Next Generation Information Technologies and Systems. NGITS 2006. Lecture Notes in Computer Science, vol 4032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780991_14

Download citation

  • DOI: https://doi.org/10.1007/11780991_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35472-7

  • Online ISBN: 978-3-540-35473-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics