Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Solving implication problems in database applications
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Updating derived relations: detecting irrelevant and autonomously computable updates
ACM Transactions on Database Systems (TODS)
Processing Implication on Queries
IEEE Transactions on Software Engineering
The complexity of operations on a fragmented relation
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
An approach to detecting relevant updates to cached data using XML and active databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Lossless horizontal decomposition with domain constraints on interpreted attributes
BNCOD'13 Proceedings of the 29th British National conference on Big Data
| Hi-index | 0.00 |
We develop a theory of relations that are constructed by the union and selection operations from fragment relations. Algorithms for inserting and deleting from relations that are composed of physical fragments are discussed, and we show when such insertions and deletions are meaningful. We also show how to find an access set for a relation, that is, a set of fragments sufficient to produce the relation, and we apply the test to the question of how the fragmentation of relations interacts with a query on the relation, showing that a selection on the relation can be implemented by retrieving a set of physical fragments that forms an access set for another particular relation.