Indexing Tree Structures through Caterpillar Decomposition
Graphs provide effective data structures modeling complex relations and schemaless data such as images, XML documents, circuits, compounds, and proteins. Given a query graph, efficiently finding all database graphs in which the query is a subgraph is an important problem raising in different domains. In this paper, we propose a new method for indexing tree structures based on a graph-theoretic concept called caterpillar decomposition and discuss its advantages over two previous indexing algorithms. Experimental evaluation of the proposed framework including the comparison with the previous approaches demonstrates the efficacy of the overall approach.
Keywordsshape retrieval indexing caterpillar decomposition
- 5.Gupta, A.: Embedding tree metrics into low dimensional euclidean spaces. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 694–700. ACM, New York (1999)Google Scholar
- 8.Shasha, D., Wang, J., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Madison, Wisconsin, pp. 39–52. ACM, New York (2002)Google Scholar
- 9.Shilane, P., Min, P., Kazhdan, M., Funkhouser, T.: The princeton shape benchmark. In: Proceedings of the Shape Modeling International, pp. 167–178. IEEE Computer Society, Washington, DC, USA (2004)Google Scholar