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++.
{"title":"Querying RDF Data Using Dynamic Concise Bounded Description","authors":"Xinpeng Zhang, M. Yoshikawa","doi":"10.1109/INGS.2008.7","DOIUrl":"https://doi.org/10.1109/INGS.2008.7","url":null,"abstract":"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++.","PeriodicalId":356148,"journal":{"name":"2008 International Workshop on Information-Explosion and Next Generation Search","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125915239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Fukuhara, A. Kimura, Y. Arai, Takayuki Yoshinaka, H. Masuda, T. Utsuro, Hiroshi Nakagawa
An architecture of cross-lingual concern analysis (CLCA) using multilingual blog articles, and its prototype system are described. As various people who are living in various countries use the Web, cross-lingual information retrieval (CLIR) plays an important role in the next generation search. In this paper, we propose a CLCA as one of CLIR applications for facilitating users to find concerns of people across languages. We propose a layer architecture of CLCA, and its prototype system called KANSHIN. The system collects Japanese, Chinese, Korean, and English blog articles, and analyzes concerns across languages. Users can find concerns from several viewpoints such as temporal, geographical, and a network of blog sites. The system also facilitates users to browse multilingual keywords using Wikipedia, and the system facilitates users to find spam blogs. An overview of the CLCA architecture and the system are described.
{"title":"KANSHIN: A Cross-Lingual Concern Analysis System Using Multilingual Blog Articles","authors":"T. Fukuhara, A. Kimura, Y. Arai, Takayuki Yoshinaka, H. Masuda, T. Utsuro, Hiroshi Nakagawa","doi":"10.1109/INGS.2008.20","DOIUrl":"https://doi.org/10.1109/INGS.2008.20","url":null,"abstract":"An architecture of cross-lingual concern analysis (CLCA) using multilingual blog articles, and its prototype system are described. As various people who are living in various countries use the Web, cross-lingual information retrieval (CLIR) plays an important role in the next generation search. In this paper, we propose a CLCA as one of CLIR applications for facilitating users to find concerns of people across languages. We propose a layer architecture of CLCA, and its prototype system called KANSHIN. The system collects Japanese, Chinese, Korean, and English blog articles, and analyzes concerns across languages. Users can find concerns from several viewpoints such as temporal, geographical, and a network of blog sites. The system also facilitates users to browse multilingual keywords using Wikipedia, and the system facilitates users to find spam blogs. An overview of the CLCA architecture and the system are described.","PeriodicalId":356148,"journal":{"name":"2008 International Workshop on Information-Explosion and Next Generation Search","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, video sharing sites that allow visitors to attach comments to video have attracted a lot of attention. Video also provides a means of communication on social network sites. This kind of communication is expected to become even more popular in the future. One problem is that discussion jumps from one topic to another as users add their viewpoints. Also, conventional video sharing sites show, unsorted, all of a particular user's attached comments. It is often difficult in such systems to identify and retrieve comments relevant to one's own interest. We have developed a method for determining comment relationship types on the basis of temporal duration and the pointing region. Our method can also be used for extracting comments related to other comments made by the user. In this paper we describe how our method classifies comment relationships and discuss our prototype system which uses the method.
{"title":"Organizing User Comments in a Social Video Sharing System by Temporal Duration and Pointing Region","authors":"D. Kitayama, N. Oda, K. Sumiya","doi":"10.1109/INGS.2008.19","DOIUrl":"https://doi.org/10.1109/INGS.2008.19","url":null,"abstract":"Recently, video sharing sites that allow visitors to attach comments to video have attracted a lot of attention. Video also provides a means of communication on social network sites. This kind of communication is expected to become even more popular in the future. One problem is that discussion jumps from one topic to another as users add their viewpoints. Also, conventional video sharing sites show, unsorted, all of a particular user's attached comments. It is often difficult in such systems to identify and retrieve comments relevant to one's own interest. We have developed a method for determining comment relationship types on the basis of temporal duration and the pointing region. Our method can also be used for extracting comments related to other comments made by the user. In this paper we describe how our method classifies comment relationships and discuss our prototype system which uses the method.","PeriodicalId":356148,"journal":{"name":"2008 International Workshop on Information-Explosion and Next Generation Search","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116055425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Grid system has facilitated large scale, flexible, distributed, secure and coordinated resource sharing. It aims to make full use of the network resources and build a harmonious collaborative community. However, resource management and quick resource location are still urgent problems for grid systems, especially under large, dynamic environment. This paper presents SIKA a grid-based overlay network for knowledge grid system. It groups the nodes into domain sensitive communities, but by defining new inter community organization mechanism, it successfully avoids using super peers. The main characteristics of this architecture are highlighted by its convenience for community analysis, promising scalability, itssearch efficiency, as well as its robustness. The experimental performance results presented here demonstrate the efficiency of the design.
{"title":"SIKA: A Decentralized Architecture for Knowledge Grid Resource Management","authors":"Rong Zhang, Koji Zettsu, Y. Kidawara","doi":"10.1109/INGS.2008.9","DOIUrl":"https://doi.org/10.1109/INGS.2008.9","url":null,"abstract":"Grid system has facilitated large scale, flexible, distributed, secure and coordinated resource sharing. It aims to make full use of the network resources and build a harmonious collaborative community. However, resource management and quick resource location are still urgent problems for grid systems, especially under large, dynamic environment. This paper presents SIKA a grid-based overlay network for knowledge grid system. It groups the nodes into domain sensitive communities, but by defining new inter community organization mechanism, it successfully avoids using super peers. The main characteristics of this architecture are highlighted by its convenience for community analysis, promising scalability, itssearch efficiency, as well as its robustness. The experimental performance results presented here demonstrate the efficiency of the design.","PeriodicalId":356148,"journal":{"name":"2008 International Workshop on Information-Explosion and Next Generation Search","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131724180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we will utilize patterns to query search engine in order to extract a large list of expressions and build their co-occurrence networks from the Web. Those expressions could be statistical terms like birth rates, events such as hurricanes, riots or facts as urbanization. Our method is based on specificities of the language in order to create patterns. Those patterns will help us to extract terms. The vast amount of available information, the power of search API engine like Yahoo or Google combined with our patterns allow us to extract with high accuracy expressions described above and find links between them.
{"title":"Global Dynamics Network Construction from the Web","authors":"T. Perrin, H. Kawai, K. Kunieda, K. Yamada","doi":"10.1109/INGS.2008.15","DOIUrl":"https://doi.org/10.1109/INGS.2008.15","url":null,"abstract":"In this paper, we will utilize patterns to query search engine in order to extract a large list of expressions and build their co-occurrence networks from the Web. Those expressions could be statistical terms like birth rates, events such as hurricanes, riots or facts as urbanization. Our method is based on specificities of the language in order to create patterns. Those patterns will help us to extract terms. The vast amount of available information, the power of search API engine like Yahoo or Google combined with our patterns allow us to extract with high accuracy expressions described above and find links between them.","PeriodicalId":356148,"journal":{"name":"2008 International Workshop on Information-Explosion and Next Generation Search","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125752397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：