Approximate selection with guarantees using proxies

D Kang, E Gan, P Bailis, T Hashimoto… - arXiv preprint arXiv …, 2020 - arxiv.org
Due to the falling costs of data acquisition and storage, researchers and industry analysts
often want to find all instances of rare events in large datasets. For instance, scientists can …

Answering (unions of) conjunctive queries using random access and random-order enumeration

N Carmeli, S Zeevi, C Berkholz, B Kimelfeld… - Proceedings of the 39th …, 2020 - dl.acm.org
As data analytics becomes more crucial to digital systems, so grows the importance of
characterizing the database queries that admit a more efficient evaluation. We consider the …

The relational data borg is learning

D Olteanu - arXiv preprint arXiv:2008.07864, 2020 - arxiv.org
This paper overviews an approach that addresses machine learning over relational data as
a database problem. This is justified by two observations. First, the input to the learning task …

Turbocharging geospatial visualization dashboards via a materialized sampling cube approach

J Yu, M Sarwat - 2020 IEEE 36th International Conference on …, 2020 - ieeexplore.ieee.org
In this paper, we present a middleware framework that runs on top of a SQL data system with
the purpose of increasing the interactivity of geospatial visualization dashboards. The …

Efficient join synopsis maintenance for data warehouse

Z Zhao, F Li, Y Liu - Proceedings of the 2020 ACM SIGMOD International …, 2020 - dl.acm.org
Various sources such as daily business operations and sensors from different IoT
applications constantly generate a lot of data. They are often loaded into a data warehouse …

[PDF][PDF] An efficient reactive join nested loop machine learning inputs in autonomous smart grid environment

M Nilesh, M Prasad, R Sabitha, R KV… - Eur J Mol Clin Med, 2020 - researchgate.net
Adaptive join algorithms have recently attracted a lot of attention in emerging applications
that provide data through autonomous data sources in diverse network environments. Their …

Bandit join: preliminary results

V Ghadakchi, M Xie, A Termehchy - Proceedings of the Third …, 2020 - dl.acm.org
Join is arguably the most costly and frequently used operation in relational query
processing. Join algorithms usually spend the majority of their time on scanning and …

Sampling Technique for Complex Data

A Idarrou, H Douzi - Sampling Techniques for Supervised or Unsupervised …, 2020 - Springer
In the context of Big Data, complex data from heterogeneous and distributed sources is
potentially unlimited in number. The analysis of these data is now at the center of the …

[PDF][PDF] A time efficient and accurate retrieval of range aggregate queries using fuzzy clustering means (FCM) approach

A Murugan, D Gobinath, SG Kumar… - International Journal of …, 2020 - academia.edu
Massive growth in the big data makes difficult to analyse and retrieve the useful information
from the set of available data's. Existing approaches cannot guarantee an efficient retrieval …

Quality of service aware data stream processing for highly dynamic and scalable applications

A Jawarneh, IM Hasan - 2020 - amsdottorato.unibo.it
Huge amounts of georeferenced data streams are arriving daily to data stream management
systems that are deployed for serving highly scalable and dynamic applications. There are …