Selection of Materialized View Based on Information Weight and Using Huffman-Tree on Spatial Data Warehouse

Author

Li, JingJing ; Wang, Yao ; Liu, RuiQiang

Author_Institution

Urumqi Nat. High-Tech Dev. Zone

Volume

2

fYear

2006

fDate

Aug. 30 2006-Sept. 1 2006

Firstpage

71

Lastpage

74

Abstract

We propose the method of selecting materialized views on a spatial data warehouse and focus on selecting spatial tuples. The selecting considerations include query frequency, source data and spatial complexity, so we introduce information content and density-based selective materialization, which is different from object-based selective materialization. We present proofs showing that the algorithms are guaranteed to provide a solution that is fairly close to the optimal solution

Keywords

Huffman codes; computational complexity; data models; data warehouses; greedy algorithms; tree data structures; Huffman codes; Huffman-tree; density-based selective materialization; greedy algorithms; information weight; materialized view selection; object-based selective materialization; query frequency; source data complexity; spatial complexity; spatial data warehouse; spatial tuples; time complexity; Acceleration; Classification tree analysis; Costs; Data warehouses; Density measurement; Frequency; Greedy algorithms; Indexing; Performance analysis; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on

Conference_Location

Beijing

Print_ISBN

0-7695-2616-0

Type

conf

DOI

10.1109/ICICIC.2006.345

Filename

1691931