Titlebook: Database Theory - ICDT ‘95; 5th International Co Georg Gottlob,Moshe Y. Vardi Conference proceedings 1995 Springer-Verlag Berlin Heidelberg

從屬

On two forms of structural recursion,lent . query requires exponential space. Thus, as a mechanism for implementing . over complex objects, . is strictly less powerful than .. This inefficiency is in contrast to a previous result that uniformly translates efficient . programs into efficient . programs, but over a language with higher-o

circuit

極肥胖

,Languages for polynomial-time queries — An ongoing quest,

hypertension

攀登

Distributed query optimization in loosely coupled multidatabase systems,l applications accessing data at more than one .. An important research issue in . is query optimization. The query optimization problem in . is quite different from the case of distributed database system (.) since, due to schema heterogeneity and local autonomy of component ., is not possible to a

虛弱的神經(jīng)

LASH

Visual-Field

DATALOG queries with stratified negation and choice: from , to ,,,ution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a “choice” construct to capture non-determinism of stable models (iii) the ability to bind a query execution to the complexity class that includes the problem at hand, and (iv) a ge

假裝是你

On the Kolmogorov expressive power of boolean query languages,lean queries), and gives a meaningful definition of the expressive power of a query language in a single finite model..The notion of . of a boolean query language . in a finite model A is defined by considering two values: the Kolmogorov complexity of the isomorphism type of A, equal to the length o

陳列