{"title":"基于Top-k查询算法的物化视图选择","authors":"Jiyun Li, Xin Li, Juntao Lv","doi":"10.1109/GCIS.2012.28","DOIUrl":null,"url":null,"abstract":"Lineage tracing queries help to locate updated views quickly in data warehouse. Materialized views can improve the efficiency of the data lineage tracing and view maintenance. This paper, a method to select materialized views using Top-k query algorithm is presented. The selection is based on the query frequency, the view storage space and maintenance cost. Experimental results show that Top-k query algorithm has a better query performance than the Heuristic algorithm for lineage tracing query.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"90 3-4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Selecting Materialized Views Based on Top-k Query Algorithm for Lineage Tracing\",\"authors\":\"Jiyun Li, Xin Li, Juntao Lv\",\"doi\":\"10.1109/GCIS.2012.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Lineage tracing queries help to locate updated views quickly in data warehouse. Materialized views can improve the efficiency of the data lineage tracing and view maintenance. This paper, a method to select materialized views using Top-k query algorithm is presented. The selection is based on the query frequency, the view storage space and maintenance cost. Experimental results show that Top-k query algorithm has a better query performance than the Heuristic algorithm for lineage tracing query.\",\"PeriodicalId\":337629,\"journal\":{\"name\":\"2012 Third Global Congress on Intelligent Systems\",\"volume\":\"90 3-4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third Global Congress on Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCIS.2012.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third Global Congress on Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCIS.2012.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Selecting Materialized Views Based on Top-k Query Algorithm for Lineage Tracing
Lineage tracing queries help to locate updated views quickly in data warehouse. Materialized views can improve the efficiency of the data lineage tracing and view maintenance. This paper, a method to select materialized views using Top-k query algorithm is presented. The selection is based on the query frequency, the view storage space and maintenance cost. Experimental results show that Top-k query algorithm has a better query performance than the Heuristic algorithm for lineage tracing query.