Decoration
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

Srikanta Bedathur

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

Starting March 2011, I am joining the faculty of IIIT-D.

NOTE Please consult D5 Internships for all details regarding internship application process

Research Interests

Teaching

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


    2011


  1. Temporal Index Sharding for Space-Time Efficiency in Archive Search
    Avishek Anand, Srikanta Bedathur, Klaus Berberich and Ralf Schenkel
    in SIGIR 2011.

    2010


  2. Bonsai: Growing Interesting Small Trees
    Stephan Seufert, Srikanta Bedathur, Julián Mestre and Gerhard Weikum
    in IEEE Conference on Data Mining (ICDM) 2010.
    Techreport version
  3. Time-based Exploration of News Archives
    Omar Alonso, Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    in HCIR (colocated with IIiX) 2010.
  4. Efficient Temporal Keyword Queries over Versioned Text
    Avishek Anand, Srikanta Bedathur, Klaus Berberich, Ralf Schenkel
    in CIKM 2010.
    Techreport version
  5. Fast and Accurate Estimation of Shortest Paths in Large Graphs
    Andrey Gubichev, Srikanta Bedathur, Stephan Seufert, Gerhard Weikum
    in CIKM 2010.
  6. InZeit: Efficiently Identifying Insightful Time Points (Demonstration)
    Vinay Setty, Srikanta Bedathur, Klaus Berberich, and Gerhard Weikum
    in VLDB 2010.
  7. ANTOURAGE: Mining Distance-constrained Trips from Flickr (poster)
    Saral Jain, Stephan Seufert, and Srikanta Bedathur
    in WWW 2010.
  8. Durable Top-K Search in Document Archives
    Leong Hou U, Nikos Mamoulis, Klaus Berberich, and Srikanta Bedathur
    in SIGMOD 2010.
  9. A Language Modeling Approach for Temporal Information Needs
    Klaus Berberich, Srikanta Bedathur, Omar Alonso, and Gerhard Weikum
    in ECIR 2010.
    Techreport version
  10. NEAT : News Exploration Along Time (Demonstration)
    Omar Alonso, Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    in ECIR 2010.
  11. 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.
    Techreport version

    12. 2009


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

    16. 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.
  17. Flood Little, Cache More: Effective Result-reuse in P2P IR Systems
    Christian Zimmer, Srikanta Bedathur and Gerhard Weikum
    in DASFAA 2008.

    18. 2007


  18. 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.
  19. 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).
  20. A Pocket Guide to Web History
    Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    in SPIRE 2007.
  21. FluxCapacitor: Efficient Time-Travel Text Search (Demonstration proposal)
    Klaus Berberich, Srikanta Bedathur, Thomas Neumann and Gerhard Weikum
    in VLDB 2007.
  22. EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
    Julia Stoyanovich, Srikanta Bedathur, Klaus Berberich and Gerhard Weikum
    in WebDB 2007.
  23. A Time Machine for Text Search
    Klaus Berberich, Srikanta Bedathur, Thomas Neumann and Gerhard Weikum
    in SIGIR 2007 . PDF
    Techreport version
  24. Comparing Apples and Oranges: Normalized PageRank for Evolving Graphs
    Klaus Berberich, Srikanta Bedathur, Michalis Vazirgiannis and Gerhard Weikum
    Proc. of WWW 2007
  25. Efficient Time-travel on Versioned Text Collections
    Klaus Berberich, Srikanta Bedathur and Gerhard Weikum
    Proc. of BTW 2007.

    26. 2006


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

    28. 2005


  28. 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.

    29. 2004


  29. 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.
  30. 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.

    31. 2000


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

Professional Activities

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


Last modified: Mon Oct 4 10:07:58 CEST 2010