Processing of Path Queries on Trees and DAGs.

Date of Submission

December 2005

Date of Award

Winter 12-12-2006

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Computer and Statistical Services Centre (CSSC)


Bagchi, Aditya (CSSC-Kolkata; ISI)

Abstract (Summary of the Work)

Given a large graph, stored on disk, there is often need to perform a search over this graph. Such, a need could arise, for example, in the search component of a data-intensive expert system or to solve path problems in deductive database systems or simply, to search on the web-graph. In this dissertation, we present a novel graph compression and data structuring technique on the compressed graph and show that the search algorithms can use this data structure to prune the search space, thereby improving the efliciency. We advocate the use of labeling scheme proposed by H.V.Jagadish [1] combined with our data-structure, for modeling this type of graphs in-order to efficiently answer the queries such as ancestors, descendants, and least common ancestors which usually require costly transitive closure computations. We also provide algorithms for finding all common ancestors, all common descendants and all paths between any two given nodes.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.