{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
