Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Parallel Processing of large node B-trees
IEEE Transactions on Computers
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
An effective way to represent quadtrees
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Computer Vision
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Optimization for Spatial Query Processing
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
DAC '84 Proceedings of the 21st Design Automation Conference
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Z-iteration: a simple method for throughput estimation in time-dependent multi-class systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The PML-tree: an efficient parallel spatial index structure for spatial databases
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Parallel processing of nearest neighbor queries in declustered spatial data
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Using two B+-trees to efficiently process inclusion spatial queries (extended abstract)
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Similarity query processing using disk arrays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Evaluating parallel R-tree implementations on a network of workstations (an extended abstract)
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed Systems
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SMR-tree: an efficient index structure for spatial databases
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Spatial index based on multiple interval segments
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Clone join and shadow join: two parallel spatial join algorithms
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
ACM Computing Surveys (CSUR)
R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Storing spatial data on a network of workstations
Cluster Computing
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
IEEE Transactions on Knowledge and Data Engineering
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
Study of Scalable Declustering Algorithms for Parallel Grid Files
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Hamming Filters: A Dynamic Signature File Organization for Parallel Stores
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
V-Trees - A Storage Method for Long Vector Data
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Parallel R-Tree Search Algorithm on DSVM
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Region proximity in metric spaces and its use for approximate similarity search
ACM Transactions on Information Systems (TOIS)
Parallel Computing - Special issue: High performance computing with geographical data
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
The PN-tree: a parallel and distributed multidimensional index
Distributed and Parallel Databases
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Multiple range query optimization with distributed cache indexing
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Computational Science for Natural Resource Management
Computing in Science and Engineering
Efficient Processing of Nearest Neighbor Queries in Parallel Multimedia Databases
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
Multiple query scheduling for distributed semantic caches
Journal of Parallel and Distributed Computing
Towards personal high-performance geospatial computing (HPC-G): perspectives and a case study
Proceedings of the ACM SIGSPATIAL International Workshop on High Performance and Distributed Geographic Information Systems
DiST: fully decentralized indexing for querying distributed multidimensional datasets
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficient k-nearest neighbor searches for parallel multidimensional index structures
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An index structure for parallel processing of multidimensional data
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Analyzing design choices for distributed multidimensional indexing
The Journal of Supercomputing
Efficient parallel processing for K-nearest-neighbor search in spatial databases
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Parallelizing progressive computation for skyline queries in multi-disk environment
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
A data allocation method for efficient content-based retrieval in parallel multimedia databases
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Parallel multi-dimensional range query processing with R-trees on GPU
Journal of Parallel and Distributed Computing
Efficient distributed multi-dimensional index for big data management
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Parallel spatial query processing on GPUs using R-trees
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Hi-index | 0.00 |
We consider the problem of exploiting parallelism to accelerate the performance of spacial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to maximize the throughput of range queries. This can be achieved by (a) maximizing parallelism for large range queries, and (b) by engaging as few disks as possible on point queries [22].We propose a simple hardware architecture consisting of one processor with several disks attached to it. On this architecture, we propose to distribute the nodes of a traditonal R-tree, with cross-disk pointers (“Multiplexed” R-tree). The R-tree code is identical to the one for a single-disk R-tree, with the only addition that we have to decide which disk a newly created R-tree node should be stored in. We propose and examine several criteria to choose a disk for a new node. The most successful one, termed “proximity index” or PI, estimates the similarity of the new node with the other R-tree nodes already on a disk, and chooses the disk with the lowest similarity. Experimental results show that our scheme consistently outperforms all the other heuristics for node-to-disk assignments, achieving up to 55% gains over the Round Robin one. Experiments also indicate that the multiplexed R-tree with PI heuristic gives better response time than the disk-stripping (=“Super-node”) approach, and imposes lighter load on the I/O sub-system.The speed up of our method is close to linear speed up, increasing with the size of the queries.