Selecting Materialized Views Based on Top-k Query Algorithm for Lineage Tracing

被引：2

作者：

Li, Jiyun ^{[1
]}

Li, Xin ^{[1
]}

Lv, Juntao ^{[2
]}

机构：

[1] Donghua Univ, Sch Comp Sci & Technol, Shanghai, Peoples R China

[2] Shanghai MVS Comp Technol Co Ltd, R& Ctr, Shanghai, Peoples R China

来源：

2012 THIRD GLOBAL CONGRESS ON INTELLIGENT SYSTEMS (GCIS 2012) | 2012年

关键词：

data warehouse; lineage; materialized views; Top-k query algorithm;

D O I：

10.1109/GCIS.2012.28

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：46 / 49

页数：4

共 10 条

[1]

Cui Y., 2000, ACM T DATABASE SYSTE, V25

[2]

Cui Y., 2000, P INT WORKSH DES MAN

[3]

Harinarayan V., 1996, SIGMOD Record, V25, P205, DOI 10.1145/235968.233333

[4]

Larson P.-A., 2007, VLDB 07 SEPT 23 28 2

[5]

Patnaik M. M. S., 1999, P 1999 ACM S APPL CO

[6]

Roustaei R., 2009, APPROACH TRACKING DA

[7]

Rundensteiner E. A., 2005, P ICDE C

[8]

Yang J., 1997, P 23 VLDB C ATH GREE

[9]

Yang J., 1999, DAWAK 99 P 1 INT C D

[10] A framework for designing materialized views in data warehousing environment [J].

Yang, JA ;

Karlapalem, K ;

Li, Q .

PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1997, :458-465

← 1 →