Algorithms for loading parallel grid files

Jianzhong Li, Doron Rotem, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.

Original languageEnglish
Title of host publicationSIGMOD Record (ACM Special Interest Group on Management of Data)
EditorsPeter Buneman, Sushil Jajodia
Place of PublicationFort Collins, CO, United States
PublisherPubl by ACM
Pages347-356
Number of pages10
Volume22
Edition2
ISBN (Print)0897915925
Publication statusPublished - Jun 1993
Externally publishedYes
EventProceedings of the 1993 ACM SIGMOD International Conference on Management of Data - Washington, DC, USA
Duration: 26 May 199328 May 1993

Other

OtherProceedings of the 1993 ACM SIGMOD International Conference on Management of Data
CityWashington, DC, USA
Period26/5/9328/5/93

Fingerprint

Dynamic programming
Sampling

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

Cite this

Li, J., Rotem, D., & Srivastava, J. (1993). Algorithms for loading parallel grid files. In P. Buneman, & S. Jajodia (Eds.), SIGMOD Record (ACM Special Interest Group on Management of Data) (2 ed., Vol. 22, pp. 347-356). Fort Collins, CO, United States: Publ by ACM.

Algorithms for loading parallel grid files. / Li, Jianzhong; Rotem, Doron; Srivastava, Jaideep.

SIGMOD Record (ACM Special Interest Group on Management of Data). ed. / Peter Buneman; Sushil Jajodia. Vol. 22 2. ed. Fort Collins, CO, United States : Publ by ACM, 1993. p. 347-356.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, J, Rotem, D & Srivastava, J 1993, Algorithms for loading parallel grid files. in P Buneman & S Jajodia (eds), SIGMOD Record (ACM Special Interest Group on Management of Data). 2 edn, vol. 22, Publ by ACM, Fort Collins, CO, United States, pp. 347-356, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, 26/5/93.
Li J, Rotem D, Srivastava J. Algorithms for loading parallel grid files. In Buneman P, Jajodia S, editors, SIGMOD Record (ACM Special Interest Group on Management of Data). 2 ed. Vol. 22. Fort Collins, CO, United States: Publ by ACM. 1993. p. 347-356
Li, Jianzhong ; Rotem, Doron ; Srivastava, Jaideep. / Algorithms for loading parallel grid files. SIGMOD Record (ACM Special Interest Group on Management of Data). editor / Peter Buneman ; Sushil Jajodia. Vol. 22 2. ed. Fort Collins, CO, United States : Publ by ACM, 1993. pp. 347-356
@inproceedings{9d72a47b37044578b6cc0c27caaef1c8,
title = "Algorithms for loading parallel grid files",
abstract = "The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.",
author = "Jianzhong Li and Doron Rotem and Jaideep Srivastava",
year = "1993",
month = "6",
language = "English",
isbn = "0897915925",
volume = "22",
pages = "347--356",
editor = "Peter Buneman and Sushil Jajodia",
booktitle = "SIGMOD Record (ACM Special Interest Group on Management of Data)",
publisher = "Publ by ACM",
edition = "2",

}

TY - GEN

T1 - Algorithms for loading parallel grid files

AU - Li, Jianzhong

AU - Rotem, Doron

AU - Srivastava, Jaideep

PY - 1993/6

Y1 - 1993/6

N2 - The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.

AB - The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0027621751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027621751&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027621751

SN - 0897915925

VL - 22

SP - 347

EP - 356

BT - SIGMOD Record (ACM Special Interest Group on Management of Data)

A2 - Buneman, Peter

A2 - Jajodia, Sushil

PB - Publ by ACM

CY - Fort Collins, CO, United States

ER -