Toward computational fact-checking

Proceedings of the VLDB Endowment

Volumn 7, Issue 7, 2014, Pages 589-600

  Wu, You ^a   Agarwal, Pankaj K ^a   Li, Chengkai ^b   Yang, Jun ^a   Yu, Cong ^c  

^a DUKE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REVERSE ENGINEERING;

ALGORITHMIC FRAMEWORK; BUILDING BLOCKES; COMPUTATIONAL PROBLEM; MODEL FRAMEWORK; PARAMETERIZED; REAL-WORLD; STRUCTURED DATA;

QUERY PROCESSING;

EID: 84896895189     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732286.2732295     Document Type: Conference Paper

References (29)

1. C. C. Aggarwal, editor. Managing and Mining Uncertain Data. Springer, 2009.
2. P. Agrawal and J. Widom. Confidence-aware join algorithms. ICDE, 2009, 628-639.
3. A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9(1979), 216-219.
4. M. A. Bender and M. Farach-Colton. The LCA problem revisited. LATIN, 2000, 88-94.
5. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. ICDE, 2001, 421-430.
6. S Cohen, J. T. Hamilton, and F. Turner. Computational journalism. CACM, 54(2011), 66-71.
7. S. Cohen, C. Li, J. Yang, and C. Yu. Computational journalism: A call to arms to database researchers. CIDR, 2011.
8. Harish D., P. N. Darera, and J. R. Haritsa. Identifying robust plans through plan diagram reduction. VLDB, 2008, 1124-1140.
9. N. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: Diamonds in the dirt. CACM, 52(2009), 86-94.
10. J. Fischer and V. Heun. A new succinct representation of rmqinformation and improvements in the enhanced suffix array. ESCAPE, 2007, 459-470.
11. S. Ganguly. Design and analysis of parametric query optimization algorithms. VLDB, 1998, 228-238.
12. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. ICDE, 1996, 152-159.
13. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM, 13(1984), 338-355.
14. Z. He and E. Lo. Answering why-not questions on top-k queries. ICDE, 2012, 750-761.
15. A. Hulgeri and S. Sudarshan. AniPQO: Almost non-intrusive parametric query optimization for nonlinear cost functions. VLDB, 2003, 766-777.
16. Y. E. Ioannidis, R. T. Ng, K. Shim, and T. K. Sellis. Parametric query optimization. VLDB, 1992, 103-114.
17. R. Jampani, F. Xu, M. Wu, L. L. Perez, C. Jermaine, and P. J. Haas. The Monte Carlo database system: Stochastic analysis close to the data. TODS, 36(2011), 18.
18. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. JACM, 22(1975), 469-476.
19. X Lin, A. Mukherji, E. A. Rundensteiner, C. Ruiz, and M. O. Ward. PARAS: A parameter space framework for online association mining. VLDB 6(2013), 193-204.
20. Y. Luo, X. Lin, W. Wang, and X. Zhou. Spark: top-k keyword query in relational databases. SIGMOD, 2007, 115-126.
21. K. Mouratidis and H. Pang. Computing immutable regions for subspace top-k queries. VLDB, 6(2012), 73-84.
22. A. Das Sarma, A. G. Parameswaran, H. Garcia-Molina, and J.Widom. Synthesizing view definitions from data. ICDT, 2010, 89-103.
23. M. A. Soliman, I. F. Ilyas, D. Martinenghi, and M. Tagliasacchi. Ranking with uncertain scoring functions: Semantics and sensitivity measures. SIGMOD, 2011, 805-816.
24. R. E. Tarjan. Applications of path compression on balanced trees. JACM, 26(1979), 690-715.
25. Q.T. Tran and C.Y. Chan. How to ConQueR why-not questions. SIGMOD, 2010, 15-26.
26. Q. T. Tran, C. Y. Chan, and S. Parthasarathy. Query by output. SIGMOD, 2009, 535-548.
27. E. Wu and S. Madden. Scorpion: Explaining away outliers in aggregate queries. VLDB, 6(2013), 553-564.
28. Y. Wu, P. K. Agarwal, C. Li, J. Yang, and C. Yu. Toward computational fact-checking. Technical report, Duke University, 2013. http://www.cs.duke.edu/dbgroup/papers/ WuAgarwalEtAl-13-fact_check.pdf.
29. A. Yu, P. K. Agarwal, and J. Yang. Processing a large number of continuous preference top-k queries. SIGMOD, 2012, 397-408.