ACM Home Page
Please provide us with feedback. Feedback
Fragments of relations
Full text PdfPdf (1.05 MB)
Source International Conference on Management of Data archive
Proceedings of the 1983 ACM SIGMOD international conference on Management of data table of contents
San Jose, California
SESSION: Distributed system I table of contents
Pages: 15 - 22  
Year of Publication: 1983
ISBN:0-89791-104-0
Also published in ...
Authors
David Maier  Oregon Graduate Center
Jeffrey D. Ullman  Stanford University
Sponsors
: ACM SIGBDP
: IEEE TC on Design Automation
: IEEE TC on Database Engineering
: IEEE TC on VLSI
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 8
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/582192.582200
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
{CP} S. Ceri and G. Pelagatti. "Correctness of execution strategies of read-only transactions in distributed databases." Instituto di Elettrotecnica ed Elettronica Politecnico di Milano internal report 80-16.
 
3
{DB} U. Dayal and P. A. Bernstein, "The fragmentation problem: Lossless decomposition of relations into files." Computer Corporation of America TR CCA-78-13, November 1978.
4
 
5
{P} J. Paredaens. "Horizontal and vertical decompositions." Presented at XP1 Workshop on Relational Database Theory, Stony Brook, N.Y., June--July 1980.
6
 
7
{RG} J. B. Rothnie and N. Goodman. "An overview of the preliminary design of SDD-1: A system for distributed databases." Proc. 1977 Berkeley Workshop on Distributed Data Management and Computer Networks, May 1977, pages 39--57.

CITED BY  8
Collaborative Colleagues:
David Maier: colleagues
Jeffrey D. Ullman: colleagues