政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69126
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51725761      Online Users : 555
RC Version 6.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: https://nccur.lib.nccu.edu.tw/handle/140.119/69126


    Title: Manipulation of exclusive disjunctive data in relational databases
    Authors: 陳良弼
    Chiu,Jui-Shang;Chen,Arbee L.P.
    Contributors: 資科系
    Keywords: Incomplete information;Disjunctive information;Partial values;Query language semantics;Relational algebra;Relational databases
    Date: 1997
    Issue Date: 2014-08-21 14:47:37 (UTC+8)
    Abstract: In this paper, we propose an extended relational model, named Pv-table, for representing exclusive disjunctive data (i.e., there exists a set of possible values for a data item, and exactly one of the possible values is true) by associating partial values and variables with attributes. While a partial value denotes the set of possible values, a variable serves as an identifier for the true value of the data item. Identifiers can be used to determine the equi-relationship among partial values. The relational operators are extended to manipulate Pv-tables. We show that the set-based query evaluation on Pv-tables is sound and complete for queries consisting of extended selection, union, intersection, Cartesian product and join. We also show that useful algebraic properties are preserved in our model. A disjunctive (resp. conjunctive) query can be replaced by the extended union (resp. intersection) of the two corresponding subqueries. These properties provide a more natural interpretation of queries. They also facilitate query decomposition process for optimizing distributed queries. These properties are not preserved for many other extended models.
    Relation: Data & Knowledge Engineering,22(1),39-65
    Data Type: article
    Appears in Collections:[Department of Computer Science ] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    39-65.pdf1623KbAdobe PDF2887View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback