Database research at AT&T Bell Laboratories
ACM SIGMOD Record
&mgr;Database: parallelism in a memory-mapped environment (research summary)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Polar: an architecture for a parallel ODMG compliant object database
Proceedings of the ninth international conference on Information and knowledge management
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Journal of Computer Science and Technology
Performance Analysis of Parallel Query Processing Algorithms for Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
The case for object databases in cloud data management
ICOODB'10 Proceedings of the Third international conference on Objects and databases
| Hi-index | 0.00 |
In this paper, we describe four parallel pointer-baesd join algorithms for set-valued attributes. Pointer-based joins will be common in next-generation object-oriented database systems, so efficiently supporting them is crucial to the performance of such systems. Using analysis, we show that while algorithms based on Hybrid-hash provide good performance, algorithms that require less replication will often produce as good or better performance, especially if each set-valued attribute references a small number of nodes.