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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
S. Sarawagi and M. Stonebraker, ‘Efficient Organization of Large Multidimendional Arrays’, Proc. of International Conference on Data Engineering, 328–336,1994.
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.
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.
A.P. Marathe and K. Salem ‘A Language for Manipulating Arrays’, Proc. of 24-th International Conference on Very Large Databases, 241–249, 1997.
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.
A.L. Rosenberg, ‘Allocating Storage for Extendible Arrays’, JACM, Vol.21, 652–670, 1974.
A.L. Rosenberg and L.J. Stockmeyer, ‘Hashing Schemes for Extendible Arrays’, JACM, Vol.24, 199–221, 1977.
Niklaus Wirth, ‘Programming in Modula-2’, Springer-Verlag, 1983.
E.J. Otoo and T.H. Merrett, ‘A Storage Scheme for Extendible Arrays’, Computing, Vol.31, 1–9, 1983.
A. Novacek, ‘Using Time Stamps for Storing and Addressing Extendible Arrays’, Computing, Vol.37, 303–313, 1986.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsuji, T., Kawahara, H., Hochin, T., Higuchi, K. (2001). Sharing Extendible Arrays in a Distributed Environment. In: Böhme, T., Unger, H. (eds) Innovative Internet Computing Systems. IICS 2001. Lecture Notes in Computer Science, vol 2060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48206-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-48206-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42275-4
Online ISBN: 978-3-540-48206-2
eBook Packages: Springer Book Archive