{"title":"结合同时值和临时数据依赖项","authors":"A. Gal, D. Dori","doi":"10.1109/TIME.1996.555689","DOIUrl":null,"url":null,"abstract":"In temporal databases there are situations where multiple values of the same data item have overlapping validity times. In addition to the common case of multi-valued properties, there are several possible semantics to multiple values with overlapping validity times of the same data item. We refer to such data items as having simultaneous values. This paper presents a polynomial algorithm for efficient handling of simultaneous values in a database with temporal data dependencies-integrity rules that define relationships among values of different dated items in a temporal database. The algorithm is demonstrated using a case study from the game theory area. An implementation of the algorithm is integrated in a prototype of a temporal active database.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Combining simultaneous values and temporal data dependencies\",\"authors\":\"A. Gal, D. Dori\",\"doi\":\"10.1109/TIME.1996.555689\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In temporal databases there are situations where multiple values of the same data item have overlapping validity times. In addition to the common case of multi-valued properties, there are several possible semantics to multiple values with overlapping validity times of the same data item. We refer to such data items as having simultaneous values. This paper presents a polynomial algorithm for efficient handling of simultaneous values in a database with temporal data dependencies-integrity rules that define relationships among values of different dated items in a temporal database. The algorithm is demonstrated using a case study from the game theory area. An implementation of the algorithm is integrated in a prototype of a temporal active database.\",\"PeriodicalId\":259291,\"journal\":{\"name\":\"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.1996.555689\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.1996.555689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combining simultaneous values and temporal data dependencies
In temporal databases there are situations where multiple values of the same data item have overlapping validity times. In addition to the common case of multi-valued properties, there are several possible semantics to multiple values with overlapping validity times of the same data item. We refer to such data items as having simultaneous values. This paper presents a polynomial algorithm for efficient handling of simultaneous values in a database with temporal data dependencies-integrity rules that define relationships among values of different dated items in a temporal database. The algorithm is demonstrated using a case study from the game theory area. An implementation of the algorithm is integrated in a prototype of a temporal active database.