分布式数据库的视图和更新

E. Ravve
{"title":"分布式数据库的视图和更新","authors":"E. Ravve","doi":"10.1109/SYNASC.2014.53","DOIUrl":null,"url":null,"abstract":"This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Views and Updates over Distributed Databases\",\"authors\":\"E. Ravve\",\"doi\":\"10.1109/SYNASC.2014.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.\",\"PeriodicalId\":150575,\"journal\":{\"name\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2014.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

该贡献涉及对数据库的逻辑约简技术的系统利用。特定的应用程序是分布式数据库上的视图和更新。逻辑简化技术有两个好处。第一类:语法定义的转换模式,描述数据库模式的转换。它们产生了两种诱导映射,翻译和转导。转换描述数据库实例的诱导转换,转换描述查询的诱导转换。第二种:费曼-沃特约简,应用于关系结构由一组子结构拼凑而成的情况。约简描述了如何通过对组件的查询和对索引集的查询来计算对结构的查询。这些技术的结合和发展使我们能够将关系代数的传播技术和某些类型的数据日志程序的增量重计算技术推广到可定义的元组集的删除或插入情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Views and Updates over Distributed Databases
This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信