max planck institut
informatik

Srikanta Bedathur

---

Max-Planck Institute for Computer Science Campus E1 4 66123 Saarbruecken Germany Email: bedathur (at) mpi-inf.mpg.de

---

NOTE I *will not* answer mails about internship/Masters/Ph.D. positions. Here's why: Our group no longer has 2-3 month internship positions. If you are a Ph.D. student, or looking for more than 5 months internship, say it in the subject of the mail. Otherwise, I delete all internship requests. For Masters/Ph.D. admissions, look at IMPRS-CS website, or Saarland University Graduate School website. I don't have any information.

NEW!

I am co-organizing the 2nd M3SN workshop on Modeling, Managing, and Mining Evolving Social Networks (colocated with ICDE'10). For details on the earlier edition of the workshop, please check out website. Watch for the new website details.

Research Interests

• Web Archives: collection, search, and analysis
• Web Search and Link Analysis
• Text mining
• Caching and Replication in P2P Systems
• Data Management issues in Biology

---

Teaching

• Winter 2007-08 -- Seminar "The Future of Web Search" (with Ralf Schenkel).

---

Publications

My MPI Publications, My DBLP Entry

Journal Articles

1. The Building of BODHI, a Bio-diversity Database System
   Srikanta Bedathur, Jayant Haritsa and Udaysankar Sen
   Special Issue of Information Systems, vol. 28, no. 4, 2003.
   
   

Conference & Workshop Publications

2010



21. Interesting-Phrase Mining for Ad-hoc Text Analytics
    Srikanta Bedathur, Klaus Berberich, Jens Dittrich, Nikos Mamoulis and Gerhard Weikum
    in JDMR (formerly Proc. VLDB) 2010 (to appear).



2009



20. Towards Time-aware Link Prediction in Evolving Social Networks
    Tomasz Tylenda, Ralitsa Angelova and Srikanta Bedathur
    in SNA-KDD 2009.
19. Bridging the Terminology Gap in Web Archive Search
    Klaus Berberich, Srikanta Bedathur, Mauro Sozio and Gerhard Weikum
    in WebDB 2009.
18. EverLast: A Distributed Architecture for Preserving the Web
    Avishek Anand, Srikanta Bedathur, Klaus Berberich, Ralf Schenkel, Christos Tryfonopoulos
    in ACM-JCDL 2009.
17. Time will Tell: Leveraging Temporal Expressions in IR
    Irem Arikan, Srikanta Bedathur and Klaus Berberich
    in Late-breaking results track of WSDM 2009.



2008



16. Tunable Word-level Index Compression for Versioned Corpora
    Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    in Efficiency Issues in Information Retrieval workshop (co-located with ECIR) 2008.
    
15. Flood Little, Cache More: Effective Result-reuse in P2P IR Systems
    Christian Zimmer, Srikanta Bedathur and Gerhard Weikum
    in DASFAA 2008.
    



2007



14. Exploiting Replication in Peer-to-Peer Search over Distributed Digital Libraries
    Christian Zimmer, Srikanta Bedathur, Christos Tryfonopoulos and Gerhard Weikum
    in 2nd DELOS Conf. on Digital Libraries 2007.
    
13. Standing on the Shoulders of Peers: Caching in Peer-to-Peer Information Retrieval (poster)
    Christian Zimmer, Srikanta Bedathur and Gerhard Weikum
    in DBISP2P 2007 (co-located with VLDB 2007).
    
12. A Pocket Guide to Web History
    Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    in SPIRE 2007.
    
11. FluxCapacitor: Efficient Time-Travel Text Search (Demonstration proposal)
    Klaus Berberich, Srikanta Bedathur, Thomas Neumann and Gerhard Weikum
    in VLDB 2007.
    
10. EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
    Julia Stoyanovich, Srikanta Bedathur, Klaus Berberich and Gerhard Weikum
    in WebDB 2007.
    
9. A Time Machine for Text Search
   Klaus Berberich, Srikanta Bedathur, Thomas Neumann and Gerhard Weikum
   in SIGIR 2007 . PDF
   Techreport version
   
8. Comparing Apples and Oranges: Normalized PageRank for Evolving Graphs
   Klaus Berberich, Srikanta Bedathur, Michalis Vazirgiannis and Gerhard Weikum
   Proc. of WWW 2007
   
7. Efficient Time-travel on Versioned Text Collections
   Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
   Proc. of BTW 2007.
   



2006



6. Rank Synopses for Efficient Time Travel on the Web Graph
   Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
   Proc. of CIKM 2006.
   
5. BuzzRank ... and the Trend is your Friend
   Klaus Berberich, Srikanta Bedathur, Michalis Vazirgiannis and Gerhard Weikum
   Proc. of WWW 2006.
   



2005



4. Search-Optimized Persistent Suffix-tree Storage for Biological Applications(PDF)
   Srikanta Bedathur and Jayant Haritsa
   Proc. of 12th IEEE Intl. Conf. on High Performance Computing (HiPC), 2005.
   



2004



3. BODHI : A Database Habitat for Bio-diversity Information (demo) (PDF)
   Srikanta Bedathur, Abhijit Kadlag and Jayant Haritsa
   Proc. of ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD), 2004.
   
