Querying big social data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7968 LNCS, Issue , 2013, Pages 14-28

  Fan, Wenfei ^a,b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BIG DATUM; COMPUTATIONAL COMPLEXITY THEORY; QUERY ANSWERING; QUERY CLASS; QUERY EVALUATION; SOCIAL DATUM;

SOCIAL NETWORKING (ONLINE);

COMPUTATIONAL COMPLEXITY;

EID: 84879970156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39467-6_5     Document Type: Conference Paper

References (36)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
2. Afrati, F.N., Ullman, J.D.: Optimizing joins in a map-reduce environment. In: EDBT (2010)
3. Bendersky, M., Metzler, D., Croft, W.: Learning concept importance using a weighted dependence model. In: WSDM (2010)
4. Brynielsson, J., Högberg, J., Kaati, L., Martenson, C., Svenson, P.: Detecting social positions using simulation. In: ASONAM (2010)
5. Buneman, P., Fan, W.: Data driven approximation algorithms for querying big data (2013) (unpublished manuscript)
6. Crescenzi, P., Kann, V., Halldórsson, M.: A compendium of NP optimization problems, http://www.nada.kth.se/∼viggo/wwwcompendium/
7. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1) (2008)
8. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. JCSS 66(4), 614-656 (2003)
9. Fan, W., Geerts, F.: Foundations of Data Quality Management. Morgan & Claypool Publishers (2012)
10. Fan, W., Geerts, F., Neven, F.: Making queries tractable on big data with preprocessing. In: PVLDB (2013)
11. Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: ICDE (2011)
12. Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractability to polynomial time. In: PVLDB (2010)
13. Fan, W., Li, J., Tan, Z., Wang, X., Wu, Y.: Incremental graph pattern matching. In: SIGMOD (2011)
14. Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: SIGMOD (2012)
15. Fan, W., Wang, X., Wu, Y.: Performance guarantees for distributed reachability queries. In: PVLDB (2012)
16. Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching (2013) (unpublished manuscript)
17. Fan, W., Wang, X., Wu, Y.: Graph pattern matching using views (2013) (unpublished manuscript)
18. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995)
19. Halevy, A.Y.: Answering queries using views: A survey. VLDB J. 10(4) (2001)
20. Hellerstein, J.M.: The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Record 39(1), 5-19 (2010)
21. Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)
22. Johnson, D.S.: A catalog of complexity classes. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), The MIT Press (1990)
23. Jones, N.D.: An introduction to partial evaluation. ACM Comput. Surv. 28(3), 480-503 (1996)
24. Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: SODA (2010)
25. Koutris, P., Suciu, D.: Parallel evaluation of conjunctive queries. In: PODS (2011)
26. Lenzerini, M.: Data integration: A theoretical perspective. In: PODS (2002)
27. Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4) (2011)
28. Milner, R.: Communication and Concurrency. Prentice Hall (1989)
29. Morris, M., Teevan, J., Panovich, K.: What do people ask their social networks, and why? A survey study of status message Q&A behavior. In: CHI (2010)
30. Natarajan, M.: Understanding the structure of a drug trafficking organization: a conversational analysis. Crime Prevention Studies 11, 273-298 (2000)
31. Ntoulas, A., Cho, J., Olston, C.: What's new on the Web? The evolution of the Web from a search engine perspective. In: WWW (2004)
32. Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. TCS 158(1-2) (1996)
33. Terveen, L., McDonald, D.W.: Social matching: A framework and research agenda. ACM Trans. Comput.-Hum. Interact. 12(3) (2005)
34. Thorup, M., Zwick, U.: Approximate distance oracles. JACM 52(1), 1-24 (2005)
35. Ullmann, J.R.: An algorithm for subgraph isomorphism. JACM 23(1), 31-42 (1976)
36. Vazirani, V.V.: Approximation Algorithms. Springer (2003)