東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Techniques for operational data ware...

Luo, Gang.

Linked to FindBook

Google Book

Amazon

博客來

Techniques for operational data warehousing.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Techniques for operational data warehousing./
Author:	Luo, Gang.
Description:	140 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4111.
Contained By:	Dissertation Abstracts International65-08B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143213
ISBN:	0496011898

Techniques for operational data warehousing.
Luo, Gang.

Techniques for operational data warehousing. - 140 p.

Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4111.

Thesis (Ph.D.)--The University of Wisconsin - Madison, 2004.

Traditionally, data warehouses have been used to analyze historical data. Recently, there has been a growing trend to use data warehouses to support real-time decision-making about an enterprise's day-to-day operations. The needs for improved query and update performance are two challenges that arise from this new application of a data warehouse. To address these needs, new data warehouse functionality is needed including: (1) better access to early query results while queries are running and (2) making the information stored in a data warehouse as fresh as possible.

ISBN: 0496011898Subjects--Topical Terms:

626642
Computer Science.

Techniques for operational data warehousing.
LDR:02991nmm 2200313 4500 001 1846776
005 20051103093546.5
008 130614s2004 eng d
020 $a 0496011898
035 $a (UnM)AAI3143213
035 $a AAI3143213
040 $a UnM $c UnM
100 1 $a Luo, Gang. $3 1934871
245 1 0 $a Techniques for operational data warehousing.
300 $a 140 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4111.
500 $a Supervisor: Jeffrey F. Naughton.
502 $a Thesis (Ph.D.)--The University of Wisconsin - Madison, 2004.
520 $a Traditionally, data warehouses have been used to analyze historical data. Recently, there has been a growing trend to use data warehouses to support real-time decision-making about an enterprise's day-to-day operations. The needs for improved query and update performance are two challenges that arise from this new application of a data warehouse. To address these needs, new data warehouse functionality is needed including: (1) better access to early query results while queries are running and (2) making the information stored in a data warehouse as fresh as possible.
520 $a For the first problem, we introduce a non-blocking parallel hash ripple join algorithm to support interactive queries in a parallel DBMS. Compared to previous work, our parallel hash ripple join algorithm (1) combines parallelism with sampling to speed convergence, and (2) maintains good performance in the presence of memory overflow. We demonstrate the performance of our approach with a prototype implementation in a parallel DBMS.
520 $a For the second problem, we propose two techniques to improve the efficiency of immediate materialized view maintenance. We identify two challenges for immediate materialized view maintenance: (1) In parallel RDBMSs, simple single-node updates to base relations can give rise to expensive all-node operations for materialized view maintenance. (2) Immediate materialized view maintenance with transactional consistency, if enforced by generic concurrency control mechanisms, can result in low levels of concurrency and high rates of deadlock.
520 $a To address the first challenge, we present a comparison of three materialized join view maintenance methods in a parallel RDBMS, which we refer to as the naive, auxiliary relation, and global index methods. The last two methods improve performance at the cost of using more space.
520 $a To address the second challenge, we extend previous high concurrency locking techniques to apply to materialized view maintenance, and show how this extension can be implemented even in the presence of indices on the materialized view.
590 $a School code: 0262.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Wisconsin - Madison. $3 626640
773 0 $t Dissertation Abstracts International $g 65-08B.
790 1 0 $a Naughton, Jeffrey F., $e advisor
790 $a 0262
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143213