東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Application semantics driven query p...

Li, Huagang.

FindBook

Google Book

Amazon

博客來

Application semantics driven query processing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Application semantics driven query processing./
作者:	Li, Huagang.
面頁冊數:	161 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-05, Section: B, page: 2658.
Contained By:	Dissertation Abstracts International67-05B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3218871
ISBN:	9780542681349

Application semantics driven query processing.
Li, Huagang.

Application semantics driven query processing. - 161 p.

Source: Dissertation Abstracts International, Volume: 67-05, Section: B, page: 2658.

Thesis (Ph.D.)--University of California, Santa Barbara, 2006.

Traditionally, query processing in relational database systems depends primarily on syntactic analysis, which may not be able to generate efficient solutions for diverse database applications. Nevertheless, there are many database applications with semantic knowledge, which can be exploited to customize the query processing to achieve greater performance gains. In this dissertation, we study how to integrate the application semantics to improve query processing in three prevalent database applications. (i) Data warehouses with multi-append-only-trend data: Data warehouses maintain historical data for the discovery of trends to support decision making activities. In a data warehouse, multiple time-related attributes are usually used to describe data items, and their values tend to increase over time. This tendency is referred to as the multi-append-only-trend property. We show how taking advantage of this property can improve the performance of range aggregate queries, an essential approach for summarizing large data sets. (ii) XML databases with tree shaped data: XML has become the standard for data exchange across different enterprises due to its expressive tree structured data. An XPath expression, a fundamental building block of queries over XML databases often involves content and structure predicates. We focus on XPath expression queries with content range predicates and study how to build an efficient summarization index to facilitate query processing by exploiting the semantic relationship between the range attributes and the corresponding path structures of XML data. (iii) Streaming databases with punctuation data: Punctuation has been recently introduced as a new streaming semantics to address the stateful problem of relational operators when adapted to data stream processing systems. We consider how a given continuous join query (CJQ) can benefit from a set of available punctuation schemes. In other words, if one can identify that a CJQ requires unbounded storage, then this query can be flagged as unsafe and prevented from running. We provide sufficient and necessary conditions for checking whether a CJQ can be safely executed under a given set of punctuation schemes by introducing a novel graph construct, the punctuation graph. We show that the safety checking problem can be done in polynomial time based on this punctuation graph construct.

ISBN: 9780542681349Subjects--Topical Terms:

626642
Computer Science.

Application semantics driven query processing.
LDR:03308nmm 2200277 4500 001 1822672
005 20061129144556.5
008 130610s2006 eng d
020 $a 9780542681349
035 $a (UnM)AAI3218871
035 $a AAI3218871
040 $a UnM $c UnM
100 1 $a Li, Huagang. $3 700212
245 1 0 $a Application semantics driven query processing.
300 $a 161 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-05, Section: B, page: 2658.
500 $a Advisers: Divyakant Agrawal; Amr El Abbadi.
502 $a Thesis (Ph.D.)--University of California, Santa Barbara, 2006.
520 $a Traditionally, query processing in relational database systems depends primarily on syntactic analysis, which may not be able to generate efficient solutions for diverse database applications. Nevertheless, there are many database applications with semantic knowledge, which can be exploited to customize the query processing to achieve greater performance gains. In this dissertation, we study how to integrate the application semantics to improve query processing in three prevalent database applications. (i) Data warehouses with multi-append-only-trend data: Data warehouses maintain historical data for the discovery of trends to support decision making activities. In a data warehouse, multiple time-related attributes are usually used to describe data items, and their values tend to increase over time. This tendency is referred to as the multi-append-only-trend property. We show how taking advantage of this property can improve the performance of range aggregate queries, an essential approach for summarizing large data sets. (ii) XML databases with tree shaped data: XML has become the standard for data exchange across different enterprises due to its expressive tree structured data. An XPath expression, a fundamental building block of queries over XML databases often involves content and structure predicates. We focus on XPath expression queries with content range predicates and study how to build an efficient summarization index to facilitate query processing by exploiting the semantic relationship between the range attributes and the corresponding path structures of XML data. (iii) Streaming databases with punctuation data: Punctuation has been recently introduced as a new streaming semantics to address the stateful problem of relational operators when adapted to data stream processing systems. We consider how a given continuous join query (CJQ) can benefit from a set of available punctuation schemes. In other words, if one can identify that a CJQ requires unbounded storage, then this query can be flagged as unsafe and prevented from running. We provide sufficient and necessary conditions for checking whether a CJQ can be safely executed under a given set of punctuation schemes by introducing a novel graph construct, the punctuation graph. We show that the safety checking problem can be done in polynomial time based on this punctuation graph construct.
590 $a School code: 0035.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of California, Santa Barbara. $3 1017586
773 0 $t Dissertation Abstracts International $g 67-05B.
790 1 0 $a Agrawal, Divyakant, $e advisor
790 1 0 $a Abbadi, Amr El, $e advisor
790 $a 0035
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3218871