Wednesday, January 28, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Architectures for Parallel Query Processing on Networks of Workstations

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia


  Descargar recurso

Detalles del recurso

Pertenece a: CiteSeerX Scientific Literature Digital Library and Search Engine  

Descripción: Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently, NOWs have been proposed for parallel query processing. This paper explores the various architectures for using NOWs for parallel query processing. We start our discussion with two basic architectures: centralized and distributed. We identify the advantages and disadvantages associated with these architectures. We then propose a hierarchical architecture that inherits the merits of the centralized and distributed architectures while minimizing the associated pitfalls. We also discuss the performance and research issues that require attention in all three architectures. 1 Introduction A relational database is basically a set of relations and each relation is a set of homogeneous tuples. Relations are created, updated and queried using a database language such as SQL. Querying a database is the most important part of any database management system (DBMS). A query comprises of user condit...

Autor(es): Sivarama Dandamudi And -  Sivarama P. D -  Gautam Jain - 

Id.: 46542313

Idioma: English  - 

Versión: 1.0

Estado: Final

Tipo:  application/postscript - 

Tipo de recurso: Texto Narrativo  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Formatos:  application/postscript - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://www.scs.carleton.ca/publications/tech_reports/1997/TR-97-13.ps

Fecha de contribución: 29-jul-2009

Contacto:

Localización:


Otros recursos del mismo autor(es)

  1. Performance Evaluation of a Two-Level Hierarchical Parallel Database System Two typical architectures of parallel database systems are the shared-everything and shared-nothing ...
  2. A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Systems Processor scheduling policies for distributedmemory systems can be divided into space-sharing or tim...
  3. A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Systems Processor scheduling policies for distributedmemory systems can be divided into space-sharing or tim...
  4. An Object-Oriented Approach to Multimedia Database Systems The need for Object-Oriented databases arises from applications such as CAD, CIM or office automati...
  5. Architectures for Parallel Query Processing on Networks of Workstations Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently,...

Otros recursos de la misma colección

  1. Linear Work Suffix Array Construction Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strin...
  2. Exhaustive Whole-Genome Tandem Repeats Search ... in the genomes of organisms, and are a source of polymorphisms observed in individuals, and thus...
  3. A Multilevel Scheme for the Travelling Salesman Problem
  4. CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tourn...
  5. Finding maximal pairs with bounded gap A pair in a string is the occurrence of the same substring twice. A pair is maximal if the two occur...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso