Titlebook: Database Programming Languages; 8th International Wo Giorgio Ghelli,Gösta Grahne Conference proceedings 2002 Springer-Verlag Berlin Heidelb

Filament

书目名称Database Programming Languages影响因子(影响力)




书目名称Database Programming Languages影响因子(影响力)学科排名




书目名称Database Programming Languages网络公开度




书目名称Database Programming Languages网络公开度学科排名




书目名称Database Programming Languages被引频次




书目名称Database Programming Languages被引频次学科排名




书目名称Database Programming Languages年度引用




书目名称Database Programming Languages年度引用学科排名




书目名称Database Programming Languages读者反馈




书目名称Database Programming Languages读者反馈学科排名

奇怪

978-3-540-44080-2Springer-Verlag Berlin Heidelberg 2002

Lineage

Corroborate

Perspectives in Neural Computinguery containment both in the absence and presence of constraints. Containment without constraints for CRPQs is EXPSPACE-complete, as opposed to only NP-complete for relational conjunctive queries. Our past experience with implementing similar algorithms suggests that staying in PSPACE might still be

投票

LEER

A. Lőrincz,B. Szatmáry,G. Szirtes,B. Takácsmodel) and a query as a formula of the temporal logic .. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.

LEER

Hervé A. Bourlard,Nelson Morgantidimensional database to changing requirements. In earlier work we proposed a temporal multidimensional model and ., a query language supporting it, accounting for dimension updates and schema evolution at a high level of abstraction. In this paper we present our implementation of the model and the

脱水

Ingenuity

Hervé A. Bourlard,Nelson Morganencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models.

debouch

Hervé A. Bourlard,Nelson Morganof hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and de