• DocumentCode
    1502803
  • Title

    Dynamic programming in Datalog with aggregates

  • Author

    Greco, Sergio

  • Author_Institution
    Dipt. di Elettronica Inf. e Sistemistica, Calabria Univ., Italy
  • Volume
    11
  • Issue
    2
  • fYear
    1999
  • Firstpage
    265
  • Lastpage
    283
  • Abstract
    Dynamic programming is a general technique for solving optimization problems. It is based on the division of problems into simpler subproblems that can be computed separately. In this paper, we show that Datalog with aggregates and other nonmonotonic constructs can express classical dynamic programming optimization problems in a natural fashion, and then we discuss the important classes of queries and applications that benefit from these techniques
  • Keywords
    DATALOG; database theory; deductive databases; dynamic programming; mathematics computing; nonmonotonic reasoning; query processing; Datalog; aggregates; deductive databases; dynamic programming; nonmonotonic reasoning; optimization problems; problem decomposition; queries; separately computable subproblems; Aggregates; Computer Society; Constraint optimization; Deductive databases; Dynamic programming; Linear programming; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Knowledge and Data Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1041-4347
  • Type

    jour

  • DOI
    10.1109/69.761663
  • Filename
    761663
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1502803