Algorithms for loading parallel grid files

Authors:
Jianzhong Li;Doron Rotem;Jaideep Srivastava
Affiliations:
Information and Computing Science Division, Lawrence Berkeley Laboratory, Berkeley, CA and Heilongjiang University, P. R. China;Information and Computing Science Division, Lawrence Berkeley Laboratory, Berkeley, CA and Department of MIS, San Jose State University;Computer Science Department, University of Minnesota at Minneapolis and Information and Computing Science Division, Lawrence Berkeley Laboratory, Berkeley, CA
Venue:
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Year:
1993

Citing 8
Cited 7

Algorithms for Multidimensional Partitioning of Static Files

IEEE Transactions on Software Engineering
An adaptive data placement scheme for parallel database computer systems

Proceedings of the sixteenth international conference on Very large databases
Probabilistic methods in query processing

Probabilistic methods in query processing
On the optimality of disk allocation for Cartesian product files (extended abstract)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Time- and space-optimality in B-trees

ACM Transactions on Database Systems (TODS)
The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer

IEEE Transactions on Parallel and Distributed Systems
Sampling Issues in Parallel Database Systems

EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
CMD: A Multidimensional Declustering Method for Parallel Data Systems

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases

A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data

Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Merging R-Trees: Efficient Strategies for Local Bulk Insertion

Geoinformatica
Efficient Bulk-Loading of Gridfiles

IEEE Transactions on Knowledge and Data Engineering
GBI: A Generalized R-Tree Bulk-Insertion Strategy

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Speeding up construction of PMR quadtree-based spatial indexes

The VLDB Journal — The International Journal on Very Large Data Bases
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing

ACM Transactions on Database Systems (TODS)
In-memory grid files on graphics processors

DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware

Quantified Score

Hi-index	0.00

Visualization

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.