Parallel processing of relational databases on a cellular tree machine

Alexis Koster
{"title":"Parallel processing of relational databases on a cellular tree machine","authors":"Alexis Koster","doi":"10.1109/ICDE.1987.7272374","DOIUrl":null,"url":null,"abstract":"This paper investigates the use of a cellular tree computer, the FFP machine, for parallel processing of relational databases. This machine directly executes Formal Functional Programming (FFP) code. A method to embed SQL statements in FFP programs is described. Schemes for parallel implementation of simple retrieval statements are presented for different I/O architectures. Then techniques for parallel implementation of more complex retrieval statements are given. Because the FFP machine can accommodate the almost unbounded parallelism of FFP programs, execution time analysis shows potential for highly efficient execution of relational database queries on this machine. Modifications of the FFP machine to speed up input/output operations are discussed.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"117 4 Suppl 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE Third International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1987.7272374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates the use of a cellular tree computer, the FFP machine, for parallel processing of relational databases. This machine directly executes Formal Functional Programming (FFP) code. A method to embed SQL statements in FFP programs is described. Schemes for parallel implementation of simple retrieval statements are presented for different I/O architectures. Then techniques for parallel implementation of more complex retrieval statements are given. Because the FFP machine can accommodate the almost unbounded parallelism of FFP programs, execution time analysis shows potential for highly efficient execution of relational database queries on this machine. Modifications of the FFP machine to speed up input/output operations are discussed.
在细胞树机器上并行处理关系数据库
本文研究了使用细胞树计算机FFP机对关系数据库进行并行处理。这台机器直接执行形式函数式编程(FFP)代码。介绍了一种在FFP程序中嵌入SQL语句的方法。针对不同的I/O体系结构,提出了简单检索语句的并行实现方案。然后给出了更复杂的检索语句的并行实现技术。因为FFP机器可以容纳FFP程序几乎无限的并行性,执行时间分析显示了在这台机器上高效执行关系数据库查询的潜力。讨论了FFP机的改进,以加快输入/输出操作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信