BIROn (Birkbeck, University of London) · 2005 · 12 citations · 5 references
ComputingComputer ScienceAlgebraData StructuresDatabasesQuery ProcessingRelational AlgebraRelational Data ModelRelational DatabasesStructured Query LanguageXml DatabasesNested Relational ModelingQuery EquivalenceRelational Query LanguagesRelational Query ProcessingXml Query LanguagesXquery
the relational model it has been shown that the rela- tional algebra has the same expressive power as the nested relational algebra, as far as queries over relations and with results are concerned (6). Hence, for each query that uses the nested relational model and that, with a table as input always has a table as output, there exists an equivalent query that only uses the relational model. In analogy, we study a related flat-flat problem for XQuery: for each expression containing operations that con- struct new nodes and whose XML result contains only orig- inal nodes, there exists an equivalent flat expression in XQuery that does not construct new nodes.
5
Object identity as a query language primitive
Serge Abiteboul, Paris C. Kanellakis · Journal of the ACM · 1998 · 67 citations · Full text
On the completeness of object-creating database transformation languages
Jan Van den Bussche, Dirk Van Gucht, Marc Andries et al. · Journal of the ACM · 1997 · 35 citations · Full text
Jan Hidders, Philippe Michiels, Jan Paredaens et al. · ACM SIGMOD Record · 2005 · 13 citations