Abstract
In this paper we define a strategy for processing a given class of relational queries. The strategy is based on: (i) the presence of inverted files; (ii) the representation of temporary relations, obtained during the execution of a query, as sets of pointers to tuples; (iii) the execution of the relational operators involved in the query by means of operations, namely intersections, unions and Cartesian products, on these sets of pointers. In this way actual tuples are kept in the main memory only when the resulting relation is produced. A storage structure for the access keys in indices, too, is used; it allows us to maintain a join index, i.e. an index which permits to compute a join without operating on tuples coming from the two operand relations in it. The join index we propose can be used also when computing selections; we will show how it permits to perform operations on sets of pointers efficiently.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bitton D., Boral H., DeWitt D.J, Wilkinson W.K.: “Parallel Algorithms for the Execution of Relational Database Operations” ACM TODS, 1983, vol. 8, n. 3, pp. 324–353
Bratbergsengen K.: “Hashing Methods and Relational Algebra Operations” VLDB84, Singapore, 1984, pp. 323–333
Cardenas A.F.: “Analysis and Performance of Inverted Data Base Structures” Comm. of ACM, 1975, vol. 18, pp. 253–263
Copeland G.P., Koshafian S.: “A Decomposition Storage Model” ACM SIGMOD, Austin (Texas), 1985, pp. 268–279.
Dayal U.: “Processing Queries over Generalization Hierarchies in a Multidatabases System” VLDB83, Florence, 1983, pp. 342–353
Gotlieb L.R.: “Computing Joins of Relations” ACM SIGMOD, 1975, pp. 55–63
Grazzini E., Pinzani R., Pippolini F.: “A Physical Structure for Efficient Processing of Relational Queries” Foundations of Data Organization, Plenum Press, N.Y., 1987, pp. 501–514
Haerder T.: “Implementing a Generalized Access Path Structure for a Relational Database” ACM TODS, vol. 3, n.3, 1978, pp. 285–298
Jarke M., Schmidt J.: “Query Processing Strategies in the Pascal/R Relational Database Management System” ACM SIGMOD, Orlando (Florida), 1982
Krishnamurthy R., Morgan S.T.: “Query Processing on Personal Computers: A Pragmatic Approach” VLDB84, Singapore, 1984, pp. 26–29
Palermo F.P.: “A Database Search Problem” Information Systems COINS IV, Plenum Press, N.Y., 1974
Reiner D., Rosenthal A.: “Extending the Algebraic Framework of Query Processing to Handle Outerjoins” VLDB84, Singapore, 1984, pp. 334–343
Tsichritzis D.: “LSL: a Link and Selector Language” ACM SIGMOD, Washington (D.C.), 1976, pp. 123–133
Valduriez P., Boral H.: “Evaluation of Recursive Queries Using Join Indices” 1st Int. Conf. on Expert Database Systems, Charleston, 1986, pp. 197–208
Valduriez P.: “Join indices” ACM TODS, vol. 12, n. 2, 1987, pp. 218–246
Wedekind M.: “On the Selection of Access Paths in a Data Base System” Data Base Management, North-Holland Pub. Co., Amsterdam, 1974
Wong E., Youssefi K.: “Decomposition — A Strategy for Query Processing” ACM TODS, vol. 1 n. 3, 1976, pp. 223–241
Yao B.: “Optimization of Query Evaluation Algorithms” ACM TODS, vol. 4 n. 2, 1979, pp. 133–155
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grazzini, E., Pippolini, F. (1989). A strategy for executing complex queries. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive