SIGN IN
SIGN UP
The complexity of operations on a fragmented relation
Full Text:
Pdf
Buy this Article
Authors:
C. Meghini
C. Thanos
Published in:
· Journal
ACM Transactions on Database Systems (TODS)
TODS Homepage
archive
Volume 16 Issue 1, March 1991
Pages 56 - 87
ACM
New York, NY
, USA
table of contents
doi>
10.1145/103140.103143
1991 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 17
· Downloads (cumulative): 398
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
completeness of fragmentation schemas
design
distributed databases
np-hardness
performance
query optimization
query processing
relation fragmentation
schema and subschema
theory
updates
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder