找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: Filament
21#
發(fā)表于 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
22#
發(fā)表于 2025-3-25 08:35:27 | 只看該作者
23#
發(fā)表于 2025-3-25 13:27:46 | 只看該作者
24#
發(fā)表于 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.
25#
發(fā)表于 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.
26#
發(fā)表于 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.
27#
發(fā)表于 2025-3-26 05:24:51 | 只看該作者
28#
發(fā)表于 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.
29#
發(fā)表于 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.
30#
發(fā)表于 2025-3-26 16:56:02 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 07:55
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
阳东县| 清原| 沿河| 洛阳市| 商洛市| 南宁市| 老河口市| 芦山县| 永丰县| 礼泉县| 云安县| 双峰县| 霸州市| 香河县| 顺昌县| 苍南县| 岑巩县| 靖宇县| 丁青县| 和林格尔县| 开鲁县| 肥西县| 鹤峰县| 靖边县| 抚顺县| 芒康县| 乐山市| 长治市| 万安县| 屏南县| 乐至县| 孝义市| 临朐县| 桃江县| 礼泉县| 恭城| 四子王旗| 济南市| 巧家县| 三都| 安化县|