6 papers
Resizable Retrieval
William Kuszmaul, Aaron Putterman, Tingqiang Xu +2
A dynamic retrieval data structure encodes a function for a set , while supporting queries for , insertions \texttt{Insert}$…
PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans
Qiuyang Mang, Yufan Xiang, Hangrui Zhou +5
Recent database systems have introduced semantic operators that leverage large language models (LLMs) to filter, join, and project over structured data using natural language predi…
Scalable Approximate Biclique Counting over Large Bipartite Graphs
Jingbang Chen, Weinuo Li, Yingli Zhou +5
Counting -bicliques in bipartite graphs is crucial for a variety of applications, from recommendation systems to cohesive subgraph analysis. Yet, it remains computationally…
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Qiuyang Mang, Jingbang Chen, Hangrui Zhou +6
Bipartite graphs are ubiquitous in many domains, e.g., e-commerce platforms, social networks, and academia, by modeling interactions between distinct entity sets. Within these grap…
Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
William Kuszmaul, Aaron Putterman, Tingqiang Xu +2
Retrieval data structures are data structures that answer key-value queries without paying the space overhead of explicitly storing keys. The problem can be formulated in four sett…
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
Jingbang Chen, Qiuyang Mang, Hangrui Zhou +3
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central…