A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An introduction to partial evaluation
ACM Computing Surveys (CSUR)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Approximation algorithms
Communication and Concurrency
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
What's new on the web?: the evolution of the web from a search engine perspective
Proceedings of the 13th international conference on World Wide Web
Journal of the ACM (JACM)
Social matching: A framework and research agenda
ACM Transactions on Computer-Human Interaction (TOCHI)
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Learning concept importance using a weighted dependence model
Proceedings of the third ACM international conference on Web search and data mining
Optimizing joins in a map-reduce environment
Proceedings of the 13th International Conference on Extending Database Technology
What do people ask their social networks, and why?: a survey study of status message q&a behavior
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A model of computation for MapReduce
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Detecting Social Positions Using Simulation
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Performance guarantees for distributed reachability queries
Proceedings of the VLDB Endowment
Foundations of Data Quality Management
Foundations of Data Quality Management
| Hi-index | 0.00 |
Big data poses new challenges to query answering, from computational complexity theory to query evaluation techniques. Several questions arise. What query classes can be considered tractable in the context of big data? How can we make query answering feasible on big data? What should we do about the quality of the data, the other side of big data? This paper aims to provide an overview of recent advances in tackling these questions, using social network analysis as an example.