The Kendall Square Query Decomposer

Authors:
David S. Reiner
Affiliations:
-
Venue:
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Year:
1993

Citing 0
Cited 3

Parallel database processing on the KSR1 computer

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Optimization of Parallel Execution for Multi-Join Queries

IEEE Transactions on Knowledge and Data Engineering
A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Kendall Square Query Decomposer works in conjunction with the underlying ORACLE7 relational database management system to greatly speed the execution of decision support queries. Based on the data access strategy selected for a query by the ORACLE query optimizer, the Query Decomposer generates a number of subqueries to match the underlying physical data partitions of a table on disk. These subqueries are submitted in parallel to ORACLE over multiple connections. The subqueries are executed in parallel, each accessing only its own part of the driving table. Finally, the Query Decomposer assembles subquery results and returns the full result.