J.M. Smith and P.Y.T. Chang, "Optimizing the Performance of a Relational Algebra Database Interface," Communications of the ACM, Vol. 18(10), pp. 568-579, (1975). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Toward Practical Query Evaluation for Constraint Databases - Brodsky, Jaffar, Maher (1997) (3 citations) (Correct)
....oriented DBMS, operation research packages, constraint logic programming (CLP) systems etc. Traditionally, there have been two major approaches to query optimization. One is based on compile time algebraic simplification of a query using heuristics as in (Hall, 1976, Minker, 1978, Pecherer, 1975, Smith and Chang, 1975, Palermo, 1974, Wong and Youssefi, 1976, Chakravarthy and Minker, 1986, Yannakakis, 1981, Bernstein and Goodman, 1981) The other is based on cost estimation of different strategies as in (Astrahan et al. 1976, Griffiths et al. 1979, Chamberlin et al. 1981, Daniels et al. 1982, Mackert and ....
Smith, J.M. & Chang, P.Y. (1975). Optimizing the Performance of a Relational Algebra Database Interface. Communications of the ACM 18, 10, 568--579, 1975.
An Efficient Bill-Of-Materials Algorithm - Ahmad Khalaila (Correct)
....the transitive closure is not necessary for the evaluation of such computations. Since such an evaluation often incurs a very high cost in terms of time and space, we would like to avoid it. This is very similar to avoiding the evaluation of the cross product when join is being evaluated [SmCh75, Ullm88b]. Moreover, in pipelined processing system one tends to avoid processing algorithms and strategies that produces data very late. That is due to the tremendous amount if waiting such algorithms impose on the operators that consume their output. Many efficient transitive closure algorithms have been ....
....should be. In [KhEB96] we proposed closure based BOM algorithms that avoid generating the transitive closure of the argument relation. This results in better performance, both in terms of time and space. Combining the execution of many operations into one has been first proposed by Smith et al. [SmCh75], and since then has been adopted by nearly everyone working with query processing and optimization [JaKo84, Ullm88b] The combined join (CJOIN) algorithm is the core of our BOM algorithms since it combines the accumulation of (intermediate partial) cost for composite parts using the cost of their ....
Smith, J.M., Chang, P.Y., "Optimizing the Performance of a Relational Algebra Database Interface" CACM 18(10), October 1975.
Efficient Bill-Of-Materials Algorithms - Khalaila, Eliassen, Beeri (Correct)
....the transitive closure is not necessary for the evaluation of such computations. Since such an evaluation often incurs a very high cost in terms of time and space, we would like to avoid it. This is very similar to avoiding the evaluation of the cross product when join is being evaluated [SmCh75, Ullm88b]. Many efficient algorithms have been developed for different computing environments [Tarj81, AgJa87, Lu87, BiSt88, IaRa88, AgJa88, VaKh88a, VaKh88b, AgDJ90, ChDe90, HoAC90, Jian90, Jako91, DaJa92] In this paper we propose closure based (BOM) algorithms that avoid constructing the transitive ....
....space. Traditionally, the optimizer in a query processing system starts by algebraic manipulations that optimize the query tree. Then methods implementing the various operations in the query tree are chosen using 3 cost estimation and the current access paths existing in the physical database [SmCh75, SACLP79]. Combining the execution of many operations into one has been first proposed by Smith et al. SmCh75] and since then has been adopted by nearly everyone working with query processing and optimization [JaKo84, Ullm88b] The combined join (CJOIN ) algorithm is the core of our BOM algorithms since ....
[Article contains additional citation context not shown here]
Smith, J.M., Chang, P.Y., "Optimizing the Performance of a Relational Algebra Database Interface" CACM 18(10), October 1975.
An Overview of TQuel - Snodgrass (1993) (10 citations) (Correct)
.... queries has been studied extensively and heuristic algorithms have been proposed for selection of a near optimal query plan based on a statistical description of the database and a cost model for query plan execution [Hall 1976, Jarke Koch 1984, Krishnamurthy et al. 1986, Selinger et al. 1979, Smith Chang 1975, Stonebraker et al. 1976, Wong Youssefi 1976, Yao 1979] One important aspect of local query optimization is the transformation of one query plan into an equivalent, but more efficient, query plan. The size of the search space of equivalent query plans for a snapshot query is determined in part ....
Smith, J.M. and P.Y-T. Chang. Optimizing the Performance of a Relational Algebra Database Interface. Communications of the Association of Computing Machinery, 18, No. 10, Oct. 1975, pp. 568--579.
The EXODUS Optimizer Generator - Goetz Graefe David (1987) (100 citations) (Correct)
No context found.
J.M. Smith and P.Y.T. Chang, "Optimizing the Performance of a Relational Algebra Database Interface," Communications of the ACM, Vol. 18(10), pp. 568-579, (1975).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC