Fast in-memory SQL analytics on typed graphs

C Lin, B Mandel, Y Papakonstantinou… - Proceedings of the VLDB …, 2016 - dl.acm.org
We study a class of graph analytics SQL queries, which we call relationship queries. These
queries involving aggregation, join, semijoin, intersection and selection are a wide superset …

[图书][B] Accelerating Analytic Queries on Compressed Data

C Lin - 2018 - search.proquest.com
Data compression techniques (both lossless and lossy compression methods) are widely
utilized in big data analytic applications in domains including health-care, transportation …

Jasmine: Exploring the Dependency-Aware Execution on Distributed Shared Memory

X Wei, H Hu, X Zhou, X Qi, W Qian, J Wang… - Proceedings of the 30th …, 2021 - dl.acm.org
Distributed shared memory abstraction can coordinate a cluster of machine nodes to
empower performance-critical queries with the scalable memory space and abundant …

Large-scale Graph Computation on Just a PC

A Kyrola - 2014 - apps.dtic.mil
Current systems for graph computation require a distributed computing cluster to handle
very large real-world problems, such as analysis on social networks or the web graph. While …

High-performance parallel systems for data-intensive computing

BD Myers - 2016 - digital.lib.washington.edu
Applications in data science rely on two computing paradigms: tuned high performance
parallel programs and data analytics. While historically their differences were good reason …

Fast In-Memory SQL Analytics on Graphs

C Lin, B Mandel, Y Papakonstantinou… - arXiv preprint arXiv …, 2016 - arxiv.org
We study a class of graph analytics SQL queries, which we call relationship queries.
Relationship queries are a wide superset of fixed-length graph reachability queries and of …

[引用][C] Fast in-memory SQL analytics on relationships between entities

C Lin, B Mandel, Y Papakonstantinou, M Springer - CoRR, abs/1602.00033, 2016