pular para conteúdo
Query optimization in mobile environments Ver prévia deste item
FecharVer prévia deste item
Checando...

Query optimization in mobile environments

Autor: Sumit Ganguly; Rafael Alonso
Editora: New Brunswick, N.J. : Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research, [1993]
Séries: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Edição/Formato   Livro : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
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  Ler mais...
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Sumit Ganguly; Rafael Alonso
Número OCLC: 33027968
Notas: "December, 1993."
Descrição: 29 leaves : illustrations ; 28 cm.
Título da Série: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Responsabilidade: S. Ganguly, R. Alonso.

Resumo:

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."

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.

Ítens Similares

Assuntos Relacionados:(1)

Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/33027968>
library:oclcnum"33027968"
library:placeOfPublication
rdf:typeschema:Place
schema:name"New Brunswick, N.J."
library:placeOfPublication
owl:sameAs<info:oclcnum/33027968>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:author
schema:contributor
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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/37837145>
schema:inLanguage"en"
schema:name"Query optimization in mobile environments"
schema:publisher
rdf:typeschema:Organization
schema:name"Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research"

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.