English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23144873      Online Users : 436
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29237

    Authors: HORNG,JT;LIU,BJ
    Contributors: 資訊工程研究所
    Date: 1994
    Issue Date: 2010-06-29 20:17:11 (UTC+8)
    Publisher: 中央大學
    Abstract: Graph matching, set covering and partitioning problems are both theoretically and practically important in decision support systems. Numerous situations have been modeled as graph matching, set covering and partitioning problems. These situations include applications in the areas of task assignment, marriage problem, airline crew scheduling, truck deliveries or vehicle routing, political redistricting, etc. Relational database systems currently support these applications merely by providing some programming languages which are used to write the programs associated with the data. These programming languages are complete as opposed to existing query languages like SQL. These languages, since they are complete, have the usual complexity of a powerful language and lack the simplicity of query languages. This increases application development effort. Relational operators and the query language SQL are extended in this present work in order to enable these problems to be stated and solved directly by the relational database systems leading to benefits of improved data independence, increased productivity, and better performance. The relational operators are extended with six operators, i.e., match, maxmatch, cover, mincover, partition, and minipartition. Properties of these operators are described. Some of these operators may possibly take a very long time in finding a solution. Genetic algorithms are proposed. These algorithms are bounded by a polynomial time. These algorithms therefore enable DBMS to be capable of responding to queries involving proposed operators in a given time constraint. The database operations and query languages extended in this research provide a powerful tool for users as a database-query tool which supports some decision support systems for information retrieval from a database.
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明