Online processing algorithms for influence maximization

J Tang, X Tang, X Xiao, J Yuan - … of the 2018 international conference on …, 2018 - dl.acm.org
Influence maximization is a classic and extensively studied problem with important
applications in viral marketing. Existing algorithms for influence maximization, however …

Verdictdb: Universalizing approximate query processing

Y Park, B Mozafari, J Sorenson, J Wang - Proceedings of the 2018 …, 2018 - dl.acm.org
Despite 25 years of research in academia, approximate query processing (AQP) has had
little industrial adoption. One of the major causes of this slow adoption is the reluctance of …

Approximate query processing: What is new and where to go? a survey on approximate query processing

K Li, G Li - Data Science and Engineering, 2018 - Springer
Online analytical processing (OLAP) is a core functionality in database systems. The
performance of OLAP is crucial to make online decisions in many applications. However, it is …

Random sampling over joins revisited

Z Zhao, R Christensen, F Li, X Hu, K Yi - Proceedings of the 2018 …, 2018 - dl.acm.org
Joins are expensive, especially on large data and/or multiple relations. One promising
approach in mitigating their high costs is to just return a simple random sample of the full join …

Research directions for principles of data management (dagstuhl perspectives workshop 16151)

S Abiteboul, M Arenas, P Barceló, M Bienvenu… - 2018 - drops.dagstuhl.de
The area of Principles of Data Management (PDM) has made crucial contributions to the
development of formal frameworks for understanding and managing data and knowledge …

Smooth scan: robust access path selection without cardinality estimation

R Borovica-Gajic, S Idreos, A Ailamaki, M Zukowski… - The VLDB Journal, 2018 - Springer
Query optimizers depend heavily on statistics representing column distributions to create
good query plans. In many cases, though, statistics are outdated or nonexistent, and the …

Approxjoin: Approximate distributed joins

DL Quoc, IE Akkus, P Bhatotia, S Blanas… - Proceedings of the …, 2018 - dl.acm.org
A distributed join is a fundamental operation for processing massive datasets in parallel.
Unfortunately, computing an equi-join over such datasets is very resource-intensive, even …

Model-based approximate query processing

M Kulessa, A Molina, C Binnig, B Hilprecht… - arXiv preprint arXiv …, 2018 - arxiv.org
Interactive visualizations are arguably the most important tool to explore, understand and
convey facts about data. In the past years, the database community has been working on …

Optimally leveraging density and locality for exploratory browsing and sampling

A Kim, L Xu, T Siddiqui, S Huang, S Madden… - Proceedings of the …, 2018 - dl.acm.org
Exploratory data analysis often involves repeatedly browsing a small sample of records that
satisfy certain predicates. We propose a fast query evaluation engine, called NeedleTail …

Approximate calculation of window aggregate functions via global random sample

G Song, W Qu, X Liu, X Wang - Data Science and Engineering, 2018 - Springer
Window functions have been a part of the SQL standard since 2003 and have been studied
extensively during the past decade. They are widely used in data analysis; almost all the …