Determining the Currency of Data

被引:49
作者
Fan, Wenfei [1 ,2 ]
Geerts, Floris [3 ]
Wijsen, Jef [4 ]
机构
[1] Univ Edinburgh, Lab Fdn Comp Sci, Sch Informat, Edinburgh EH8 9AB, Midlothian, Scotland
[2] Harbin Inst Technol, Harbin, Peoples R China
[3] Univ Antwerp, Dept Math & Comp Sci, B-2020 Antwerp, Belgium
[4] Univ Mons, Inst Informat, Serv Syst Informat, B-7000 Mons, Belgium
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2012年 / 37卷 / 04期
基金
英国工程与自然科学研究理事会;
关键词
Languages; Theory; Design; Currency; data quality; COMPLEXITY;
D O I
10.1145/2389241.2389244
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data in real-life databases become obsolete rapidly. One often finds that multiple values of the same entity reside in a database. While all of these values were once correct, most of them may have become stale and inaccurate. Worse still, the values often do not carry reliable timestamps. With this comes the need for studying data currency, to identify the current value of an entity in a database and to answer queries with the current values, in the absence of reliable timestamps. This article investigates the currency of data. (1) We propose a model that specifies partial currency orders in terms of simple constraints. The model also allows us to express what values are copied from other data sources, bearing currency orders in those sources, in terms of copy functions defined on correlated attributes. (2) We study fundamental problems for data currency, to determine whether a specification is consistent, whether a value is more current than another, and whether a query answer is certain no matter how partial currency orders are completed. (3) Moreover, we identify several problems associated with copy functions, to decide whether a copy function imports sufficient current data to answer a query, whether a copy function can be extended to import necessary current data for a query while respecting the constraints, and whether it suffices to copy data of a bounded size. (4) We establish upper and lower bounds of these problems, all matching, for combined complexity and data complexity, and for a variety of query languages. We also identify special cases that warrant lower complexity.
引用
收藏
页数:46
相关论文
共 38 条
[1]  
Abiteboul S., 1995, Foundations of databases, V8
[2]  
[Anonymous], P 4 BIENN C INN DAT
[3]  
[Anonymous], 2002, APPL DEV TRENDS
[4]  
[Anonymous], 1991, Problem of Incomplete Information in Relational Databases
[5]  
[Anonymous], ENCY DATABASE SYSTEM
[6]  
[Anonymous], LOGICAL METHODS COMP
[7]  
[Anonymous], 2011, P 30 ACM SIGMOD SIGA, DOI DOI 10.1145/1989284.1989295
[8]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[9]  
[Anonymous], DM REV
[10]  
[Anonymous], ACM T DATAB SYST