Measuring the Performance of Database Object Horizontal Fragmentation Schemes
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Low overhead concurrency control for partitioned main memory databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Towards a scalable and robust multi-tenancy SaaS
Proceedings of the Second Asia-Pacific Symposium on Internetware
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Distribution design in distributed databases using clustering to solve large instances
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Scalable SAPRQL querying processing on large RDF data in cloud computing environment
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
| Hi-index | 0.00 |
The optimal distribution of a database schema over a number of sites in a distributed network is considered. The database is modeled in terms of objects (relations or record sets) and links (predefined joins or CODASYL sets). The design is driven by user-supplied information about data distribution. The inputs required by the optimization model are: 1) cardinality and size information about objects and links, 2) a set of candidate horizontal partitions of relations into fragments and the allocations of the fragments, and 3) the specification of all important transactions, their frequencies, and their sites of origin.