A hybrid fragmentation approach for distributed deductive database systems
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, object-oriented 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.
- The fragmentation of distributed databases
- Vertical fragmentation security study in distributed deductive databases
- Dynamical Processing Technique for Data Fragmentation in Distributed Database Systems: Design and Tool Support
- On fragmentation approaches for distributed database design
- scientific article; zbMATH DE number 5794173 (Why is no real title available?)
- Querying fragmented relations in a distributed database
This page was built for publication: A hybrid fragmentation approach for distributed deductive database systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606562)