Cardinality constraints in disjunctive deductive databases

  • Authors:
  • Dietmar Seipel;Ulrich Geske

  • Affiliations:
  • University of Würzburg, Department of Computer Science, Würzburg, Germany;Fraunhofer First Berlin, Berlin, Germany

  • Venue:
  • Proceedings of the 2nd international conference on Semantics in databases
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper surveys work of the authors on pattern languages for tree-structured data with XML as the main application in mind. The main focus is on formalisms from formal language theory and logic. In particular, it considers attribute grammars, query automata, tree-walking automata, extensions of first-order logic, and monadic second-order logic. It investigates expressiveness as well as the complexity of query evaluation and some optimization problems. Finally, formalisms that allow comparison of attribute values are considered.