Abstract
LH* lh is a new data structure for scalable high-performance hash files on the increasingly popular switched multicomputers, i.e., MIMD multiprocessor machines with distributed RAM memory and without shared memory. An LH* lh file scales up gracefully over available processors and the distributed memory, easily reaching Gbytes. Address calculus does not require any centralized component that could lead to a hot-spot. Access times to the file can be under a millisecond and the file can be used in parallel by several client processors. We show the LH* lh design, and report on the performance analysis. This includes experiments on the Parsytec GC/PowerPlus multicomputer with up to 128 Power PCs divided into 64 nodes with 32 MB of RAM per node. We prove the efficiency of the method and justify various algorithmic choices that were made. LHI* lh opens a new perspective for high-performance applications, especially for the database management of new types of data and in real-time environments.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Teradata Corporation. DBC/1012 data base computer concepts and facilities. Technical Report Teradata Document C02-001-05, Teradata Corporation, 1988.
D. Culler. NOW: Towards Everyday Supercomputing on a Network of Workstations. Technical report, EECS Tech. Rep. UC Berkeley, 1994.
R. Devine. Design and implementation of DDH: A distributed dynamic hashing algorithm. In Proc. of the 4th Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), 1993.
D. DeWitt, R. Gerber, G. Graefe, M. Heytens, K. Kumar, and M. Muralikrishna. GAMMA: A high performance dataflow database machine. In Proc of VLDB, August 1986.
G. Fahl, T. Risch, and M. Sköld. AMOS — An Architecture for Active Mediators. In IEEE Transactions on Knowledge and Data Engineering, Haifa, Israel, June 1993.
J. S. Karlsson. LH*lh: Architecture and Implementation. Technical report, IDA, Linkping University, Sweden, 1995.
J. S. Karlsson, S. Larsson, T. Risch, M. Sköld, and M. Werner. AMOS User's Guide. CAELAB, IDA, IDA, Dept. of Computer Science and Information Science, Linköping University, Sweden, memo 94-01 edition, Mars 1994. URL: http://www.ida.liu.se/labs/edslab/amos/amosdoc.html
M. Kitsuregawa, H. Tanaka, and T. Moto-Oka. Architecture and performance of relational algebra machine GRACE. In Proc. of the Intl. Conf. on Parallel Processing, Chicago, 1984.
B. Kroll and P. Widmayer. Distributing a Search Tree Among a Growing Number of Processors. In ACM-SIGMOD Int. Conf. On Management of Data, 1994.
P.A. Larson. Dynamic hashing. BIT, 18(2):184–201, 1978.
P.A. Larson. Dynamic hash tables. In Communications of the A CM, volume 31(4), pages 446–57. April 1988.
W. Litwin. Linear Hashing: A new tool for file and table addressing. Montreal, Canada, 1980. Proc. of VLDB.
W. Litwin. Linear Hashing: A new tool for file and table addressing. In Michael Stonebraker, editor, Readings in DATABASE SYSTEMS, 2nd edition, pages 96–107. 1994.
W. Litwin, M-A. Neimat, and D. Schneider. LH*: A Scalable Distributed Data Structure, submitted for journal publication, Nov 1993.
W. Litwin, M-A Neimat, and D. Schneider. LH*: Linear hashing for distributed files. ACM SIGMOD International Conference on Management of Data, May 1993.
W. Litwin, M-A Neimat, and D. Schneider. RP*: A Family of Order Preserving Scalable Distributed Data Structures. VLDB Conference, 1994.
M. Tamer Özsu and Patrick Valduriez. Principles of Distributed Database Systems. Number ISBN 0-13-715681-2. Prentice Hall, 1991.
Parsytec Computer GmbH. Programmers Guide, Parix 1.2-PowerPC., 1994.
M. Pettersson. Main-Memory Linear Hashing — Some Enhancements of Larson's Algorithm. Technical Report LiTH-IDA-R-93-04, ISSN-0281-4250, IDA, 1993.
C. Severance, S. Pramanik, and P. Wolberg. Distributed linear hashing and parallel projection in main memory databases. In Proceedings of the 16th International Conference on VLDB, Brisbane, Australia, 1990.
Andrew S. Tanenbaum. Distributed Operating Systems. 1995.
R. Wingralek, Y. Breitbart, and G. Weikum. Distributed file organisation with scalable cost/performance. In Proc of ACM-SIGMOD, May 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karlsson, J.S., Litwin, W., Risch, T. (1996). LH*lh: A scalable high performance data structure for switched multicomputers. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014179
Download citation
DOI: https://doi.org/10.1007/BFb0014179
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61057-1
Online ISBN: 978-3-540-49943-5
eBook Packages: Springer Book Archive