arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.06526cs.DB
收藏

时态数据交换

Temporal Data Exchange

Ladan Golshanara, Jan Chomicki

摘要:

数据交换是将在源模式下结构化的数据转换为在另一模式下结构化的数据的问题,该模式称为目标模式,使得源数据和目标数据都满足模式之间的关系。尽管关系数据库系统的数据交换的正式框架是建立良好的,它并不立即结转到时态数据的设置,这需要在无限的时间段推理。在这项工作中,我们研究了时态数据的数据交换。我们首先激励需要两个视图的时态数据:具体的视图,它描绘了时态数据是如何compatible表示和实现的基础上,和抽象的视图,它定义的语义的时态数据作为一个序列的快照。我们首先扩展了追逐过程的抽象视图有一个概念基础的时态数据库的数据交换。考虑到非时态的源到目标元组生成依赖和等式生成依赖,追逐算法可以独立地应用于每个快照。然后,我们定义了一个追逐过程(称为c-chase)的具体实例和显示的结果c-chase的具体实例是语义对齐的结果追逐相应的抽象实例。为了在检查具体数据库是否满足依赖项或查询时将间隔解释为常量,我们将相对于依赖项或查询规范化实例。为了获得语义对齐,具体视图中的空值被标注有时间信息。此外,我们表明,具体追逐的结果提供了一个基础,查询回答。我们定义了c-chase结果的朴素评价,并证明了它会产生某些答案。

英文摘要:

Data exchange is the problem of transforming data that is structured under a source schema into data structured under another schema, called the target schema, so that both the source and target data satisfy the relationship between the schemas. Even though the formal framework of data exchange for relational database systems is well-established, it does not immediately carry over to the settings of temporal data, which necessitates reasoning over unbounded periods of time. In this work, we study data exchange for temporal data. We first motivate the need for two views of temporal data: the concrete view, which depicts how temporal data is compactly represented and on which the implementations are based, and the abstract view, which defines the semantics of temporal data as a sequence of snapshots. We first extend the chase procedure for the abstract view to have a conceptual basis for the data exchange for temporal databases. Considering non-temporal source-to-target tuple generating dependencies and equality generating dependencies, the chase algorithm can be applied on each snapshot independently. Then we define a chase procedure (called c-chase) on concrete instances and show the result of c-chase on a concrete instance is semantically aligned with the result of chase on the corresponding abstract instance. In order to interpret intervals as constants while checking if a dependency or a query is satisfied by a concrete database, we will normalize the instance with respect to the dependency or the query. To obtain the semantic alignment, the nulls in the concrete view are annotated with temporal information. Furthermore, we show that the result of the concrete chase provides a foundation for query answering. We define naive evaluation on the result of the c-chase and show it produces certain answers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