• DocumentCode
    1502843
  • Title

    On the multiple-query optimization problem

  • Author

    Sellis, Timos ; Ghosh, Subrata

  • Author_Institution
    Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
  • Volume
    2
  • Issue
    2
  • fYear
    1990
  • fDate
    6/1/1990 12:00:00 AM
  • Firstpage
    262
  • Lastpage
    266
  • Abstract
    The complexity of the multiple-query optimization problem in database management systems is examined. It is shown that the problem is NP-hard. Then the authors examine the performance of a heuristic algorithm to solve the multiple-query optimization problem and suggest some heuristics for query ordering which improve the efficiency of the algorithm considerably. Some experimental results on the performance of various heuristics are also presented
  • Keywords
    computability; computational complexity; database management systems; database theory; heuristic programming; 3SAT; NP-hard; algorithm complexity; database management systems; deductive databases; efficiency; heuristic algorithm; multiple-query optimization; query ordering; Costs; Database systems; Deductive databases; Heuristic algorithms; Inference algorithms; Merging; NP-hard problem; Proposals; Query processing; Relational databases;
  • fLanguage
    English
  • Journal_Title
    Knowledge and Data Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1041-4347
  • Type

    jour

  • DOI
    10.1109/69.54724
  • Filename
    54724
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1502843