找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: Filament
发表于 2025-3-25 07:20:52 | 显示全部楼层
https://doi.org/10.1007/978-1-4612-5967-1solation-Durability) properties of classical transactions. Such extensions, usually called . (ATMs), have been proposed for dealing with new database applications involving long-lived, endless, and cooperative activities. Our approach appeals to non-Markovian theories, in which one may refer to past
发表于 2025-3-25 08:35:27 | 显示全部楼层
发表于 2025-3-25 13:27:46 | 显示全部楼层
发表于 2025-3-25 16:08:25 | 显示全部楼层
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.
发表于 2025-3-26 00:01:55 | 显示全部楼层
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.
发表于 2025-3-26 01:13:53 | 显示全部楼层
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 decidable in PTIME in the size of keys.
发表于 2025-3-26 05:24:51 | 显示全部楼层
发表于 2025-3-26 09:29:45 | 显示全部楼层
Model-Checking Based Data Retrievalmodel) 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.
发表于 2025-3-26 14:44:46 | 显示全部楼层
On Monotone Data Mining Languagesencies.” 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.
发表于 2025-3-26 16:56:02 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 05:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表