{"title":"Calder系统中的分布式流查询规划器","authors":"Y. Liu, Beth Plale, N. Vijayakumar","doi":"10.1109/HPDC.2005.1520992","DOIUrl":null,"url":null,"abstract":"The contribution of this work has two folds. First, we extend the current query planners' cost metric space by introducing network bandwidth cost, query deployment cost and query re-using cost; second, we develop a suite of algorithms for re-using existing query fragments under different scenarios. One of the most important reusable queries is called structure-sharable query.","PeriodicalId":120564,"journal":{"name":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed streaming query planner in Calder system\",\"authors\":\"Y. Liu, Beth Plale, N. Vijayakumar\",\"doi\":\"10.1109/HPDC.2005.1520992\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The contribution of this work has two folds. First, we extend the current query planners' cost metric space by introducing network bandwidth cost, query deployment cost and query re-using cost; second, we develop a suite of algorithms for re-using existing query fragments under different scenarios. One of the most important reusable queries is called structure-sharable query.\",\"PeriodicalId\":120564,\"journal\":{\"name\":\"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPDC.2005.1520992\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.2005.1520992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed streaming query planner in Calder system
The contribution of this work has two folds. First, we extend the current query planners' cost metric space by introducing network bandwidth cost, query deployment cost and query re-using cost; second, we develop a suite of algorithms for re-using existing query fragments under different scenarios. One of the most important reusable queries is called structure-sharable query.