SANGEETHA SESHADRI |
|
RESEARCH INTERESTS
Architectures for high-availability, Query optimization, Distributed data stream systems,
Discovering and searching Deep-Web Data Sources.
EDUCATION
Ph.D student, College of Computing
Georgia Institute of Technology,
Atlanta, USA (expected May 2009)
Current Grade Point Average: 3.94/4.0
Master of Science (Hons) Mathematics
Birla Institute of Science and Technology, Pilani, India (1997-2002)
Degree Grade Point Average: 3.61/4.0
Bachelor of Engineering (Hons) Computer Science
Birla Institute of Science and Technology, Pilani, India (1997-2002)
Degree Grade Point Average: 3.61/4.0
RESEARCH AND PROFESSIONAL EXPERIENCE
Research Assistant at the College of Computing, Georgia Tech. (August
2004 onwards)
Senior Applications Engineer, Oracle Corporation- IDC,
Hyderabad, India (July 2002- July 2004)
Member of the Oracle Exchange development team,
responsible for online Catalog, Spot Purchase and XML transactions modules of
this B2B product.
Intern, Motorola Inc.,
Bangalore, India (Jan 2002 - Jun 2002)
Involved in design and coding of Resource parser for ENTITE (ENhanced Tool for Integrated Test Execution)
PUBLICATIONS
[1] Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper, Vibhore Kumar, Ling Liu, Karsten Schwan and Gong Zhang (in alphabetical order), "Grouping Distributed Stream Query Services by Operator Similarity and Network Locality", To Appear In the Proceedings of IEEE Congress on Services 2008 (SCC 2008), Honolulu, Hawaii, USA, July 2008.
[2] Bhuvan Bamba, Sangeetha Seshadri and Ling Liu "Scaling Location-based
Services with Dynamically Composed Location Index", To Appear In the Proceedings of IEEE International Conference on Services Computing (SCC 2008), Honolulu, Hawaii, USA, July 2008.
[3] Sangeetha Seshadri, Lawrence Chiu, Cornel Constantinescu, Subhashini Balachandran, Clem Dickey and Ling Liu. Enhancing Storage System Availability on Multi-Core Architectures with Recovery-Conscious Scheduling. To Appear in the 6th USENIX Conference on File and Storage Technologies (FAST'08).
[4] Sangeetha Seshadri, Lawrence Chiu, Karan Gupta, Paul Muench, Ling Liu and Brian F. Cooper. A Fault-Tolerant Middleware Architecture for High-Availability Storage Services. IEEE International Conference on Services Computing (SCC) 2007.
[5] Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper and Ling Liu. Optimizing Multiple Queries in Distributed Stream Systems Using Hierarchical Network Partitions. IEEE International Parallel & Distributed Processing Symposium (IPDPS) 2007.
[6] Sangeetha Seshadri and Brian F. Cooper. Routing queries through a peer-to-peer InfoBeacons network using information retrieval techniques. IEEE Transactions on Parallel and Distributed Systems (TPDS), 18(12): 1754-1765, 2007.
[7] Vibhore Kumar, Brian F. Cooper, Greg Eisenhauer, Srihari Govindharaj, Chaitanya Karlekar, Mohamed Mansour, Karsten Schwan, Sangeetha Seshadri, Balasubramanian Seshasayee. Policy-Driven Autonomic Management in Enterprise-Scale Information Flows. 4th IEEE International Conference on Autonomic Computing ICAC-2007. (Demo)
[8] Sangeetha Seshadri, Vibhore Kumar and Brian F. Cooper. Optimizing Multiple Queries in Distributed Data Stream Systems. 2nd IEEE International Workshop on Networking Meets Database (NetDB), in conjunction with ICDE 2006.
[9] Sangeetha Seshadri, Brian F. Cooper, Ling Liu. CubeCache: Efficient and Scalable Processing of OLAP Aggregation Queries in a Peer-to-Peer Network. CERCS Technical Report. GIT-CERCS-07-12, 2005.
[10] Sangeetha Seshadri, Ling Liu, Lawrence Chiu and Cornel Constantinescu. A Recovery Conscious Framework for Fault Resilient Storage Systems. CERCS Technical Report. GIT-CERCS-08-04, 2008.
PATENTS
[1] "Improving the Availability and Reliability of Scale Out Storage with Hierarchical Clusters" L. Chiu, K. Gupta, P. Muench, S. Seshadri. Disclosure submitted on 09/05/2006. Patent in progress.
RESEARCH PROJECTS
InfoBeacons: Guiding Users to Internet Information Sources
(Aug 2004 onwards)
-with
Prof. Brian Cooper, Georgia Tech
The Internet provides a wealth of useful information in a vast number of dynamic information sources, but it is difficult to determine which sources are useful for a given query. Most existing techniques either require explicit source cooperation (for example, by exporting data summaries),
or build a relatively static source characterization (for example, by assigning a topic to the source). We present a system, called InfoBeacons that takes a
different approach: data and sources are left 'as is', and a peer-to-peer network of beacons uses past query results to guide queries to sources, who do the actual query processing. This approach has several advantages, including
requiring minimal changes to sources, tolerance of dynamism and heterogeneity, and the ability to scale to large numbers of sources. We present the
architecture of the system, and discuss the advantages of our design. We then focus on how a beacon can choose good sources for a query despite the loose
coupling of beacons to sources. Beacons cache responses to previous queries and adapt the cache to changes at the source. The cache is then used to select good
sources for future queries. We discuss results from a detailed experimental study using our beacon prototype which demonstrates that our loosely coupled approach is effective; a beacon only has to contact sixty percent or less of the
sources contacted by existing, tightly coupled approaches, while providing results of equivalent or better relevance to queries.
Clustering Models for High-Availability in Scale-out Storage Systems (May 2005 - Aug 2005)
- Scale-out Storage Systems Group, IBM Almaden Research Center, San Jose, CA.
Worked on the design and analysis of clustering
models for high-availability in scale-out storage systems. Analyzed flat and
hierarchical clustering models focusing on system availability, complexity and
scalability. Clustering is an obvious solution for maximizing availability and
performance and balancing load in storage systems. Most often,
high-availability and reliability is achieved through redundancy at software,
hardware and network levels. However, as system components increase only
linearly, the system.s state space increases exponentially, thereby making it
very difficult to test and verify the system. Potentially, these systems are
more prone to failures arising from software defects that escape undetected
during testing and are also difficult to reproduce. In this project we
investigate the trade-offs between system complexity and availability from the
perspective of clustered storage systems. We evaluate designs and policies
that help us maximize availability while minimizing the number of
system-states.
CubeCache: Semantic Caching in Peer-to-Peer OLAP Networks (Aug 2004 onwards)
- with Prof. Ling Liu, Prof. Brian Cooper, Georgia Tech
Peer-to-peer systems are an area of much recent activity due to their cost-effectiveness, scalability and ability to distribute the overhead of sharing and
storing data and performing computations. These characteristics make such systems ideal for OLAP query processing. In this project, we describe the framework for a
system that utilizes a peer-to-peer network to efficiently process OLAP queries. Specifically, we consider the problem of searching for data in such a network and
present techniques to locate data and perform query processing with load balancing.
Undergraduate Thesis: Study & Simulation of MPLS over ATM network
(Jul 2001 - Dec 2001)
- with Prof.T.S.B.Sudarshan, BITS,Pilani
Multi protocol lambda switching uses the Multi
protocol label switching paradigm, of forwarding packets based on their labels
(which they obtain on entering an MPLS network and is thereafter used to make
the forwarding decision on the packet) with the wavelengths (lambda) of packets
in an optical network. The OXCs (Optical-Crossconnects) make a forwarding
decision based on the packets wavelength. As part of thesis work, Multi
protocol lambda switching was simulated on a small network and the lambda
switching mechanism and its performance studied and improvements suggested to
the existing mode.
Fragile Watermarking
(Jan 2001 - Jun 2001)
- with Prof.Rahul Banerjee, BITS,Pilani
Proposed and implemented an algorithm for fragile
watermarking for data authentication. The watermark being a highly sensitive one
breaks even on the slightest alteration of the data and can be used at the other
end to detect if the data has been tampered with. Display was part of the annual
exhibition conducted by the computer science department which won the best
exhibition award.
SOFTWARE SKILLS
Proficient in C/C++, Java, JDBC, Java Servlets, PL/SQL, Visual Java, Shell
Programming, Lex, Yacc and Socket Programming.
PROFESSIONAL ACTIVITIES/AWARDS
- IBM Ph.D Scholarship 2007-2008
- Recipient of the K.C.Mahindra scholarship for doctoral studies
- Stood 3rd in the class of M.Sc Mathematics
- Awarded University Scholarship for all semesters of study
- Coordinator, Department of Mathematics, Apogee 2000
REFERENCES
Available on request.