用并行资源处理m树

Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications Pub Date : 1998-02-23 DOI:10.1109/RIDE.1998.658289

P. Zezula, P. Savino, F. Rabitti, Giuseppe Amato, P. Ciaccia

{"title":"用并行资源处理m树","authors":"P. Zezula, P. Savino, F. Rabitti, Giuseppe Amato, P. Ciaccia","doi":"10.1109/RIDE.1998.658289","DOIUrl":null,"url":null,"abstract":"The problem of the design and implementation of parallel metric tree indexes, called M-trees, is elaborated. Four different object declustering techniques are proposed and tested in order to get a sufficient evidence needed for specifying the pros and cons of their application. In general, the obtained I/O speedup and scaleup levels are high. A method for dealing with the CPU parallelism is also proposed and its speedup and scaleup experimentally tested.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Processing M-trees with parallel resources\",\"authors\":\"P. Zezula, P. Savino, F. Rabitti, Giuseppe Amato, P. Ciaccia\",\"doi\":\"10.1109/RIDE.1998.658289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of the design and implementation of parallel metric tree indexes, called M-trees, is elaborated. Four different object declustering techniques are proposed and tested in order to get a sufficient evidence needed for specifying the pros and cons of their application. In general, the obtained I/O speedup and scaleup levels are high. A method for dealing with the CPU parallelism is also proposed and its speedup and scaleup experimentally tested.\",\"PeriodicalId\":199347,\"journal\":{\"name\":\"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1998.658289\",\"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 Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1998.658289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 26

摘要

阐述了并行度量树索引m -树的设计与实现问题。本文提出并测试了四种不同的对象聚类技术，以获得足够的证据来说明其应用的优缺点。通常，获得的I/O加速和缩放级别很高。提出了一种处理CPU并行性的方法，并进行了加速和放大实验。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Processing M-trees with parallel resources

The problem of the design and implementation of parallel metric tree indexes, called M-trees, is elaborated. Four different object declustering techniques are proposed and tested in order to get a sufficient evidence needed for specifying the pros and cons of their application. In general, the obtained I/O speedup and scaleup levels are high. A method for dealing with the CPU parallelism is also proposed and its speedup and scaleup experimentally tested.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications

自引率

0.00%

发文量