{"title":"基于新鲜度和同步性的周期数据序列集成","authors":"K. Munakata, Masatoshi Yoshikawa, Shunsuke Uemura","doi":"10.1109/RIDE.2000.836499","DOIUrl":null,"url":null,"abstract":"Presents frameworks for acquiring data from servers that broadcast data periodically at constant intervals. We assume that different servers broadcast data for different periods at different intervals, and our focus is on choosing a fresh and synchronous combination of data, each obtained from a different server. We define an evaluation function to determine which data combination to use, taking into account both the freshness and the synchronousness of the data. Then we present a data acquisition framework for consecutive queries. For efficiency, the points of time that give the optimum data combinations are pre-computed. We show the pre-computation results can also be used for interactive queries which enable application programs to set limits on the data synchronousness and response time.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Integrating periodic data sequences based on freshness and synchronousness\",\"authors\":\"K. Munakata, Masatoshi Yoshikawa, Shunsuke Uemura\",\"doi\":\"10.1109/RIDE.2000.836499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents frameworks for acquiring data from servers that broadcast data periodically at constant intervals. We assume that different servers broadcast data for different periods at different intervals, and our focus is on choosing a fresh and synchronous combination of data, each obtained from a different server. We define an evaluation function to determine which data combination to use, taking into account both the freshness and the synchronousness of the data. Then we present a data acquisition framework for consecutive queries. For efficiency, the points of time that give the optimum data combinations are pre-computed. We show the pre-computation results can also be used for interactive queries which enable application programs to set limits on the data synchronousness and response time.\",\"PeriodicalId\":113544,\"journal\":{\"name\":\"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.2000.836499\",\"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 Research Issues in Data Engineering. RIDE 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.2000.836499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Integrating periodic data sequences based on freshness and synchronousness
Presents frameworks for acquiring data from servers that broadcast data periodically at constant intervals. We assume that different servers broadcast data for different periods at different intervals, and our focus is on choosing a fresh and synchronous combination of data, each obtained from a different server. We define an evaluation function to determine which data combination to use, taking into account both the freshness and the synchronousness of the data. Then we present a data acquisition framework for consecutive queries. For efficiency, the points of time that give the optimum data combinations are pre-computed. We show the pre-computation results can also be used for interactive queries which enable application programs to set limits on the data synchronousness and response time.