找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Data Base Theory; Volume 2 Hervé Gallaire,Jack Minker,Jean Marie Nicolas Book 1984 Plenum Press, New York 1984 Base.Volume.addi

[复制链接]
查看: 9333|回复: 51
发表于 2025-3-21 16:53:35 | 显示全部楼层 |阅读模式
期刊全称Advances in Data Base Theory
期刊简称Volume 2
影响因子2023Hervé Gallaire,Jack Minker,Jean Marie Nicolas
视频video
图书封面Titlebook: Advances in Data Base Theory; Volume 2 Hervé Gallaire,Jack Minker,Jean Marie Nicolas Book 1984 Plenum Press, New York 1984 Base.Volume.addi
影响因子This is the third book devoted to theoretical issues in data­ bases that we have edited. Each book has been the outgrowth of papers held at a workshop in Toulouse, France. The first workshop, held in 1977 focused primarily on the important topic of logic and databases. The book, Logic and Databases was the result of this effort. The diverse uses of logic for databases such as its use as a theoretical basis for databases, for deduction and for integ­ rity constraints formulation and checking was described in the chapters of the book. The interest generated by the first workshop led to the deci­ sion to conduct other workshops focused on theoretical issues in databases. In addition to logic and databases the types of papers were expanded to include other important theoretical issues such as dependency theory which, although it sometimes uses logic as a basis, does not fit with our intended meaning of logic and databases explored at the first workshop. Because of the broader coverage, and because we anticipated further workshops, the second book was entitled, Advances in Database Theory - Volume 1. The book "Logic and Databases" should be considered Volume 0 of this series.
Pindex Book 1984
The information of publication is updating

书目名称Advances in Data Base Theory影响因子(影响力)




书目名称Advances in Data Base Theory影响因子(影响力)学科排名




书目名称Advances in Data Base Theory网络公开度




书目名称Advances in Data Base Theory网络公开度学科排名




书目名称Advances in Data Base Theory被引频次




书目名称Advances in Data Base Theory被引频次学科排名




书目名称Advances in Data Base Theory年度引用




书目名称Advances in Data Base Theory年度引用学科排名




书目名称Advances in Data Base Theory读者反馈




书目名称Advances in Data Base Theory读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:28:55 | 显示全部楼层
Fernando León-Solís,Hugh O’Donnelldecomposition is compatible with the (classical) vertical decomposition. Algorithms for horizontal decompositions can be used as preprocessors for the decomposition algorithm(s) for the vertical decomposition.
发表于 2025-3-22 04:11:14 | 显示全部楼层
发表于 2025-3-22 08:28:14 | 显示全部楼层
https://doi.org/10.1007/978-3-030-54867-4ficiently. In particular we show that the computational cost of each block of constraint monitoring code introduced within the original unmonitored code is bounded by a constant. It is also shown how this approach provides a simple and unified solution to the problem of integrity control and query/ transaction optimization.
发表于 2025-3-22 12:21:35 | 显示全部楼层
发表于 2025-3-22 13:17:41 | 显示全部楼层
发表于 2025-3-22 19:56:05 | 显示全部楼层
Óscar García Agustín,Malayna Raftopoulosare useful in the context of a database design methodology where the first level of specification consists of a purely declarative definition of both static and transition constraints. A sequence of results about the solvability of the decision problem of these languages is also presented that helps assess the expressive power of the languages.
发表于 2025-3-22 21:24:17 | 显示全部楼层
发表于 2025-3-23 04:25:55 | 显示全部楼层
S. F. Van Amerongen,J. Van Paradijsneral belief that cyclic J-schemas were “bad” Schemas. In this chapter we show that some cyclic J-schemas are in fact useful..We introduce the notion of a simple schema. A schema S is simple if there exists an acyclic schema S’ such that S and S’ satisfy the same set of multi-valued dependencies. The main results in the chapter are as follows:
发表于 2025-3-23 06:24:10 | 显示全部楼层
Compiling Constraint-Checking Programs from First-Order Formulas978-1-349-06754-1
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 10:08
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表