找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Constraint Databases; Gabriel Kuper,Leonid Libkin,Jan Paredaens Book 2000 Springer-Verlag Berlin Heidelberg 2000 Datalog.GIS.Logik.SQL.alg

[復(fù)制鏈接]
查看: 20860|回復(fù): 52
樓主
發(fā)表于 2025-3-21 17:42:13 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Constraint Databases
編輯Gabriel Kuper,Leonid Libkin,Jan Paredaens
視頻videohttp://file.papertrans.cn/236/235922/235922.mp4
概述First comprehensive overview of a new field in database research.Includes supplementary material:
圖書封面Titlebook: Constraint Databases;  Gabriel Kuper,Leonid Libkin,Jan Paredaens Book 2000 Springer-Verlag Berlin Heidelberg 2000 Datalog.GIS.Logik.SQL.alg
描述This book is the first comprehensive survey of the field of constraint databases. Constraint databases are a fairly new and active area of database research. The key idea is that constraints, such as linear or polynomial equations, are used to represent large, or even infinite, sets in a compact way. The ability to deal with infinite sets makes constraint databases particularly promising as a technology for integrating spatial and temporal data with standard re- lational databases. Constraint databases bring techniques from a variety of fields, such as logic and model theory, algebraic and computational geometry, as well as symbolic computation, to the design and analysis of data models and query languages. The book is a collaborative effort involving many authors who have con- tributed chapters on their fields of expertise. Despite this, the book is designed to be read as a whole, as opposed to a collection of individual surveys. In par- ticular, the terminology and the style of presentation have been standardized, and there are multiple cross-references between the chapters. The idea of constraint databases goes back to the late Paris Kanellakis.
出版日期Book 2000
關(guān)鍵詞Datalog; GIS; Logik; SQL; algorithms; constraint; constraints; data model; database; databases; logic; optimiza
版次1
doihttps://doi.org/10.1007/978-3-662-04031-7
isbn_softcover978-3-642-08542-0
isbn_ebook978-3-662-04031-7
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

書目名稱Constraint Databases影響因子(影響力)




書目名稱Constraint Databases影響因子(影響力)學(xué)科排名




書目名稱Constraint Databases網(wǎng)絡(luò)公開度




書目名稱Constraint Databases網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Constraint Databases被引頻次




書目名稱Constraint Databases被引頻次學(xué)科排名




書目名稱Constraint Databases年度引用




書目名稱Constraint Databases年度引用學(xué)科排名




書目名稱Constraint Databases讀者反饋




書目名稱Constraint Databases讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:54:43 | 只看該作者
Constraint Databases, Queries, and Query Languagesnal calculus, the relational algebra, and .. We show how a computationally complete constraint query language can be obtained by augmenting the constraint relational calculus with basic programming language features. We look into some basic model-theoretic issues concerning the constraint relational
板凳
發(fā)表于 2025-3-22 01:48:18 | 只看該作者
地板
發(fā)表于 2025-3-22 07:00:16 | 只看該作者
Query Safety with Constraintsts expressible through queries in the relational calculus, for example, is limited in a number of ways: They have PTIME data complexity, and their expressiveness is well understood. Although relational calculus queries may not return finite results, a natural subclass of the relational calculus does
5#
發(fā)表于 2025-3-22 10:28:20 | 只看該作者
Aggregate Languages for Constraint Databasesry languages give a natural analog of relational calculus in the geometric context, a crucial question concerns how to extend standard aggregation constructs from the relational model to the geometric setting. This question has two components.
6#
發(fā)表于 2025-3-22 15:32:28 | 只看該作者
7#
發(fā)表于 2025-3-22 21:04:20 | 只看該作者
8#
發(fā)表于 2025-3-22 23:27:32 | 只看該作者
Euclidean Query Languagesssive power of language FO + . is too limited. One of these limitations is that FO + . is incapable of expressing queries involving Euclidean distance, betweenness, and collinearity. For example, a query such as “Return all cities in Belgium that are further than 100 km away from Brussels” cannot be
9#
發(fā)表于 2025-3-23 05:01:28 | 只看該作者
10#
發(fā)表于 2025-3-23 07:25:03 | 只看該作者
Linear Repeating Pointstime can easily be introduced as additional attributes in the relational model. Of course, specific operations need to be performed with temporal attributes, such as dealing with date formats, but such operations are not really problematic, and have long been available in commercial systems. Neverth
 關(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 13:59
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
孙吴县| 林周县| 西乌| 舞阳县| 新乡县| 开原市| 拉孜县| 历史| 张北县| 扎兰屯市| 阜南县| 北海市| 长白| 绥德县| 会理县| 广宁县| 额敏县| 同德县| 色达县| 蒲江县| 长葛市| 西盟| 昌宁县| 巫溪县| 洛宁县| 永吉县| 乌恰县| 广水市| 徐水县| 大冶市| 司法| 武宁县| 离岛区| 丹江口市| 三台县| 宁南县| 弥勒县| 定日县| 资中县| 夹江县| 永顺县|