Effective and complete discovery of order dependencies via set-based axiomatization

J Szlichta, P Godfrey, L Golab, M Kargar… - arxiv preprint arxiv …, 2016 - arxiv.org
Integrity constraints (ICs) provide a valuable tool for expressing and enforcing application
semantics. However, formulating constraints manually requires domain expertise, is prone to …

Expressiveness and complexity of order dependencies

J Szlichta, P Godfrey, J Gryz, C Zuzarte - Proceedings of the VLDB …, 2013 - dl.acm.org
Dependencies play an important role in databases. We study order dependencies (ODs)--
and unidirectional order dependencies (UODs), a proper sub-class of ODs--which describe …

Parameterized property testing of functions

RKS Pallavoor, S Raskhodnikova… - ACM Transactions on …, 2017 - dl.acm.org
We investigate the parameters in terms of which the complexity of sublinear-time algorithms
should be expressed. Our goal is to find input parameters that are tailored to the …

BoDS: A benchmark on data sortedness

A Raman, K Karatsenidis, S Sarkar, M Olma… - Technology Conference …, 2022 - Springer
Indexes in data systems accelerate data access by adding structure to otherwise
unstructured data at the cost of index construction and maintenance. Data systems, and …

[PDF][PDF] Business-Intelligence Queries with Order Dependencies in DB2.

J Szlichta, P Godfrey, J Gryz, W Ma, W Qiu, C Zuzarte - EDBT, 2014 - openproceedings.org
Business-intelligence queries often involve SQL functions and algebraic expressions. There
can be clear semantic relationships between a column's values and the values of a function …

Indexing for near-sorted data

A Raman, S Sarkar, M Olma… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
Indexing in modern data systems facilitates efficient query processing when the selection
predicate is on an indexed key. As new data is ingested, indexes are gradually populated …

Testability of homomorphism inadmissibility: Property testing meets database theory

H Chen, Y Yoshida - Proceedings of the 38th ACM SIGMOD-SIGACT …, 2019 - dl.acm.org
In this paper, we utilize the perspective of property testing to consider the testability of
relational database queries. A primary motivation is the desire to avoid reading an entire …

[PDF][PDF] QuIT your B+-tree for the Quick Insertion Tree

A Raman, K Karatsenidis, S **e, M Olma, S Sarkar… - complexity, 2025 - subhadeep.net
Search trees, like B+-trees, are often used as index structures in data systems to improve
query performance at the cost of index construction and maintenance. Production data …

OSM-tree: A Sortedness-Aware Index

A Raman, S Sarkar, M Olma… - arxiv preprint arxiv …, 2022 - arxiv.org
Indexes facilitate efficient querying when the selection predicate is on an indexed key. As a
result, when loading data, if we anticipate future selective (point or range) queries, we …

External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes

Y Kanza, H Yaari - The VLDB Journal, 2016 - Springer
This paper studies the problem of how to conduct external sorting on flash drives while
avoiding intermediate writes to the disk. The focus is on sort in portable electronic devices …