Horizontal data partitioning in database design

Ceri, S.; Negri, Mauro; Pelagatti, Giuseppe

doi:10.1145/582374.582376

Cited by 22 publications

(15 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simple replications allows a database to scale retrieve operations. To scale write operations it is necessary a distributed database through several nodes, each one containing a set of the whole database (horizontal partitioning/sharding [18]). …”

Section: Context Organizationmentioning

confidence: 99%

Context storage for M2M scenarios

Antunes

Gomes

Aguiar

2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-As the number of environmental sensors grows, it becomes increasingly difficult to manage, store and process all these sources of information. Several context representation schemes try to standardize this information, however none of them have been widely adopted. Instead of proposing yet another context representation scheme, we discuss efficient ways to deal with this diversity of representation schemes. We defined the basic requirements for flexible context storage systems, proposed an implementation and compared our implementation against two other approaches. Our solution provides more value than the remaining solutions without suffering a significant decrease in performance.

show abstract

Section: Context Organizationmentioning

confidence: 99%

Context storage for M2M scenarios

Antunes

Gomes

Aguiar

2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…HF using min-term predicate is first proposed by Ceri et al (1982) [5]. Navathe et al (1984) used attribute usage matrix (AUM) and Bond energy algorithm to produce vertical fragments [6].…”

Section: Literature Reviewmentioning

confidence: 99%

“…We have calculated locality precedence of each attribute from the MCRUD matrix of Accounts relation according to the cost functions of equation (1)- (5). Calculating the locality precedence of the attribute BrName is shown in Figure 6-8.…”

Section: Calculation Of Alpmentioning

confidence: 99%

A New Technique for Database Fragmentation in Distributed Systems

Khan¹,

Hoque²

2010

IJCA

View full text Add to dashboard Cite

Improving the performance of a database system is one of the key research issues now a day. Distributed processing is an effective way to improve reliability and performance of a database system. Distribution of data is a collection of fragmentation, allocation and replication processes. Previous research works provided fragmentation solution based on empirical data about the type and frequency of the queries submitted to a centralized system. These solutions are not suitable at the initial stage of a database design for a distributed system. In this paper we have presented a fragmentation technique that can be applied at the initial stage as well as in later stages of a distributed database system for partitioning the relations. Allocation of fragments is done simultaneously in our algorithm. Result shows that proposed technique can solve initial fragmentation problem of relational databases for distributed systems properly.

show abstract

“…In [7] we gave a global outline of the splitting algorithm. Later, in [15] a similar goal was pursued, in [31] only vertical partitioning is considered. Let us assume that we have a set of queries and updates and the frequencies of their usage.…”

Section: Unit Of Allocation and Processing Schedulesmentioning

confidence: 99%

Data allocation in distributed database systems

Apers

1988

ACM Trans. Database Syst.

199

View full text Add to dashboard Cite

The problem of allocating the data of a database to the sites of a communication network is investigated. This problem deviates from the well-known file allocation problem in several aspects. First, the objects to be allocated are not known a priori; second, these objects are accessed by schedules that contain transmissions between objects to produce the result. A model that makes it possible to compare the cost of allocations is presented, the cost can be computed for different cost functions and for processing schedules produced by arbitrary query processing algorithms.For minimizing the total transmission cost, a method is proposed to determine the fragments to be allocated from the relations in the conceptual schema and the queries and updates executed by the users.For the same cost function, the complexity of the data allocation problem is investigated. Methods for obtaining optimal and heuristic solutions under various ways of computing the cost of an allocation are presented and compared.Two different approaches to the allocation management problem are presented and their merits are discussed.

show abstract

Horizontal data partitioning in database design

Cited by 22 publications

References 0 publications

Context storage for M2M scenarios

Context storage for M2M scenarios

A New Technique for Database Fragmentation in Distributed Systems

Data allocation in distributed database systems

Contact Info

Product

Resources

About