Learn More
In data warehousing applications, numerous OLAP queries involve the processing of holistic aggregators such as computing the " top n, " median, quantiles, etc. In this paper, we present a novel approach called dynamic bucketing to efficiently evaluate these aggregators. We partition data into equiwidth buckets and further partition dense buckets into(More)
We focus on the problem of scalable shortest path analytics for large social graphs in this paper. While shortest path distance problem has been investigated extensively, massive graphs on social networks such as Facebook and Linked In call for reinvestigation of the problem due to the requirements of scalability and suitability for distributed computing.(More)
In data warehousing applications, numerous OLAP queries involve the processing of holistic operations such as computing the "top N", median, etc. Efficient implementations of these operations are hard to come by. Several algorithms have been proposed in the literature that estimate various quantiles of disk-resident data. Two such recent algorithms are(More)
—Online social networks serve as a promising platform for social eliteness and financial gain. With such a promise or dream, zombie accounts, behind which stand no real users, become prevalent. The detection of such accounts has been games of cat and mouse, with more and more sophisticated methods used by zombie account managers. In this work, we propose a(More)
  • Lixin Fu
  • 2016
Recommendation Systems (RS) can offer suggestions of items to users. Due to explosive growth of internet, e-commerce, and social networks, RS research has experienced great interest in recent years. Online Analytical Processing (OLAP) and data warehousing technologies have existed for a while and have been popular in many big businesses. In this paper we(More)
In this paper we investigate a new subset of delivery problems where the destinations are all to be delivered from one or more sources so that the total distance is minimized. For example, food is delivered for the customers who place orders from one or more restaurants. For one source, we propose and compare three greedy algorithms namely nearest neighbor(More)