Determining the currency of data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2011, Pages 71-82

  Fan, Wenfei ^a   Geerts, Floris ^a   Wijsen, Jef ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SIZE; COMBINED COMPLEXITY; CURRENCY ORDERS; CURRENT DATA; DATA COMPLEXITY; DATA CURRENCY; DATA SOURCE; FUNDAMENTAL PROBLEM; LOWER COMPLEXITY; REAL-LIFE DATABASE; REDUNDANT DATA; TIME STAMPS; UPPER AND LOWER BOUNDS;

INTERNATIONAL TRADE; QUERY PROCESSING;

QUERY LANGUAGES;

EID: 79960191900     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989295     Document Type: Conference Paper

References (34)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. L. Berti-Equille, A. D. Sarma, X. Dong, A. Marian, and D. Srivastava. Sailing the information ocean with awareness of currents: Discovery and application of source dependence. In CIDR, 2009.
3. L. Bertossi. Consistent query answering in databases. SIGMOD Rec., 35(2), 2006.
4. M. Bodirsky and J. Kára. The complexity of temporal constraint satisfaction problems. JACM, 57(2), 2010.
5. P. Buneman, J. Cheney, W. Tan, and S. Vansummeren. Curated databases. In PODS, 2008.
6. J. Cheney, L. Chiticariu, and W. C. Tan. Provenance in databases: Why, how, and where. Foundations and Trends in Databases, 1(4):379-474, 2009.
7. J. Chomicki. Consistent query answering: Five easy pieces. In ICDT, 2007.
8. J. Chomicki and D. Toman. Time in database systems. In M. Fisher, D. Gabbay, and L. Vila, editors, Hand- book of Temporal Reasoning in Artificial Intelligence. Elsevier, 2005.
9. J. Clifford, C. E. Dyreson, T. Isakowitz, C. S. Jensen, and R. T. Snodgrass. On the semantics of "now" in databases. TODS, 22(2):171-214, 1997.
10. E. F. Codd. Extending the database relational model to capture more meaning. TODS, 4(4):397-434, 1979. (Pubitemid 10433772)
11. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisited. In PODS, 2008.
12. X. Dong, L. Berti-Equille, Y. Hu, and D. Srivastava. Global detection of complex copying relationships between sources. In VLDB, 2010.
13. X. Dong, L. Berti-Equille, and D. Srivastava. Truth discovery and copying detection in a dynamic world. In VLDB, 2009.
14. C. E. Dyreson, C. S. Jensen, and R. T. Snodgrass. Now in temporal databases. In L. Liu and M. T. Özsu, editors, Encyclopedia of Database Systems. Springer, 2009.
15. W. W. Eckerson. Data quality and the bottom line: Achieving business success through a commitment to high quality data. Data Warehousing Institute, 2002.
16. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. TKDE, 19(1):1- 16, 2007. (Pubitemid 44955773)
17. W. Fan, F. Geerts, J. Li, and M. Xiong. Discovering conditional functional dependencies. TKDE, 23(4):683- 698, 2011.
18. M. Garey and D. Johnson. Computers and Intractabil- ity: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
19. G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991.
20. M. Grohe and G. Schwandtner. The complexity of datalog on linear orders. Logical Methods in Computer Science, 5(1), 2009.
21. T. Imieliński and W. Lipski, Jr. Incomplete information in relational databases. JACM, 31(4), 1984.
22. Knowledge Integrity. Two sides to data decay. DM Review, 2003.
23. P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, 2005.
24. M. Koubarakis. Database models for infinite and indefinite temporal information. Inf. Syst., 19(2):141-173, 1994. (Pubitemid 124012574)
25. M. Koubarakis. The complexity of query evaluation in indefinite temporal constraint databases. TCS, 171(1- 2):25-60, 1997. (Pubitemid 127452807)
26. M. W. Krentel. Generalizations of Opt P to the polynomial hierarchy. TCS, 97(2):183-198, 1992.
27. M. Lenzerini. Data integration: A theoretical perspective. In PODS, 2002.
28. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
29. E. Schwalb and L. Vila. Temporal constraints: A survey. Constraints, 3(2-3):129-149, 1998. (Pubitemid 128517751)
30. R. T. Snodgrass. Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann, 1999.
31. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. JCSS, 54(1), 1997.
32. R. van der Meyden. Logical approaches to incomplete information: A survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems. Kluwer, 1998.
33. V. Vianu. Dynamic functional dependencies and database aging. J. ACM, 34(1):28-59, 1987. (Pubitemid 17601598)
34. H. Zhang, Y. Diao, and N. Immerman. Recognizing patterns in streams with imprecise timestamps. In VLDB, 2010.