컨텐츠로 이동
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)

요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/33027968>
library:oclcnum"33027968"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
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:isPartOf
schema:name"Query optimization in mobile environments"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.