ConferenceLecture Notes in Computer Science · January 1, 2026
Modern database systems are expected to handle dynamic data whose characteristics may evolve over time. Many popular database benchmarks are limited in their ability to evaluate this dynamic aspect of the database systems. Those that use synthetic data gen ...
Full textCite
ConferenceAdvances in Database Technology Edbt · June 26, 2025
In hybrid transactional and analytical processing (HTAP) systems, users often struggle to understand why query plans from one engine (OLAP or OLTP) perform signi cantly slower than those from another. Although optimizers provide plan details via the EXPLAI ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2025
Parametric Query Optimization (PQO) is an important problem in database systems, yet existing approaches suffer from high training costs, sensitivity to estimation errors, and vulnerability to severe performance regressions. This paper introduces PAR2QO (P ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2025
Query optimizers rely heavily on selectivity estimates to choose efficient execution plans, but inaccuracies in these estimates often result in poor query performance. We introduce Hint-QPT (Hints for Robust Query Performance Tuning), an interactive tool d ...
Full textCite
ConferenceACM International Conference Proceeding Series · July 2, 2024
Declarative querying is a cornerstone of the success and longevity of database systems, yet it is challenging for novice learners accustomed to different coding paradigms. The transition is further hampered by a lack of query debugging tools compared to th ...
Full textCite
ConferenceLeibniz International Proceedings in Informatics Lipics · March 1, 2024
We are given a set Z = {(R1, s1), ..., (Rn, sn)}, where each Ri is a range in Rd, such as rectangle or ball, and si ∈ [0, 1] denotes its selectivity. The goal is to compute a smal ...
Full textCite
ConferenceLeibniz International Proceedings in Informatics Lipics · March 1, 2024
Data analytics skills have become an indispensable part of any education that seeks to prepare its students for the modern workforce. Essential in this skill set is the ability to work with structured relational data. Relational queries are based on logic ...
Full textCite
ConferenceFindings of the Association for Computational Linguistics Naacl 2024 Findings · January 1, 2024
One way to personalize chatbot interactions is by establishing common ground with the intended reader. A domain where establishing mutual understanding could be particularly impactful is vaccine concerns and misinformation. Vaccine interventions are forms ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2024
The effectiveness of a query optimizer relies on the accuracy of selectivity estimates. The execution plan generated by the optimizer can be extremely poor in reality due to uncertainty in these estimates. This paper presents PARQO (Penalty-Aware Robust Pl ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · June 5, 2023
Example database instances can be very helpful in understanding complex queries. Different examples may illustrate alternative situations in which answers emerge in the query results and can be useful for testing. Examples can also help reveal semantic dif ...
Full textCite
ConferenceConference on Human Factors in Computing Systems Proceedings · April 19, 2023
Human data labeling is an important and expensive task at the heart of supervised learning systems. Hierarchies help humans understand and organize concepts. We ask whether and how concept hierarchies can inform the design of annotation interfaces to impro ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · June 11, 2022
This paper explores the use of machine learning for estimating the selectivity of range queries in database systems. Using classic learning theory for real-valued functions based on shattering dimension, we show that the selectivity function of a range spa ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · June 11, 2022
This paper studies multi-way join queries over temporal data, where each tuple is associated with a valid time interval indicating when the tuple is valid. A temporal join requires that joining tuples' valid intervals intersect. Previous work on temporal j ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · June 11, 2022
A powerful way to understand a complex query is by observing how it operates on data instances. However, specific database instances are not ideal for such observations: they often include large amounts of superfluous details that are not only irrelevant t ...
Full textCite
ConferenceSensys 2020 Proceedings of the 2020 18th ACM Conference on Embedded Networked Sensor Systems · November 16, 2020
Physical distancing between individuals is key to preventing the spread of a disease such as COVID-19. On the one hand, having access to information about physical interactions is critical for decision makers; on the other, this information is sensitive an ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2020
We study the problem of efficiently estimating counts for queries involving complex filters, such as user-defined functions, or predicates involving self-joins and correlated subqueries. For such queries, traditional sampling techniques may not be applicab ...
Full textCite
ConferenceProceedings. ACM-SIGMOD International Conference on Management of Data · June 2019
We present a system called RATEST, designed to help debug relational queries against reference queries and test database instances. In many applications, e.g., classroom learning and regression testing, we test the correctness of a user query Q by e ...
Full textCite
ConferenceProceedings. ACM-SIGMOD International Conference on Management of Data · June 2018
Methods for summarizing and diversifying query results have drawn significant attention recently, because they help present query results with lots of tuples to users in more informative ways. We present QAGView (Quick AGgregate View), which provides a hol ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2018
We present a system for summarization and interactive exploration of high-valued aggregate query answers to make a large set of possible answers more informative to the user. Our system outputs a set of clusters on the high-valued query answers showing the ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2018
Many datasets have a temporal dimension and contain a wealth of historical information. When using such data to make decisions, we often want to examine not only the current snapshot of the data but also its history. For example, given a result object of a ...
Full textCite
ConferenceProceedings International Conference on Data Engineering · May 16, 2017
Log-structure merge (LSM) is an increasingly prevalent approach to indexing, especially for modern writeheavy workloads. LSM organizes data in levels with geometrically increasing sizes. Records enter the top level; whenever a level fills up, it is merged ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · May 9, 2017
Iceberg queries, commonly used for decision support, find groups whose aggregate values are above or below a threshold. In practice, iceberg queries are often posed over complex joins that are expensive to evaluate. This paper proposes a framework for comb ...
Full textCite
ConferenceProceedings of the ACM SIGMOD International Conference on Management of Data · May 9, 2017
Large-scale data analytics using statistical machine learning (ML), popularly called advanced analytics, underpins many modern data-driven applications. The data management community has been working for over a decade on tackling data management-related ch ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2017
In many applications, the system needs to selectively present a small subset of answers to users. The set of all possible answers can be seen as an elevation surface over a domain, where the elevation measures the quality of each answer, and the dimensions ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2017
We present a system called Cümülön-D for matrix-based data analysis in a spot market of a public cloud. Prices in such markets fluctuate over time: while users can acquire machines usually at a very low bid price, the cloud can terminate these machines as ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2015
We present a system, Perada, for parallel perturbation analysis of database queries. Perturbation analysis considers the results of a query evaluated with (a typically large number of) different parameter settings, to help discover leads and evaluate claim ...
Full textCite
ConferenceProceedings of the VLDB Endowment · January 1, 2011
We consider the problem of storing arrays on disk to support scalable data analysis involving linear algebra. We propose Linearized Array B-tree, or LAB-tree, which supports flexible array layouts and automatically adapts to varying sparsity across parts o ...
Full textCite
Conference33rd International Conference on Very Large Data Bases VLDB 2007 Conference Proceedings · January 1, 2007
Sensor networks allow continuous data collection on unprecedented scales. The primary limiting factor of such networks is energy, of which communication is the dominant consumer. The default strategy of nodes continually reporting their data to the root re ...
Cite
Conference33rd International Conference on Very Large Data Bases VLDB 2007 Conference Proceedings · January 1, 2007
We address the problem of providing scalable support for subscriptions with personalized value-based notification conditions in wide-area publish/subscribe systems. Notification conditions can be fine-tuned by subscribers, allowing precise and flexible con ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2007
Wireless sensor networks can be viewed as the integration of three subsystems: a low-impact in situ data acquisition and collection system, a system for inference of process models from observed data and a priori information, and a system that controls the ...
Full textCite
ConferenceCidr 2007 3rd Biennial Conference on Innovative Data Systems Research · January 1, 2007
Wireless sensor networks are poised to enable continuous data collection on unprecedented scales, in terms of area location and size, and frequency. This is a great boon to fields such as ecological modeling. We are collaborating with researchers to build ...
Cite
ConferenceVLDB 2006 Proceedings of the 32nd International Conference on Very Large Data Bases · January 1, 2006
This paper considers the problem of scalably processing a large number of continuous queries. We propose a flexible framework with novel data structures and algorithms for group-processing and indexing continuous queries by exploiting potential overlaps in ...
Cite
ConferenceProceedings of the 26th International Conference on Very Large Data Bases VLDB 00 · December 1, 2000
A well-known challenge in data warehousing is the efficient incremental maintenance of warehouse data in the presence of source data updates. In this paper. we identify several critical data representation and algorithmic choices that must be made when dev ...
Cite
ConferenceVLDB 1998 Proceedings of the 24th International Conference on Very Large Data Bases · January 1, 1998
Data warehouses collect data into materialized views for analysis. After some time, some of the data may no longer be needed or may not be of interest. In this paper, we handle this by expiring or removing unneeded materialized view tuples. A framework sup ...
Cite
ConferenceProceedings of the 23rd International Conference on Very Large Databases VLDB 1997 · January 1, 1997
Businesses today need to interrelate data stored in diverse systems with differing capabilities, ideally via a single high-level query interface. We present the design of a query optimizer for Garlic [C+ 951, a middleware system designed to integrate data ...
Cite
