Srikanta Tirthapura

Srikanta Tirthapura

Auto-generated profile, based on publicly available information

Srikanta Tirthapura

Iowa State University 50011 IA USA

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2013 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
APA. Pavan
A. Pavan
KTKanat Tangwongsan
Kanat Tangwongsan
STSrikanta Tirthapura
Srikanta Tirthapura
KWKun-Lung Wu
Kun-Lung Wu
This paper presents a new space-efficient algorithm for counting and sampling triangles--and more generally, constant-sized cliques--in a massive graph whose edges arrive as a stream. Compared to prior work, our algorithm yields significant improvements in the space and time complexity for these fundamental problems. Our algorithm is simple to implement and has very good practical performance on large graphs.

3 July 2001
Verified
Conference Paper
Open access
PGPhillip B. Gibbons
Phillip B. Gibbons
STSrikanta Tirthapura
Srikanta Tirthapura
Massive data sets often arise as physically distributed, parallel data streams. We present algorithms for estimating simple functions on the union of such data streams, while using only logarithmic space per stream. Each processor observes only its own stream, and communicates with the other processors only after observing its entire stream. This models the set-up in current network monitoring products. Our algorithms employ a novel coordinated sampling technique to extract a sample of the union; this sample can be used to estimate aggregate functions on the union. The technique can also be used to estimate aggregate functions over the distinct “labels” in one or more data streams, e.g., to determine the zeroth frequency moment (i.e., the number of distinct labels) in one or more data streams. Our space and time bounds are the best known for these problems, and our logarithmic space bounds for coordinated sampling contrast with polynomial lower bounds for independent sampling. We relate our distributed streams model to previously studied non-distributed (i.e., merged) streams models, presenting tight bounds on the gap between the distributed and merged models for deterministic algorithms.

1 June 2012 in Organic Electronics
Verified
Journal Article
Closed access
OWOlga Wodo
Olga Wodo
STSrikanta Tirthapura
Srikanta Tirthapura
SCSumit Chaudhary
Sumit Chaudhary
BGBaskar Ganapathysubramanian
Baskar Ganapathysubramanian

20 October 2013 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
AAAlbert Angel
Albert Angel
NKNick Koudas
Nick Koudas
NSNikos Sarkas
Nikos Sarkas
DSDivesh Srivastava
Divesh Srivastava
MSMichael Svendsen
Michael Svendsen
STSrikanta Tirthapura
Srikanta Tirthapura

27 October 2013
Verified
Conference Paper
Open access
PDF file
KTKanat Tangwongsan
Kanat Tangwongsan
APA. Pavan
A. Pavan
STSrikanta Tirthapura
Srikanta Tirthapura

1 April 2008
Verified
Conference Paper
Closed access
GCGraham Cormode
Graham Cormode
FKFlip Korn
Flip Korn
STSrikanta Tirthapura
Srikanta Tirthapura
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than older ones. It is important to compute various aggregates over such streams after applying a decay function which assigns weights to tuples based on their age. We focus on the computation of exponentially decayed aggregates in the form of quantiles and heavy hitters. Our techniques are based on extending existing data stream summaries, such as the q-digest [1] and the "space- saving" algorithm [2]. Our experiments confirm that our methods can be applied in practice, and have similar space and time costs to the non-decayed aggregate computation.