passa ai contenuti
Query optimization in mobile environments Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Query optimization in mobile environments

Autore: Sumit Ganguly; Rafael Alonso
Editore: New Brunswick, N.J. : Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research, [1993]
Serie: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
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  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Sumit Ganguly; Rafael Alonso
Numero OCLC: 33027968
Note: "December, 1993."
Descrizione: 29 leaves : illustrations ; 28 cm.
Titolo della serie: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Responsabilità: S. Ganguly, R. Alonso.

Abstract:

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

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.

Documenti simili

Soggetti correlati:(1)

Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


Primary Entity

<http://www.worldcat.org/oclc/33027968> # Query optimization in mobile environments
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "33027968" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/37837145#Place/new_brunswick_n_j> ; # New Brunswick, N.J.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
    schema:about <http://id.worldcat.org/fast/895581> ; # Distributed databases
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/41151713> ; # Rafael Alonso
    schema:creator <http://viaf.org/viaf/54229609> ; # Sumit Ganguly
    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 <http://experiment.worldcat.org/entity/work/data/37837145#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/37837145#Series/technical_report> ; # Technical report ;
    schema:name "Query optimization in mobile environments"@en ;
    schema:productID "33027968" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/33027968#PublicationEvent/new_brunswick_n_j_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/37837145#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/33027968> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/37837145#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
    a bgn:Agent ;
    schema:name "Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research" ;
    .

<http://experiment.worldcat.org/entity/work/data/37837145#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
    a schema:Organization ;
    schema:name "Rutgers University. Department of Computer Science. Laboratory for Computer Science Research." ;
    .

<http://experiment.worldcat.org/entity/work/data/37837145#Place/new_brunswick_n_j> # New Brunswick, N.J.
    a schema:Place ;
    schema:name "New Brunswick, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/37837145#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/37837145#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
    schema:hasPart <http://www.worldcat.org/oclc/33027968> ; # Query optimization in mobile environments
    schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/37837145#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/33027968> ; # Query optimization in mobile environments
    schema:name "Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;" ;
    .

<http://id.worldcat.org/fast/895581> # Distributed databases
    a schema:Intangible ;
    schema:name "Distributed databases"@en ;
    .

<http://viaf.org/viaf/41151713> # Rafael Alonso
    a schema:Person ;
    schema:familyName "Alonso" ;
    schema:givenName "Rafael" ;
    schema:name "Rafael Alonso" ;
    .

<http://viaf.org/viaf/54229609> # Sumit Ganguly
    a schema:Person ;
    schema:familyName "Ganguly" ;
    schema:givenName "Sumit" ;
    schema:name "Sumit Ganguly" ;
    .


Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.