{"title":"连续窗口聚合查询的执行和优化","authors":"Harold Lim, S. Babu","doi":"10.1109/ICDEW.2014.6818345","DOIUrl":null,"url":null,"abstract":"The desire of companies to analyze web-site activity data quickly in order to show personalized content and advertisements to users has led to renewed interest in continuous query processing. One important query class here is windowed aggregation which does time-based windowing followed by grouping and aggregation over a data stream. An example query may aggregate each user's activity over a recent one hour window, and update the result every five minutes. In this paper, we characterize the rich execution plan space for windowed aggregation queries. No such attempt has been made previously to the best of our knowledge. Our second contribution is in developing a cost-based optimizer to pick a good plan from this space for a given query. Finally, we show the effectiveness of the cost-based optimizer.","PeriodicalId":302600,"journal":{"name":"2014 IEEE 30th International Conference on Data Engineering Workshops","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Execution and optimization of continuous windowed aggregation queries\",\"authors\":\"Harold Lim, S. Babu\",\"doi\":\"10.1109/ICDEW.2014.6818345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The desire of companies to analyze web-site activity data quickly in order to show personalized content and advertisements to users has led to renewed interest in continuous query processing. One important query class here is windowed aggregation which does time-based windowing followed by grouping and aggregation over a data stream. An example query may aggregate each user's activity over a recent one hour window, and update the result every five minutes. In this paper, we characterize the rich execution plan space for windowed aggregation queries. No such attempt has been made previously to the best of our knowledge. Our second contribution is in developing a cost-based optimizer to pick a good plan from this space for a given query. Finally, we show the effectiveness of the cost-based optimizer.\",\"PeriodicalId\":302600,\"journal\":{\"name\":\"2014 IEEE 30th International Conference on Data Engineering Workshops\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 30th International Conference on Data Engineering Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDEW.2014.6818345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 30th International Conference on Data Engineering Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDEW.2014.6818345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Execution and optimization of continuous windowed aggregation queries
The desire of companies to analyze web-site activity data quickly in order to show personalized content and advertisements to users has led to renewed interest in continuous query processing. One important query class here is windowed aggregation which does time-based windowing followed by grouping and aggregation over a data stream. An example query may aggregate each user's activity over a recent one hour window, and update the result every five minutes. In this paper, we characterize the rich execution plan space for windowed aggregation queries. No such attempt has been made previously to the best of our knowledge. Our second contribution is in developing a cost-based optimizer to pick a good plan from this space for a given query. Finally, we show the effectiveness of the cost-based optimizer.