Fragmenting relations horizontally using a knowledge-based approach

Shin, Dong-Guk; Irani, Keki B.

doi:10.1109/32.92906

Cited by 17 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Navathe improved the previous work on VF using a graphical method [5]. Another technique is proposed by Shin and Irani based on knowledge technique, which is derived from user queries to the database [6]. Another technique is proposed by Ra on a graph-based algorithm [7].…”

Section: Related Workmentioning

confidence: 99%

An Apriori-Based Vertical Fragmentation Technique for Heterogeneous Distributed Database Transactions

Ramesh

Kumar

et al. 2014

Intelligent Computing, Networking, and Informatics

View full text Add to dashboard Cite

Many distributed applications have become very useful in these days, such as reservation enquiry in railways and airways, status of postal, and Internet banking. All these are related to common database, through which they are connected to provide the result of user's query. But, the purpose of the above-distributed application will fail if we do not work cleverly on distributed database design. If we design the database with some motive to improve the performance of the application, the tolerance of the distributed database increases and it can handle several queries concurrently. So, improving the performance of a database system is a challenging research area. Earlier approaches have suggested fragmentation solution based on the data access and frequency of the queries. Previously distributed design used attribute matrix approach to generate a new matrix upon which they applied to their clustering algorithm to find out different fragments, which involves little bit complicated computation. In this paper, we present a vertical fragmentation technique, which uses attribute usage matrix instead of attribute affinity matrix by applying apriori algorithm on usage matrix for partitioning the relations. Our result comprises the proposed technique, which reduces the overhead of complicated computations.

show abstract

Section: Related Workmentioning

confidence: 99%

An Apriori-Based Vertical Fragmentation Technique for Heterogeneous Distributed Database Transactions

Ramesh

Kumar

et al. 2014

Intelligent Computing, Networking, and Informatics

View full text Add to dashboard Cite

show abstract

“…Ozsu and Valduriez (1999) compute horizontal fragmentation of a relation using (minterm) predicates derived from user queries. Shin and Irani (1991) utilize the user query expressions and certain knowledge about data for computing derived horizontal fragmentation. In Ezeife and Barker (1995) the authors present a number of horizontal fragmentation algorithms for four different class models in a distributed object-based system, and in Ezeife and Barker (1998) they propose different vertical fragmentation algorithms for four types of class object models.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Fragmentation Approach for Distributed Deductive Database Systems

Lim

2001

Knowledge and Information Systems

View full text Add to dashboard Cite

Fragmentation of base relations in distributed database management systems increases the level of concurrency and therefore system throughput for query processing. Algorithms for horizontal and vertical fragmentation of relations in relational, objectoriented and deductive databases exist; however, hybrid fragmentation techniques based on variable bindings appearing in user queries and query-access-rule dependency are lacking for deductive database systems. In this paper, we propose a hybrid fragmentation approach for distributed deductive database systems. Our approach first considers the horizontal partition of base relations according to the bindings imposed on user queries, and then generates vertical fragments of the horizontally partitioned relations and clusters rules using affinity of attributes and access frequency of queries and rules. The proposed fragmentation technique facilitates the design of distributed deductive database systems.

show abstract

“…This workload is typically a set of database queries gathered from the live system, but it could also include inserts and updates. Some methods also use more particular information on the data in addition to the query set [26]. This information has to be provided by the user, and is not available in a fully automated system.…”

Section: Related Workmentioning

confidence: 99%

“…There are methods that do only fragmentation [1,24,26,33,34] and methods that do only allocation of predefined fragments [3,4,7,10,13,20,30]. Some methods also exist that integrate both tasks [9,11,17,19,25,27,29].…”

Section: Related Workmentioning

confidence: 99%

DYFRAM: dynamic fragmentation and replica management in distributed database systems

Hauglid

Ryeng

Nørvåg

2010

Distrib Parallel Databases

View full text Add to dashboard Cite

In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach.

show abstract

Fragmenting relations horizontally using a knowledge-based approach

Cited by 17 publications

References 14 publications

An Apriori-Based Vertical Fragmentation Technique for Heterogeneous Distributed Database Transactions

An Apriori-Based Vertical Fragmentation Technique for Heterogeneous Distributed Database Transactions

A Hybrid Fragmentation Approach for Distributed Deductive Database Systems

DYFRAM: dynamic fragmentation and replica management in distributed database systems

Contact Info

Product

Resources

About