Using an Ordered Key Attribute in Database Design
Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 202 |
|---|---|
| container_issue | |
| container_start_page | 193 |
| container_title | |
| container_volume | 1873 |
| creator | Ng, Wilfred |
| description | Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the conventional sound and complete axiom systems for FDs and INDs can be generalised to the cases of OFDs and OINDs. We investigate a subclass of ordered databases, called ordered object databases, which consists of a set of ordered relations having a distinguished key attribute and enables us to view tuples as linearly ordered objects. An ordered object database possesses two desirable properties concerning OFDs and OINDs, which are useful in ordered database design. First, there is no interaction between OFDs and OINDs. Second, the implication problem for a given set of OINDs, I, whose complexity is polynomial-time in the size of I. |
| doi_str_mv | 10.1007/3-540-44469-6_18 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1384711</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072487_25_210</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1828-37bc95319860b2cd03959d29678825e3cdad667c080c88b80d298596ca0a694b3</originalsourceid><addsrcrecordid>eNotkDtTwzAQhMVzMCE9pQtah5NOzzKT8Boyk4bUGllWgiE4RnKK_HvskGvuZndvi4-QewoTCqAesRAcCs65NIW0VJ-RW-yVoyDPSUYlpQUiNxdkbJQePKmG45JkgMAKozhek8ygYIYygTdknNIX9IOMcQEZoatUN5vcNfkyViGGKn8Ph3zadbEu913I6yafu86VLoV8HlK9ae7I1dptUxif9oisnp8-Zq_FYvnyNpsuipZqpgtUpTcCqdESSuYrQCNMxYxUWjMR0FeuklJ50OC1LjX0nhZGegdOGl7iiDz897YuebddR9f4Otk21j8uHixFzRWlfWzyH0u902xCtOVu950sBTswtGh7KvaIzA4M-wc89cbd7z6kzobhw4emi27rP13bhZgsgmJcK8uEZRTwDyo0a60</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072487_25_210</pqid></control><display><type>book_chapter</type><title>Using an Ordered Key Attribute in Database Design</title><source>Springer Books</source><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ng, Wilfred</creator><contributor>Ibrahim, Mohamed ; Küng, Josef ; Revell, Norman ; Revell, Norman ; Ibrahim, Mohamed ; Küng, Josef</contributor><creatorcontrib>Ng, Wilfred ; Ibrahim, Mohamed ; Küng, Josef ; Revell, Norman ; Revell, Norman ; Ibrahim, Mohamed ; Küng, Josef</creatorcontrib><description>Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the conventional sound and complete axiom systems for FDs and INDs can be generalised to the cases of OFDs and OINDs. We investigate a subclass of ordered databases, called ordered object databases, which consists of a set of ordered relations having a distinguished key attribute and enables us to view tuples as linearly ordered objects. An ordered object database possesses two desirable properties concerning OFDs and OINDs, which are useful in ordered database design. First, there is no interaction between OFDs and OINDs. Second, the implication problem for a given set of OINDs, I, whose complexity is polynomial-time in the size of I.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540679783</identifier><identifier>ISBN: 3540679782</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540444696</identifier><identifier>EISBN: 9783540444695</identifier><identifier>DOI: 10.1007/3-540-44469-6_18</identifier><identifier>OCLC: 935291253</identifier><identifier>LCCallNum: QA76.9.D35</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Axiom System ; Computer science; control theory; systems ; Database Design ; Database Schema ; Exact sciences and technology ; Inference Rule ; Information systems. Data bases ; Interaction Rule ; Memory organisation. Data processing ; Software</subject><ispartof>Database and Expert Systems Applications, 2000, Vol.1873, p.193-202</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072487-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-44469-6_18$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-44469-6_18$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1384711$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Ibrahim, Mohamed</contributor><contributor>Küng, Josef</contributor><contributor>Revell, Norman</contributor><contributor>Revell, Norman</contributor><contributor>Ibrahim, Mohamed</contributor><contributor>Küng, Josef</contributor><creatorcontrib>Ng, Wilfred</creatorcontrib><title>Using an Ordered Key Attribute in Database Design</title><title>Database and Expert Systems Applications</title><description>Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the conventional sound and complete axiom systems for FDs and INDs can be generalised to the cases of OFDs and OINDs. We investigate a subclass of ordered databases, called ordered object databases, which consists of a set of ordered relations having a distinguished key attribute and enables us to view tuples as linearly ordered objects. An ordered object database possesses two desirable properties concerning OFDs and OINDs, which are useful in ordered database design. First, there is no interaction between OFDs and OINDs. Second, the implication problem for a given set of OINDs, I, whose complexity is polynomial-time in the size of I.</description><subject>Applied sciences</subject><subject>Axiom System</subject><subject>Computer science; control theory; systems</subject><subject>Database Design</subject><subject>Database Schema</subject><subject>Exact sciences and technology</subject><subject>Inference Rule</subject><subject>Information systems. Data bases</subject><subject>Interaction Rule</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540679783</isbn><isbn>3540679782</isbn><isbn>3540444696</isbn><isbn>9783540444695</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkDtTwzAQhMVzMCE9pQtah5NOzzKT8Boyk4bUGllWgiE4RnKK_HvskGvuZndvi4-QewoTCqAesRAcCs65NIW0VJ-RW-yVoyDPSUYlpQUiNxdkbJQePKmG45JkgMAKozhek8ygYIYygTdknNIX9IOMcQEZoatUN5vcNfkyViGGKn8Ph3zadbEu913I6yafu86VLoV8HlK9ae7I1dptUxif9oisnp8-Zq_FYvnyNpsuipZqpgtUpTcCqdESSuYrQCNMxYxUWjMR0FeuklJ50OC1LjX0nhZGegdOGl7iiDz897YuebddR9f4Otk21j8uHixFzRWlfWzyH0u902xCtOVu950sBTswtGh7KvaIzA4M-wc89cbd7z6kzobhw4emi27rP13bhZgsgmJcK8uEZRTwDyo0a60</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Ng, Wilfred</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Using an Ordered Key Attribute in Database Design</title><author>Ng, Wilfred</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1828-37bc95319860b2cd03959d29678825e3cdad667c080c88b80d298596ca0a694b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied sciences</topic><topic>Axiom System</topic><topic>Computer science; control theory; systems</topic><topic>Database Design</topic><topic>Database Schema</topic><topic>Exact sciences and technology</topic><topic>Inference Rule</topic><topic>Information systems. Data bases</topic><topic>Interaction Rule</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ng, Wilfred</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ng, Wilfred</au><au>Ibrahim, Mohamed</au><au>Küng, Josef</au><au>Revell, Norman</au><au>Revell, Norman</au><au>Ibrahim, Mohamed</au><au>Küng, Josef</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Using an Ordered Key Attribute in Database Design</atitle><btitle>Database and Expert Systems Applications</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><volume>1873</volume><spage>193</spage><epage>202</epage><pages>193-202</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540679783</isbn><isbn>3540679782</isbn><eisbn>3540444696</eisbn><eisbn>9783540444695</eisbn><abstract>Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the conventional sound and complete axiom systems for FDs and INDs can be generalised to the cases of OFDs and OINDs. We investigate a subclass of ordered databases, called ordered object databases, which consists of a set of ordered relations having a distinguished key attribute and enables us to view tuples as linearly ordered objects. An ordered object database possesses two desirable properties concerning OFDs and OINDs, which are useful in ordered database design. First, there is no interaction between OFDs and OINDs. Second, the implication problem for a given set of OINDs, I, whose complexity is polynomial-time in the size of I.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-44469-6_18</doi><oclcid>935291253</oclcid><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database and Expert Systems Applications, 2000, Vol.1873, p.193-202 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1384711 |
| source | Springer Books; IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Applied sciences Axiom System Computer science control theory systems Database Design Database Schema Exact sciences and technology Inference Rule Information systems. Data bases Interaction Rule Memory organisation. Data processing Software |
| title | Using an Ordered Key Attribute in Database Design |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T07%3A01%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Using%20an%20Ordered%20Key%20Attribute%20in%20Database%20Design&rft.btitle=Database%20and%20Expert%20Systems%20Applications&rft.au=Ng,%20Wilfred&rft.date=2000&rft.volume=1873&rft.spage=193&rft.epage=202&rft.pages=193-202&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540679783&rft.isbn_list=3540679782&rft_id=info:doi/10.1007/3-540-44469-6_18&rft_dat=%3Cproquest_pasca%3EEBC3072487_25_210%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540444696&rft.eisbn_list=9783540444695&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072487_25_210&rft_id=info:pmid/&rfr_iscdi=true |