메뉴 건너뛰기




Volumn 6, Issue 3, 1997, Pages 191-208

Heuristic and randomized optimization for the join ordering problem

Author keywords

Genetic algorithms; Heuristic algorithms; Join ordering; Query optimization; Randomized algorithms

Indexed keywords


EID: 0001443955     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780050040     Document Type: Article
Times cited : (295)

References (25)
  • 5
    • 0021497828 scopus 로고
    • Optimal nesting for computing N-relational joins
    • Ibaraki T, Kameda T (1984) Optimal nesting for computing N-relational joins. ACM Trans Database Syst 9:482-502
    • (1984) ACM Trans Database Syst , vol.9 , pp. 482-502
    • Ibaraki, T.1    Kameda, T.2
  • 6
    • 0025449072 scopus 로고
    • Randomized algorithms for optimizing large join queries
    • Atlantic City, NJ, April
    • Ioannidis YE, Kang YC (1990) Randomized algorithms for optimizing large join queries. In: Proc ACM SIGMOD Conf Management of Data, Atlantic City, NJ, April, pp 312-321
    • (1990) Proc ACM SIGMOD Conf Management of Data , pp. 312-321
    • Ioannidis, Y.E.1    Kang, Y.C.2
  • 7
    • 84976665903 scopus 로고
    • Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization
    • Denver, Colo, May
    • Ioannidis YE, Kang YC (1991) Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization. In: Proc ACM SIGMOD Conf Management of Data, Denver, Colo, May, pp 168-177
    • (1991) Proc ACM SIGMOD Conf Management of Data , pp. 168-177
    • Ioannidis, Y.E.1    Kang, Y.C.2
  • 10
    • 0000002490 scopus 로고
    • Access support relations: An indexing method for object bases
    • Kemper A, Moerkotte G (1992) Access support relations: an indexing method for object bases. Inf Syst 17:117-146
    • (1992) Inf Syst , vol.17 , pp. 117-146
    • Kemper, A.1    Moerkotte, G.2
  • 12
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the travelling salesman problem
    • Kruskal JB (1956) On the shortest spanning subtree of a graph and the travelling salesman problem. Proc Am Math Soc 7:48-50
    • (1956) Proc Am Math Soc , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 13
    • 77951587888 scopus 로고
    • Sequencing jobs to minimize total weighted completion time subject to precedence constraits
    • Lawler E (1978) Sequencing jobs to minimize total weighted completion time subject to precedence constraits. Ann Discrete Math 2:75-90
    • (1978) Ann Discrete Math , vol.2 , pp. 75-90
    • Lawler, E.1
  • 14
    • 0008715889 scopus 로고
    • On the effectiveness of optimization search strategies for parallel execution spaces
    • Dublin, Ireland
    • Lanzelotte R, Valduriez P, Zaït M (1993) On the effectiveness of optimization search strategies for parallel execution spaces. In: Proc Conf Very Large Data Bases (VLDB), Dublin, Ireland, pp 493-504
    • (1993) Proc Conf Very Large Data Bases (VLDB) , pp. 493-504
    • Lanzelotte, R.1    Valduriez, P.2    Zaït, M.3
  • 15
    • 0026826969 scopus 로고
    • Join processing in relational databases
    • Mishra P, Eich MH (1992) Join processing in relational databases. ACM Comput Surv 24:63-113
    • (1992) ACM Comput Surv , vol.24 , pp. 63-113
    • Mishra, P.1    Eich, M.H.2
  • 16
    • 0018501967 scopus 로고
    • Sequencing with series-parallel precedence constraints
    • Monma C, Sidney J (1979) Sequencing with series-parallel precedence constraints. Math Oper Res 4:215-224
    • (1979) Math Oper Res , vol.4 , pp. 215-224
    • Monma, C.1    Sidney, J.2
  • 17
    • 0002704090 scopus 로고
    • Measuring the complexity of join enumeration in query optimization
    • Brisbane, Australia
    • Ono K, Lohman GM (1990) Measuring the complexity of join enumeration in query optimization. In: Proc Conf Very Large Data Base (VLDB), Brisbane, Australia, pp 314-325
    • (1990) Proc Conf Very Large Data Base (VLDB) , pp. 314-325
    • Ono, K.1    Lohman, G.M.2
  • 20
    • 84976660052 scopus 로고
    • Join processing in database systems with large main memories
    • Shapiro LD (1986l Join processing in database systems with large main memories. ACM Trans Database Syst 11:239-264
    • (1986) ACM Trans Database Syst , vol.11 , pp. 239-264
    • Shapiro, L.D.1
  • 21
    • 0027228912 scopus 로고
    • A polynomial time algorithm for optimizing join queries
    • Vienna, Austria, April
    • Swami A, Iyer B (1993) A polynomial time algorithm for optimizing join queries. In: Proc IEEE Conf Data Eng, Vienna, Austria, April, pp 345-354
    • (1993) Proc IEEE Conf Data Eng , pp. 345-354
    • Swami, A.1    Iyer, B.2
  • 22
    • 84976745529 scopus 로고
    • Optimization of large join queries: Combining heuristics and combinatorial techniques
    • Portland, Ore, May
    • Swami A (1989) Optimization of large join queries: combining heuristics and combinatorial techniques. In: Proc ACM SIGMOD Conf Management of Data, Portland, Ore, May, pp 367-376
    • (1989) Proc ACM SIGMOD Conf Management of Data , pp. 367-376
    • Swami, A.1
  • 23
    • 0030156988 scopus 로고    scopus 로고
    • Rapid bushy join-order optimization with cartesian product
    • Montreal, June
    • Vance B, Maier D (1996) Rapid bushy join-order optimization with cartesian product. In: Proc ACM SIGMOD Conf Management of Data, Montreal, June, pp 35-46
    • (1996) Proc ACM SIGMOD Conf Management of Data , pp. 35-46
    • Vance, B.1    Maier, D.2
  • 24
    • 84976812728 scopus 로고
    • Decomposition - A strategy for query processing
    • Wong E, Youssefi K (1976) Decomposition - a strategy for query processing. ACM Trans Database Syst 1:223-241
    • (1976) ACM Trans Database Syst , vol.1 , pp. 223-241
    • Wong, E.1    Youssefi, K.2
  • 25
    • 0018807846 scopus 로고
    • Query processing in a relational database management system
    • Rio de Janeiro, Brazil
    • Youssefi K, Wong E (1979) Query processing in a relational database management system. In: Proc Conf Very Large Data Bases (VLDB), Rio de Janeiro, Brazil, pp 409-417
    • (1979) Proc Conf Very Large Data Bases (VLDB) , pp. 409-417
    • Youssefi, K.1    Wong, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.