DocumentCode
593126
Title
Selecting Materialized Views Based on Top-k Query Algorithm for Lineage Tracing
Author
Jiyun Li ; Xin Li ; Juntao Lv
Author_Institution
Sch. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China
fYear
2012
fDate
6-8 Nov. 2012
Firstpage
46
Lastpage
49
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.
Keywords
data warehouses; query processing; data lineage tracing; data warehouse; lineage tracing query; maintenance cost; materialized view; query frequency; top-k query algorithm; view maintenance; view storage space; Algorithm design and analysis; Data warehouses; Databases; Heuristic algorithms; Maintenance engineering; Marketing and sales; Time factors; Top-k query algorithm; lineage; materialized views; warehouse;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems (GCIS), 2012 Third Global Congress on
Conference_Location
Wuhan
Print_ISBN
978-1-4673-3072-5
Type
conf
DOI
10.1109/GCIS.2012.28
Filename
6449480
Link To Document