我想要一切，现在就要!:分布式多媒体数据库系统中的数据检索

ACM-SE 35 Pub Date : 1997-04-02 DOI:10.1145/2817460.2817525

Sasa Tomic, T. Camp

{"title":"我想要一切，现在就要!:分布式多媒体数据库系统中的数据检索","authors":"Sasa Tomic, T. Camp","doi":"10.1145/2817460.2817525","DOIUrl":null,"url":null,"abstract":"A distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"I want it all and I want it now!: data retrieval in a distributed multimedia database system\",\"authors\":\"Sasa Tomic, T. Camp\",\"doi\":\"10.1145/2817460.2817525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.\",\"PeriodicalId\":274966,\"journal\":{\"name\":\"ACM-SE 35\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 35\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2817460.2817525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 35","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2817460.2817525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种分布式多媒体数据库系统中数据检索的分布式算法。该算法结合了令牌环算法的思想和并行性的使用来解决“打嗝”问题。数据对象在一组磁盘站之间复制，以增加系统的总吞吐量，并防止由于磁盘站故障而导致对象请求无法使用。本文研究了两种复制策略:媒体独立分区和媒体类型分区。

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

查看原文本刊更多论文

I want it all and I want it now!: data retrieval in a distributed multimedia database system

A distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.

求助全文

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

来源期刊

ACM-SE 35

自引率

0.00%

发文量