Titlebook: Database Programming Languages; 9th International Wo Georg Lausen,Dan Suciu Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2

Tractable

https://doi.org/10.1007/978-94-007-6001-1 an architecture for automatically generating application-level checks from application and database integrity constraint specifications. We focus on EJB-database interactions as a concrete context for our work, but our results are applicable to other programming language-database interactions.

aesthetician

特別容易碎

CRASS

Containment of Relational Queries with Annotation Propagationharacterization suggests that annotation-containment is more complex than query containment, we show that the annotation-containment problem is NP-complete, thus putting it in the same complexity class as query containment. In addition, we show that the annotation placement problem, which was first

apropos

無(wú)法取消

legislate

DIS

Andrea Eugenio Cavanna,Andrea Nanit prominently one that can be evaluated in linear time (cf. [1,3]). Next we discuss the parallel complexity of XPath. While full XPath is P-complete w.r.t. combined complexity, various (minor) restrictions are known which reduce the complexity to highly parallelizable complexity classes [2]. Finally

寒冷

率直

An Epistemology for Phenomenology? is based on the PVS theorem prover technology, and it combines static and dynamic checking to attain reasonable performance. The theorem prover technology is itself based on a sophisticated type system equipped with a form of semantic subtyping and parametric polymorphism. The higher-order features