{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.0008695652173913044, 'mean_word_length': 4.813131313131313, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Querying RDF Data Using Dynamic Concise Bounded Description

Along with the development of semantic Web, available RDF data are increasing at a fast pace. How to store and query large amount of RDF data becomes an important issue of the semantic Web. In this paper, we first discuss the usage of concise bounded description (CBD). As an improvement, we define dynamic concise bounded description (DCBD) which is a general and dynamic version of CBD. We also propose a query language for RDF called DCBDQuery. DCBDQuery is used for constituting DCBD and finding meaningful reachable path or shortest path with respect to DCBD. Then we discuss an alternative approach for storing RDF data into relational database, called updated schema-aware representation. We store RDF data into database using this representation, and then create graph in main memory from internal link statements. The DCBDQuery query engine is designed to access a hybrid data model of the database and the graph in main memory. We also implement the DCBDQuery query engine to access Jena2. We demonstrate the efficiency of our approach by experiment using the RDF data of DBLP++.