2. Engineering a Fast Online Persistent Suffix Tree Construction (PDF)
   Srikanta Bedathur and Jayant Haritsa
   Proc. of 20th IEEE Intl. Conf. on Data Engineering (ICDE), 2004.
   



2000



1. Design and Implementation of a Biodiversity Information Management System (ps.gz)
   Srikanta Bedathur and Jayant Haritsa
   Proc. of 10th Intl. Conf. on Management of Data (COMAD), 2000.
   (won Best Paper award)
   

---

Professional Activities

• Co-organizer of
  • 1st International Workshop on M3SN - Modeling, Managing and Mining of Evolving Social Networks. Co-located with ICDE'09.
  • 2nd International Workshop on M3SN - Modeling, Managing and Mining of Evolving Social Networks. Co-located with ICDE 2010.
• Program Committe member of
  • COMAD'08, COMAD'09.
  • Demonstrations track of VLDB'09
  • Posters track of WWW'09
  • Developers track of WWW'09
  • WWW'2010
• Reviewer for VLDB Journal, IEEE TKDE, IEEE TPDS, Information Processing Letters, IEEE Trans. on Systems,Man and Cybernetics - Part B.
• External reviewer for ICDE'08, WWW'07/'08, VLDB'02/'03/'04/'06, EDBT'06, SIGMOD'04/'06/'07, WebDB'03, PAKDD'01, DASFAA'01.

---

Software

1. Persistent Suffix-tree Construction through Ukkonen's Algorithm - Version 1.0
   Provides self-contained buffer management and persistent storage management modules. Also implements the high performing TOPQ algorithm for buffer management (for details refer to my paper "Engineering a Fast Online Persistent Suffix Tree Construction" that appeared in ICDE 2004).
   Note on efficiency: This code release is NOT speed-optimized. Please contact me if you need one.

unpublished

• A Product Line Architecture for Word-of-Mouth Social Software
  M. Bharath Kumar and Srikanta Bedathur
  IISc-CSA-TR-2004-11, Dept. of Computer Science & Automation, Indian Institute of Science, 2004.
  This was part of the MetaVines Project, started out of realization that each of us were spending far too much time discovering the same stuff over and over again on the Web, and it would be more interesting if we could use the community intelligence to reduce those extra hours we "wasted" in front of the browser :-)

---

Personal Photo Gallery

1. Pragnya - Day 1
2. Pragnya - Month 1

---

My 30 Boxes Travel Dates get organized with 30 Boxes!

Saarbrucken Weather Today

Last modified: Mon Mar 9 10:50 W. Europe Standard Time 2009

Copyright 2005 by Max-Planck-Institut Informatik | Impressum
page last modified Saturday, 14 November 2009 - 22:14