Da Yan

According to our database1, Da Yan
  • authored at least 33 papers between 2011 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
GraphD: Distributed Vertex-Centric Graph Processing Beyond the Memory Limit.
IEEE Trans. Parallel Distrib. Syst., 2018

2017
Systems for Big Graph Analytics
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-58216-0, 2017

Big Graph Analytics Platforms.
Foundations and Trends in Databases, 2017

G-thinker: Big Graph Mining Made Easier and Faster.
CoRR, 2017

Efficient Processing of Growing Temporal Graphs.
Proceedings of the Database Systems for Advanced Applications, 2017

Architectural implications on the performance and cost of graph analytics systems.
Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, 2017

2016
A General-Purpose Query-Centric Framework for Querying Big Graphs.
PVLDB, 2016

Efficient Processing of Very Large Graphs in a Small Cluster.
CoRR, 2016

Lightweight Fault Tolerance in Large-Scale Distributed Graph Processing.
CoRR, 2016

Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs.
CoRR, 2016

Quegel: A General-Purpose System for Querying Big Graphs.
Proceedings of the 2016 International Conference on Management of Data, 2016

Big Graph Analytics Systems.
Proceedings of the 2016 International Conference on Management of Data, 2016

Diversified Temporal Subgraph Pattern Mining.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

SGraph: A Distributed Streaming System for Processing Big Graphs.
Proceedings of the Big Data Computing and Communications - Second International Conference, 2016

2015
Probabilistic Convex Hull Queries over Uncertain Data.
IEEE Trans. Knowl. Data Eng., 2015

Efficient processing of optimal meeting point queries in Euclidean space and road networks.
Knowl. Inf. Syst., 2015

Efficient location-based search of trajectories with location importance.
Knowl. Inf. Syst., 2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation.
CoRR, 2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation.
Proceedings of the 24th International Conference on World Wide Web, 2015

Core decomposition in large temporal graphs.
Proceedings of the 2015 IEEE International Conference on Big Data, 2015

2014
Mining Probabilistically Frequent Sequential Patterns in Large Uncertain Databases.
IEEE Trans. Knowl. Data Eng., 2014

Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees.
PVLDB, 2014

Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs.
PVLDB, 2014

Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation.
PVLDB, 2014

2013
A transfer learning based framework of crowd-selection on twitter.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Finding distance-preserving subgraphs in large road networks.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
A probabilistic convex hull query tool.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Mining probabilistically frequent sequential patterns in uncertain databases.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

Leveraging read rates of passive RFID tags for real-time indoor location tracking.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Efficient Algorithms for Finding Optimal Meeting Point on Road Networks.
PVLDB, 2011

Robust Ranking of Uncertain Data.
Proceedings of the Database Systems for Advanced Applications, 2011

Efficient methods for finding influential locations with adaptive grids.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011


  Loading...