Abstract
In a distributed database system, it is advantageous to fragment a relation and store the fragments at various sites. In this paper, the fragmentation problem of recursive relations is studied. A distributed database model is established for studying the general fragmentation issues. Based on the concept of partial order sets, we have proposed two approaches for fragmenting recursive relations. The first approach uses the union of lattices to represent a fragment. The second approach defines a fragment by using a maximal node and the recursive part of the relation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ceri, S., Negri, M., Pelagatti, G., “Horizontal partitioning in database design”, in Proc. ACM S/GMOD Intl. Conf. on Management of Data, 1982.
Mukkamala, R., Bruell, S.C., Shultz, R.K., “A heuristic algorithm for determining a nearoptimal set of nodes to access in a partially replicated distributed database system”, in Proc. 4th Intl Conf. on Data Engineering, February 1988.
Pramanik, S., Kao, D. T., Vineyard D., “Fragmentation of recursive relations in distributed databases”, Technical Report, Department of Computer Science, Michigan State University, August 1991.
Schnorr, C., “An Algorithm for transitive closure with linear expected time”, SIAM J. Compute., vol 7, no. 2, May 1978.
Valduriez, P., Boral, H., “Evaluation of recursive queries using join indices”, in Proc. 1st Intl. Conf. on Expert Database Systems, pp. 197–208, 1986.
Vineyard, D. R., “Query optimization in distributed databases by predicate analysis and semijoin techniques”, Ph.D. Dissertation, Department of Computer Science, Michigan State University, East Lansing, Michigan, 1989.
Yu, C.T., Chang, C.C., Templeton, M., Brill, D., Lund, E., “FREDS — a query processing algorithm for fragmented relational distributed systems”, technical report, Dept. of Electrical Engineering and Computer Science, University of Illinois at Chicago, Chicago, Illinois 60680.
Yu, C.T., Lam, K. Chang, C.C., Chang, S.K., “Promising approach to distributed query processing”, in Proc. of 6th Berkeley Workshop on Distributed Data Management and Computer Networks, February 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pramanik, S., Kao, D.T., Vineyard, D. (1992). Fragmentation of recursive relations in distributed databases. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032444
Download citation
DOI: https://doi.org/10.1007/BFb0032444
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive