Madhulika Mohanty

Publications, Reports and Thesis

In CEDAR, we order the authors by their last names. I have underlined my name for all the papers where I am the primary contributor.

NEW!  Nelly Barret, Tudor Enache, Ioana Manolescu, Madhulika Mohanty; Finding the PG schema of any (semi)structured dataset: a tale of graphs and abstraction. ICDEW 2024. 

NEW!  Oana Balalau, Nelly Barret, Simon Ebel, Théo Galizzi, Ioana Manolescu, Madhulika Mohanty. Graph lenses over any data: the ConnectionLens experience. ICDEW 2024. 

Nelly Barret, Simon Ebel, Théo Galizzi, Ioana Manolescu, Madhulika Mohanty; Exploration utilisateur de lacs de données très hétérogènes. EGC 2024 (Non-archival, poster). 

Nelly Barret, Simon Ebel, Théo Galizzi, Ioana Manolescu, Madhulika Mohanty; User-friendly exploration of highly heterogeneous data lakes. CoopIS 2023. Paper

Ioana Manolescu, Madhulika Mohanty; Full-Power Graph Querying: State of the Art and Challenges. (Tutorial) VLDB 2023. Paper, Webpage, Slides

Angelos-Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty; More power to SPARQL: From paths to trees. (Demo) BDA 2023 (Informal, Non-archival publication). 

S. Amer-Yahia, D. Agrawal, Y. Amsterdamer, S. S Bhowmick, A. Bonifati, R. Borovica-Gajic, J. Camacho-Rodríguez, B. Catania, P. K Chrysanthis, C. Curino, J. Darmont, G. Dobbie, A. El Abbadi, A. Floratou, J. Freire, A. Jindal, V. Kalogeraki, S. Maiyya, A. Meliou, M. Mohanty, B. Omidvar-Tehrani, F. Özcan, L. Peterfreund, W. Rahayu, S. Sadiq, S. Sellami, U. Sirin, W. Tan, B. Thuraisingham, Y. Tian, P. Tözün, G. Vargas-Solar, N. Yadwadkar, V. Zakhary, M. Zhang; Diversity, Equity and Inclusion Activities in Database Conferences: A 2022 Report. SIGMOD Record 2023. Paper

Angelos-Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty; More power to SPARQL: From paths to trees. (Demo) ESWC 2023. Paper

Angelos-Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty; Integrating Connection Search in Graph Queries. ICDE 2023. Code Paper Tech-Report 

Angelos-Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty; Integrating connection search in graph queries. BDA 2022 (Informal, Non-archival publication). Paper

Madhulika Mohanty; Scalable exhaustive connectivity search within graph queries. MaDICS Symposium 2022 (Non-archival poster). 

S. Amer-Yahia, Y. Amsterdamer, S. Bhowmick, A. Bonifati, P. Bonnet, R. Borovica-Gajic, B. Catania, T. Cerquitelli, S. Chiusano, P. Chrysanthis, C. Curino, J. Darmont, A. El Abbadi, A. Floratou, J. Freire, A. Jindal, V. Kalogeraki, G. Koutrika, A. Kumar, S. Maiyya, A. Meliou, M. Mohanty, F. Naumann, N. S. Noack, F. Özcan, L. Peterfreund, W. Rahayu, W. C. Tan, Y. Tian, P. Tözün, G. Vargas-Solar, N. Yadwadkar, M. Zhang; Diversity and Inclusion Activities in Database Conferences: A 2021 Report. SIGMOD Record 2022. Paper

Techniques for Effective Search and Retrieval over Knowledge Graphs. Madhulika Mohanty, Ph.D. Thesis 2020. Available Here.

Madhulika Mohanty, Maya Ramanath; Insta-Search: Towards Effective Exploration of Knowledge Graphs.(Demo) CIKM 2019. Code Paper

Madhulika Mohanty, Maya Ramanath, Mohamed Yahya, and Gerhard Weikum; Spec-QP: Speculative Query Planning for Joins over Knowledge Graphs. EDBT 2019. Code Paper

Madhulika Mohanty, Maya Ramanath; KlusTree: Clustering Answer Trees from Keyword Search on Graphs. CoDS-COMAD '18 Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2018. Code Paper

Under submission/preparation

Nelly Barret, Nikola Dobricic, Simon Ebel, Théo Galizzi, Ioana Manolescu, Madhulika Mohanty; ConnectionStudio: User-friendly Exploration of Highly Heterogeneous Data Lakes.

Ioana Manolescu, Madhulika Mohanty; Keyword Query Batch Evaluation on Graphs.

Oana Balalau, Ioana Manolescu, Madhulika Mohanty; YQA: Question-Answering Benchmark Dataset for YAGO4.

Projects

Batched Evaluation of Keyword Search Queries on Graphs [Sep 2022 - present]

This project involves developing efficient algorithms for evaluating a keyword query batch by exploiting the shared computations among the queries, while also ensuring completeness.

Aligning Knowledge Graphs for Question Answering applications [Feb 2021 - present]

This project involves aligning different Knowledge Graphs (KGs) for various applications involving Question Answering (QA). The core of this work involves aligning entities, predicates, and classes across various KGs using novel algorithmic strategies, NLP techniques, and user feedback.

Structured + Unstructured query support on graphs [Aug 2021 - present]

This work involves developing the semantics for an extension to GQL (a graph query language standard in development) that supports both structured and unstructured fragments. Further, we also propose an efficient algorithm for executing such queries with established completeness guarantees. Overall, this work generalises prior keyword-search algorithms on graphs and extends the expressive power of graph query languages. This work has been accepted for publication in ICDE 2023. A demo has been accepted for ESWC 2023. The prior versions of the work were also presented at BDA 2022 (non-archival, full paper) and MaDICS Symposium 2022 (non-archival, poster). 

Insta-Search: Towards Effective Exploration of Knowledge Graphs [Aug 2018 - present]

This is a web-based interface for facilitating exploration over Knowledge Graphs. The users are given autocomplete options, reformulation suggestions and instant feedback in the form of the expected number of answers and expected top answers. A prototype of this work has been published in CIKM 2019 and is available here.

Spec-QP: Speculative Query Planning for Joins over Knowledge Graphs [Jul 2015 - Oct 2018]

This project involved optimization of SPARQL queries with relaxations. We proposed a speculative approach to predict the requirement of relaxations and hence, prune them to reduce the runtimes and memory consumptions. This work got published in EDBT 2019 and is available here.

KlusTree: Clustering Answer Trees from Keyword Search on Graphs [Mar 2013 - Aug 2017]

Keyword search on graphs is supported by many algorithms. They return answer trees which are interconnections between the matching keyword nodes. This project focused on improving user experience by reducing redundant information. In order to achieve this, we proposed a new distance metric based on Language Models (LMs) to cluster answer trees conveying similar information together. This work got published in CoDS-COMAD 2018 and is available here.

Polarizer -- University Hack Day Project [Aug 2013]

Polarizer is a sentiment analysis engine developed as a part of HackU, Yahoo! annual University Hack Day. We had implemented peer-to-peer insult filtering and pro-con classification of user comments on online public debates. We also added the feature of ranking the comments and generating location based demographic sentiment heatmap using heatmap.js. Polarizer won first prize competing with 40 other teams.

Ontology Extraction by focused retrieval using the web as an Oracle -- M.Tech Thesis [Jan 2012 - May 2012]

This project involved building up of a domain ontology using Latent Semantic Indexing (LSI) and theme extraction techniques. The LSI discovers the concept and the term nodes. The theme extraction and clustering techniques have been used to extract relations. The final ontology is in the form of a bipartite graph.

Focused Web information retrieval for building a contextual knowledge base using statistical learning techniques -- Research Project [Jan 2011 - Dec 2011]

In this project, statistical learning techniques like incremental clustering (for document and word) and classification (for document and word) were used to retrieve web information for building a contextual knowledge base. The learning ensures that the web pages retrieved are relevant to the current focus which is defined by the seed words and seed sites.