IICS 2001: Innovative Internet Computing Systems pp 41-52 | Cite as
Sharing Extendible Arrays in a Distributed Environment
Abstract
We describe a distributed system for scientific applications based on sharable extendible arrays. In our sharing scheme, a part of or all of an extendible array placed on the server side can be shared among many clients. A sharing array can be declared local to a client, and it initially shares an arbitrary part of an extendible array on the server side. After the initial sharing, it can be extended locally on the client. The locally extended part on the client side together with the shared part on the server side can be logically handled as a single extendible array. A set of extendible arrays can be persistently stored on secondary storage. In this paper, after proposing the properties of extendible arrays and their manipulation, we propose the notion of sharing an extendible array. Then the language constructs and the runtime routines for managing extendible arrays and sharing arrays are described stressing their scope and visibility in the client/server system architecture.
Keywords
Server Side Client Side Extendible Array History Table Lock ModePreview
Unable to display preview. Download preview PDF.
References
- 1.K.E. Seamons and M. Winslett, ‘Physical Schemas for Large Multidimensional Arrays in Scientific Computing Applications’, Proc. of 7-th International Working Conference on Scientific and Statistical Database Management, 218–227, 1994.Google Scholar
- 2.S. Sarawagi and M. Stonebraker, ‘Efficient Organization of Large Multidimendional Arrays’, Proc. of International Conference on Data Engineering, 328–336,1994.Google Scholar
- 3.H. Gupta, V. Harinarayan, A. Rajaraman, and J.D. Ullman, ‘Index Selection for OLAP’, Proc. of 13-th International Conference on Data Engineering, 208–219, 1997.Google Scholar
- 4.Y. Zhao, K. Ramasamy, K. Tufte and J.L. Zhao, ‘Array-Based Evaluation of MultiDimensional Queries in Object-Relational Database Systems’, Proc. of 14-th International Conference on Data Engineering, 241–249, 1998.Google Scholar
- 5.A.P. Marathe and K. Salem ‘A Language for Manipulating Arrays’, Proc. of 24-th International Conference on Very Large Databases, 241–249, 1997.Google Scholar
- 6.N. Widmann, and P. Baumann, ‘Efficient Execution of Operations in a DBMS for Multidimensional Arrays’, Proc. of 10-th International Working Conference on Scientific and Statistical Database Management, 155–165, 1998.Google Scholar
- 7.A.L. Rosenberg, ‘Allocating Storage for Extendible Arrays’, JACM, Vol.21, 652–670, 1974.MATHCrossRefGoogle Scholar
- 8.A.L. Rosenberg and L.J. Stockmeyer, ‘Hashing Schemes for Extendible Arrays’, JACM, Vol.24, 199–221, 1977.MATHCrossRefMathSciNetGoogle Scholar
- 9.Niklaus Wirth, ‘Programming in Modula-2’, Springer-Verlag, 1983.Google Scholar
- 10.E.J. Otoo and T.H. Merrett, ‘A Storage Scheme for Extendible Arrays’, Computing, Vol.31, 1–9, 1983.MATHCrossRefGoogle Scholar
- 11.A. Novacek, ‘Using Time Stamps for Storing and Addressing Extendible Arrays’, Computing, Vol.37, 303–313, 1986.MATHCrossRefMathSciNetGoogle Scholar
- 12.T. Tsuji, M. Iguchi, and K. Watanabe, ‘An Implementation Scheme of Extendible Arrays and Its Application to Pascal Language’, Transactions of Information Processing Society of Japan, Vol.37, 843–853, 1988.Google Scholar