7 citations · 11 across the 8 of their papers we have counts for
9 papers
Random Sampling for Group-By Queries
Trong Duc Nguyen, Ming-Hung Shih, Sai Sree Parvathaneni +3
Random sampling has been widely used in approximate query processing on large databases, due to its potential to significantly reduce resource usage and response times, at the cost…
Variance-Optimal Offline and Streaming Stratified Random Sampling
Trong Duc Nguyen, Ming-Hung Shih, Divesh Srivastava +2
Stratified random sampling (SRS) is a fundamental sampling technique that provides accurate estimates for aggregate queries using a small size sample, and has been used widely for…
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
Wing-Kai Hon, Sharma V. Thankachan, Bojian Xu
We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as…
On Stabbing Queries for Generalized Longest Repeat
Bojian Xu
A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particu…
CloudTree: A Library to Extend Cloud Services for Trees
Yun Tian, Bojian Xu, Yanqing Ji +1
In this work, we propose a library that enables on a cloud the creation and management of tree data structures from a cloud client. As a proof of concept, we implement a new cloud…
On Longest Repeat Queries Using GPU
Yun Tian, Bojian Xu
Repeat finding in strings has important applications in subfields such as computational biology. The challenge of finding the longest repeats covering particular string positions w…
On Longest Repeat Queries
Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on t…
Shortest Unique Substring Query Revisited
Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal time and space algorithm that can find an SUS for every loc…
Boosting the Basic Counting on Distributed Streams
Bojian Xu
We revisit the classic basic counting problem in the distributed streaming model that was studied by Gibbons and Tirthapura (GT). In the solution for maintaining an -estimat…