S Deng, S Lu, Y Tao - Proceedings of the 42nd ACM SIGMOD-SIGACT …, 2023 - dl.acm.org
We present a dynamic index structure for join sampling. Built for an (equi-) join Q---let IN be the total number of tuples in the input relations of Q---the structure uses~ O (IN) space …
X Hu - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
This paper studies how to use fast matrix multiplication to speed up query processing. As observed, computing a two-table join and then projecting away the join attribute is …
S Deep, P Koutris - arXiv preprint arXiv:1902.02698, 2019 - arxiv.org
We investigate the enumeration of top-k answers for conjunctive queries against relational databases according to a given ranking function. The task is to design data structures and …
We investigate the enumeration of query results for an important subset of CQs with projections, namely star and path queries. The task is to design data structures and …
The main focus of this work is on large set intersection, which is a pivotal operation in information retrieval, graph analytics and database systems. We aim to experimentally …
Recent advances in Graphic Processing Units (GPUs) have facilitated a significant performance boost for database operators, in particular, joins. It has been intensively studied …
Most data analytical pipelines often encounter the problem of querying inconsistent data that violate pre-determined integrity constraints. Data cleaning is an extensively studied …
Z Huang, S Chen - Proceedings of the VLDB Endowment, 2022 - dl.acm.org
A Join-Project operation is a join operation followed by a duplicate eliminating projection operation. It is used in a large variety of applications, including entity matching, set analytics …
Q Xia, L Zhou, W Ren, Y Wang - Computer Networks, 2022 - Elsevier
The rise of big data brings extraordinary benefits and opportunities to businesses and governments. Enterprise users can analyze their consumers' data and infer the business …