Wednesday, August 6, 2014 2:30 PM EDT
| Abstract: | Minyang Han, K. Daudjee, K. Ammar, M. T. Özsu, X. Wang, T. Jin, An Experimental Comparison of Pregel-like Graph Processing Systems. Güneş Aluç, M. T. Özsu, K. Daudjee, Workload Matters: Why RDF Databases Need a New Design. |
Tuesday, August 5, 2014 3:00 PM EDT
| Speaker: | Alistair Moffat, , Department of Computing and Information Systems, The University of Melbourne |
| Abstract: | Web search services process thousands of queries per second, and filter their answers from collections containing very large amounts of data. Fast response to queries is a critical service expectation. The well-known WAND (Weak AND) processing strategy is one way of reducing the amount of computation necessary when executing such a query. |
