22 citations · 23 across the 6 of their papers we have counts for
9 papers · 1 filter
Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
Nima Shahbazi, Aryan Esmailpour, Stavros Sintos
The weighted set multi-cover problem is a fundamental generalization of set cover that arises in data-driven applications where one must select a small, low-cost subset from a larg…
Subset Sampling over Joins
Aryan Esmailpour, Xiao Hu, Jinchao Huang +1
Subset sampling (also known as Poisson sampling), where the decision to include any specific element in the sample is made independently of all others, is a fundamental primitive i…
Space-Time Tradeoffs for Spatial Conjunctive Queries
Aryan Esmailpour, Xiao Hu, Stavros Sintos
Given a conjunctive query and a database instance, we aim to develop an index that can efficiently answer spatial queries on the results of a conjunctive query. We are interested i…
On Reporting Durable Patterns in Temporal Proximity Graphs
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos +1
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding du…
Finding Smallest Witnesses for Conjunctive Queries
Xiao Hu, Stavros Sintos
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 debugging, query exp…
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing
Xi Liang, Stavros Sintos, Zechao Shang +1
Sample-based approximate query processing (AQP) suffers from many pitfalls such as the inability to answer very selective queries and unreliable confidence intervals when sample si…