Implementing set-theoretic relational-query functions using highly parallel index-processing hardware
Pages 283 - 291
Abstract
Hardware organizations for processing set-theoretic database query functions are presented. These organizations implement the functions by processing index trees. One advantage of this approach is that the index trees can be merged in a highly parallel fashion. Hardware organizations proposed here use the database machine approach, thus processing the index-trees on the fly. Experimental results giving the performances of these organizations are presented. Finally, a slight variation of the index tree representation, requiring much less storage for the index, is given.
References
[1]
Babb, E. "Implementing a Relational Database by Means of Specialized Hardware." ACM TODS, (1979), No. 1.
[2]
Banerjee, J., D. K. Hsiao, and K. Kanna. "DBC---A Database Computer for Very Large Dtabases." IEEE Transactions on Computers, C-28 (1979), No. 6.
[3]
Blasgen, M. W., and K. P. Eswaran. "Storage and Access in Relational Databases." IBM Systems Journal, 16 (1977), No. 4.
[4]
Date, C. J. An Introduction to Database Systems (3rd ed). Reading, Mass.: Addison-Wesley, 1981.
[5]
DeWitt, D. J. "Direct---A Multiprocessor Organization for Supporting Relational Database Management Systems," IEEE Transactions on Computers, C-28 (1979), No. 6.
[6]
Hawthorn, P., and D. J. DeWitt. "Performance Evaluation of Database Machine Architectures." Proceedings of the Seventh International Conference on Very Large Date Bases, 1981.
[7]
Kung, H. T., and D. L. Lehman. "Systolic (VLSI) Arrays for Relational Database Operations." Proceedings of the ACM-SIGMOND Conference, 1980.
[8]
Menon, M. J. and D. K. Hsiao. "Design and Analysis of a Relational Join Operation for VLSI." Proceedings of the Seventh International Conference on Very Large Data Bases, 1981.
[9]
Ozkarahan, E. A., S. A. Schuster, and K. C. Smith. "RAP---Associative Processor for Database Management." AFIPS, Proceedings of the National Computer Conference (Vol. 44), 1975.
[10]
Pramanik, S. "Implementing Relational Join by Database Filters," Technical Report, Computer Science Department, Michigan State University, 1982.
[11]
Shaw, D. "A Relational Database Machine Architecture," Proceedings of the Fifth Annual Workshop on Computer Architecture for Non-numeric Processing, Pacific Grove, California, 1980.
[12]
Song, S. W. "A Survey and Taxonomy of Database Machines," Quarterly Bulletin, IEEE Computer Society Technical Committee on Database Engineering, December 1981.
[13]
Su, Stanley Y. W., and G. Jack Lipovsky. "CASSM: A Cellular System for Very Large Databases," Proceedings of the International Conference on Very Large Databases, 1975.
[14]
Yao, S. B., and Fu Tong. "Design of a Two-Dimensional Join Processor Array. Proceedings of the Sixth Annual Workshop on Computer Architecture for Non-Numerical Processing, Hyeres, France, 1981.
- Implementing set-theoretic relational-query functions using highly parallel index-processing hardware
Recommendations
The hyperdyadic index and generalized indexing and query with PIQUE
SSDBM '15: Proceedings of the 27th International Conference on Scientific and Statistical Database ManagementMany scientists rely on indexing and query to identify trends and anomalies within extreme-scale scientific data. Compressed bitmap indexing (e.g., FastBit) is the go-to indexing method for many scientific datasets and query workloads. Recently, the ...
Parallel Selection Query Processing Involving Index in Parallel Database Systems
ISPAN '02: Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and NetworksIndex is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection, join) on this attribute will become more efficient by utilizing the ...
Efficient Query Processing on Relational Data-Partitioning Index Structures
SSDBM '04: Proceedings of the 16th International Conference on Scientific and Statistical Database ManagementIn contrast to space-partitioning index structures,data-partitioning index structures naturally adapt to the actualdata distribution which results in a very good query responsebehavior. Besides efficient query processing, moderndatabase applications ...
Comments
Information & Contributors
Information
Published In
May 1983
808 pages
ISBN:0882830392
DOI:10.1145/1500676
Copyright © 1983 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- AFIPS: American Federation of Information Processing Societies
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 May 1983
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 81Total Downloads
- Downloads (Last 12 months)24
- Downloads (Last 6 weeks)6
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in