B+ retake: sustaining high volume inserts into large data pages
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
Improving Data Access in P2P Systems
IEEE Internet Computing
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Path conscious caching of B+ tree indexes in a shared disks cluster
Journal of Parallel and Distributed Computing
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
PeerCredential: a reputation-based trust framework for Peer-to-Peer applications
International Journal of Information and Computer Security
MARK-OPT: A Concurrency Control Protocol for Parallel B-Tree Structures to Reduce the Cost of SMOs
IEICE - Transactions on Information and Systems
Dynamic Data Migration Policies for Query-Intensive Distributed Data Environments
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Comparing Hadoop and Fat-Btree based access method for small file I/O applications
WAIM'10 Proceedings of the 11th international conference on Web-age information management
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Maintaining cache coherency for b+ tree indexes in a shared disks cluster
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Self-star Properties in Complex Information Systems
| Hi-index | 0.00 |
We propose a parallel directory structure, Fat Btree,to improve high speed access for parallel database systems in shared nothing environments. The Fat Btree has a three fold aim: to provide an indexing mechanism for fast retrieval in each processor, to balance the amount of data among distributed disks, and to reduce synchronization costs between processors during update operations. We use a probability based model to compare the throughput and response time of the Fat Btree with two ordinary parallel Btree structures, with copies of a whole Btree in each processor, and storing index nodes in a processor. The comparison results indicate that the Fat Btree is suitable for actual parallel database systems that accept update operations.