Efficient Evaluation of Reachable Node Queries and Updates for Metadata Databases
Ishikawa Kenichi, Atsuyuki Morishima, Keishi Tajima · 2007
The recent development of information sharing technologies and the advances of various digital devices make a large amount of metadata generated and accumulated. Therefore, how to manage such metadata is an important problem. Edge-labeled graphs, such as RDF graphs, are one of the major formats for metadata. This paper focuses on the problem of the efficient processing of reachable node queries against edge-labeled graphs. The problem has a wide range of applications, including computing all of the subclasses of a given class with its sub-class relationships. This paper proposes techniques for storing, querying, and updating metadata for the efficient execution of reachable node queries.