用于并行连接操作的面向对象框架

S. Carvalho, Alberto Lerner, Sérgio Lifschitz
{"title":"用于并行连接操作的面向对象框架","authors":"S. Carvalho, Alberto Lerner, Sérgio Lifschitz","doi":"10.1109/DEXA.1999.795141","DOIUrl":null,"url":null,"abstract":"We propose an object oriented framework for one of the most frequent and costly operations in parallel database systems: the parallel join. The framework independently captures a great variety of parameters, such as different load balancing procedures and different synchronization disciplines. The framework addresses DBMS flexibility, configuration and extensibility issues, via the instantiation of known algorithms and facilities for the introduction of new ones. The framework can also be used to compare algorithms and to determine the execution scenario an algorithm is best suited for. Related algorithms are grouped in families, suggesting a taxonomy.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An object-oriented framework for the parallel join operation\",\"authors\":\"S. Carvalho, Alberto Lerner, Sérgio Lifschitz\",\"doi\":\"10.1109/DEXA.1999.795141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an object oriented framework for one of the most frequent and costly operations in parallel database systems: the parallel join. The framework independently captures a great variety of parameters, such as different load balancing procedures and different synchronization disciplines. The framework addresses DBMS flexibility, configuration and extensibility issues, via the instantiation of known algorithms and facilities for the introduction of new ones. The framework can also be used to compare algorithms and to determine the execution scenario an algorithm is best suited for. Related algorithms are grouped in families, suggesting a taxonomy.\",\"PeriodicalId\":276867,\"journal\":{\"name\":\"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEXA.1999.795141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.1999.795141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们提出了一个面向对象的框架,用于并行数据库系统中最频繁和最昂贵的操作之一:并行连接。该框架独立捕获各种参数,例如不同的负载平衡过程和不同的同步规程。该框架通过实例化已知算法和引入新算法的工具来解决DBMS的灵活性、配置和可扩展性问题。该框架还可用于比较算法并确定算法最适合的执行场景。相关算法按家族分组,提出了一种分类法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An object-oriented framework for the parallel join operation
We propose an object oriented framework for one of the most frequent and costly operations in parallel database systems: the parallel join. The framework independently captures a great variety of parameters, such as different load balancing procedures and different synchronization disciplines. The framework addresses DBMS flexibility, configuration and extensibility issues, via the instantiation of known algorithms and facilities for the introduction of new ones. The framework can also be used to compare algorithms and to determine the execution scenario an algorithm is best suited for. Related algorithms are grouped in families, suggesting a taxonomy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信