2026-04-30T20:22:09Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4939 2022-03-24T23:13:48Z 1582963302567:1597824273898 user-ucsy

Graph Indexing and Querying Using Fingerprint of Discriminative Frequent Fragments Hlaing, Yu Wai Oo, Kyaw May Graphs are widely used to model complexstructured data. Given a graph query, it is desirableto retrieve graphs quickly from a large database viagraph-based indices. In this paper, we propose agraph indexing and querying model based ondiscriminative frequent fragments and fingerprint ofthese fragments. There are two main steps: indexconstruction and query processing. In indexconstruction phase, edge dictionary is used tosimplify the process and to generate ids of graphedges. To reduce the size of index structure, twotechniques, size-increasing support constraint anddiscriminative fragments are used. Canonical codesare then constructed based on discriminative frequentfragments. Then DB fingerprint is built based oncodes. In query processing phase, query graph isparsed and canonical codes are constructed. Query’scodes and DB fingerprint’s codes are compared toget candidate answer set. Finally, candidate answerset is verified to ensure the query graph reallycontains in it or not by performing simple subgraphisomorphism test on each graph one by one. 2014-02-17 http://hdl.handle.net/20.500.12678/0000004939 https://meral.edu.mm/records/4939