Search Results - "Sintos, Stavros"

The maximum exposure problem by Kumar, Neeraj, Sintos, Stavros, Suri, Subhash

“…Given a set of points P and axis-aligned rectangles R in the plane, a point p∈P is called exposed if it lies outside all rectangles in R. In the max-exposure…”
Get full text

JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing by Liang, Xi, Sintos, Stavros, Krishnan, Sanjay

“…Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to…”
Get full text

Efficient Algorithms for Querying Large and Uncertain Data by Sintos, Stavros

“…Query processing is an important problem in many research fields including database systems, data mining, and geometric computing. The goal is to preprocess…”
Get full text

Improved Approximation Algorithms for Relational Clustering by Esmailpour, Aryan, Sintos, Stavros

“…Clustering plays a crucial role in computer science, facilitating data analysis and problem-solving across numerous fields. By partitioning large datasets into…”
Get full text

Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions by Gao, Junyang, Sintos, Stavros, Agarwal, Pankaj K., Yang, Jun

“…A way of finding interesting or exceptional records from instant-stamped temporal data is to consider their "durability, " or, intuitively speaking, how well…”
Get full text

Range Entropy Queries and Partitioning by Krishnan, Sanjay, Sintos, Stavros

“…ICDT 2024 Data partitioning that maximizes or minimizes Shannon entropy is a crucial subroutine in data compression, columnar storage, and cardinality…”
Get full text

Finding Smallest Witnesses for Conjunctive Queries by Hu, Xiao, Sintos, Stavros

“…A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and…”
Get full text

A Fair and Memory/Time-efficient Hashmap by Asudeh, Abolfazl, Shahbazi, Nima, Sintos, Stavros

“…SIGMOD 2024 Hashmap is a fundamental data structure in computer science. There has been extensive research on constructing hashmaps that minimize the number of…”
Get full text

Fair Set Cover by Dehghankar, Mohsen, Raychaudhury, Rahul, Sintos, Stavros, Asudeh, Abolfazl

“…The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in…”
Get full text

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d by Kurkure, Yash, Shamo, Miles, Wiseman, Joseph, Galhotra, Sainyam, Sintos, Stavros

“…SIGMOD 2024 The task of extracting a diverse subset from a dataset, often referred to as maximum diversification, plays a pivotal role in various real-world…”
Get full text

On Reporting Durable Patterns in Temporal Proximity Graphs by Agarwal, Pankaj K, Hu, Xiao, Sintos, Stavros, Yang, Jun

“…PODS 2024 Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so…”
Get full text

Computing Data Distribution from Query Selectivities by Agarwal, Pankaj K, Raychaudhury, Rahul, Sintos, Stavros, Yang, Jun

“…ICDT 2024 We are given a set $\mathcal{Z}=\{(R_1,s_1),\ldots, (R_n,s_n)\}$, where each $R_i$ is a \emph{range} in $\Re^d$, such as rectangle or ball, and $s_i…”
Get full text

JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing by Liang, Xi, Sintos, Stavros, Krishnan, Sanjay

“…Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to…”
Get full text

Fast Approximation Algorithms for Piercing Boxes by Points by Agarwal, Pankaj K, Har-Peled, Sariel, Raychaudhury, Rahul, Sintos, Stavros

“…$ \newcommand{\Re}{\mathbb{R}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon}…”
Get full text

The Maximum Exposure Problem by Kumar, Neeraj, Sintos, Stavros, Suri, Subhash

“…Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles…”
Get full text

Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise by Sintos, Stavros, Agarwal, Pankaj K, Yang, Jun

“…We study the optimization problem of selecting numerical quantities to clean in order to fact-check claims based on such data. Oftentimes, such claims are…”
Get full text

Dynamic Enumeration of Similarity Joins by Agarwal, Pankaj K, Hu, Xiao, Sintos, Stavros, Yang, Jun

“…This paper considers enumerating answers to similarity-join queries under dynamic updates: Given two sets of $n$ points $A,B$ in $\mathbb{R}^d$, a metric…”
Get full text

Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing by Liang, Xi, Sintos, Stavros, Shang, Zechao, Krishnan, Sanjay

“…Sample-based approximate query processing (AQP) suffers from many pitfalls such as the inability to answer very selective queries and unreliable confidence…”
Get full text

Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions by Gao, Junyang, Sintos, Stavros, Agarwal, Pankaj K, Yang, Jun

“…A way of finding interesting or exceptional records from instant-stamped temporal data is to consider their "durability," or, intuitively speaking, how well…”
Get full text

Learning to Sample: Counting with Complex Queries by Walenz, Brett, Sintos, Stavros, Roy, Sudeepa, Yang, Jun

“…We study the problem of efficiently estimating counts for queries involving complex filters, such as user-defined functions, or predicates involving self-joins…”
Get full text