跳至内容
Query optimization in mobile environments 線上預覽
關閉線上預覽
正在查...

Query optimization in mobile environments

作者: Sumit Ganguly; Rafael Alonso
出版商: New Brunswick, N.J. : Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research, [1993]
叢書: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
提要:
Abstract: "We consider the issue of optimizing queries for a distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consumption at the mobile client. In this scenario, the  再讀一些...
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

文件類型: 圖書
所有的作者/貢獻者: Sumit Ganguly; Rafael Alonso
OCLC系統控制編碼: 33027968
注意: "December, 1993."
描述: 29 leaves : illustrations ; 28 cm.
叢書名: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
責任: S. Ganguly, R. Alonso.

摘要:

Abstract: "We consider the issue of optimizing queries for a distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consumption at the mobile client. In this scenario, the optimal plan for a query depends on the residual battery level of the mobile client and the load at the server. We approach this problem by compiling a query into a sequence of candidate plans, such that for any state of the client-server system, the optimal plan is one of the candidate plans. A general solution is proposed by adapting the partial order dynamic programming search algorithm [17,18] (p.o dp) such that the coverset of the query is the set of candidate plans. We propose two novel algorithms, namely, the linear combinations algorithm and the linearset algorithm (referred to as the linear algorithms) that compute the linearset of a query. The linearset of a query is an approximation to the coverset returned by p.o. dp. We show, by means of simulation, that (1) the linearset is an excellent approximation of the coverset, (2) query compilation using the linear algorithms outperform query compilation using p.o dp by factors ranging from 2 to 9, (3) the time taken to compile queries using the linear algorithms for the general optimization criterion is at most twice the time taken by a System R* like standard query optimizer search algorithm, and (4) the run time overhead incurred by the linear algorithms technique is minimal. The techniques presented in the paper are of general applicability to multi-criterion optimization problems in distributed databases, where each criterion is an additive metric."

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個

類似資料

相關主題:(1)

確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/33027968>
library:oclcnum"33027968"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/33027968>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/895581>
rdf:typeschema:Intangible
schema:name"Distributed databases"@en
schema:name"Distributed databases."@en
schema:contributor
schema:creator
schema:datePublished"1993"
schema:description"Abstract: "We consider the issue of optimizing queries for a distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consumption at the mobile client. In this scenario, the optimal plan for a query depends on the residual battery level of the mobile client and the load at the server. We approach this problem by compiling a query into a sequence of candidate plans, such that for any state of the client-server system, the optimal plan is one of the candidate plans. A general solution is proposed by adapting the partial order dynamic programming search algorithm [17,18] (p.o dp) such that the coverset of the query is the set of candidate plans. We propose two novel algorithms, namely, the linear combinations algorithm and the linearset algorithm (referred to as the linear algorithms) that compute the linearset of a query. The linearset of a query is an approximation to the coverset returned by p.o. dp. We show, by means of simulation, that (1) the linearset is an excellent approximation of the coverset, (2) query compilation using the linear algorithms outperform query compilation using p.o dp by factors ranging from 2 to 9, (3) the time taken to compile queries using the linear algorithms for the general optimization criterion is at most twice the time taken by a System R* like standard query optimizer search algorithm, and (4) the run time overhead incurred by the linear algorithms technique is minimal. The techniques presented in the paper are of general applicability to multi-criterion optimization problems in distributed databases, where each criterion is an additive metric.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/37837145>
schema:inLanguage"en"
schema:name"Query optimization in mobile environments"@en
schema:publisher
schema:url

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.