Filament
发表于 2025-3-21 19:23:09
书目名称Database Programming Languages影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0263368<br><br> <br><br>书目名称Database Programming Languages读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0263368<br><br> <br><br>
奇怪
发表于 2025-3-21 22:45:57
978-3-540-44080-2Springer-Verlag Berlin Heidelberg 2002
Lineage
发表于 2025-3-22 01:11:59
http://reply.papertrans.cn/27/2634/263368/263368_3.png
Corroborate
发表于 2025-3-22 07:42:52
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
投票
发表于 2025-3-22 12:14:35
http://reply.papertrans.cn/27/2634/263368/263368_5.png
LEER
发表于 2025-3-22 15:47:46
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
发表于 2025-3-22 19:33:14
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
脱水
发表于 2025-3-23 00:24:30
http://reply.papertrans.cn/27/2634/263368/263368_8.png
Ingenuity
发表于 2025-3-23 04:58:35
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
发表于 2025-3-23 09:05:29
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