日本データベース学会会員の皆様： お茶の水女子大学の渡辺と申します。 7月26日〜28日に開催されますiDBワークショップ内の企画として 海外で活躍されている研究者による講演会を行います。 どなたでも参加可能で参加費は無料です。ぜひお申し込みのほど よろしくお願いいたします。 ====================================================================== iDBワークショップ2009講演会 主催: 日本データベース学会，情報処理学会データベースシステム研究会 電子情報通信学会データ工学研究会 ====================================================================== 日時: 2009年7月27日 13:00〜17:00 （iDBワークショップ2009内イベント） 会場: 神戸ファッションマート (http://www.kfm.or.jp/) 住所: 〒658-0032 神戸市東灘区向洋町中6丁目9番地 会場へのアクセス: http://www.kfm.or.jp/accessmap.html 参加費: 無料 参加登録: 登録フォーム（http://tinyurl.com/nrg9uo）よりお願いいたします。 （当日の会場準備における人数把握のためご協力をお願いいたします） 7月26日から28日にかけて神戸ファッションマートで開かれますiDBワークショッ プ2009にて，データベースおよびデータ工学分野で世界的に活躍されている著 名海外研究者による講演会を開催致します．参加登録，参加費は無料です．ぜ ひ奮ってご参加いただけますようよろしくお願い致します． なお，7月28日には情報処理学会データベースシステム研究会・情報学基礎研究 会および電子情報通信学会データ工学研究会が開催されます．各研究会への参 加を予定されている皆様、ぜひこちらの講演にも参加をご検討ください． ■講演会プログラム (13:00〜17:00) 1. Time Travel with Main-Memory Database Prof. Sang Kyun Cha (Seoul National University, SAP R&D Center Korea) 2. Keyword Search in Databases: The Power of RDBMS Prof. Jeffrey Xu Yu (Chinese University of Hong Kong, China) Break (20 min.) 3. Spatiotemporal Query Processing: What's New and What's Hot Prof. Xiaofang Zhou (University of Queensland, Australia) 4. Information Access Evaluation: Some Recent Topics Dr. Tetsuya Sakai (Microsoft Research Asia, China) ■講演概要 1. Time Travel with Main-Memory Database Prof. Sang Kyun Cha (Seoul National University, SAP R&D Center Korea) (TBA) 2. Keyword Search in Databases: The Power of RDBMS Prof. Jeffrey Xu Yu (Chinese University of Hong Kong, China) Abstract: Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMSs. In brief, it finds how the tuples containing the given keywords are connected via sequences of connections (foreign key references) among tuples in an RDB. Such interconnected tuple structures can be found as connected trees up to a certain size, sets of tuples that are reachable from a root tuple within a radius, or even multi-center subgraphs within a radius. In the literature, there are two main approaches. One is to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. Due to a large number of relational algebra expressions needed to process, most of the existing works take a middleware approach without fully utilizing RDBMSs. The other is to materialize an RDB as a graph and find the interconnected tuple structures using graph-based algorithms in memory. In this talk we focus on using SQL to compute all the interconnected tuple structures for a given keyword query. We show that the current commercial RDBMSs are powerful enough to support such keyword queries in RDBs efficiently without any additional new indexing to be built and maintained. 3. Spatiotemporal Query Processing: What's New and What's Hot Prof. Xiaofang Zhou (University of Queensland, Australia) Abstract: Spatiotemporal query processing becomes an active research area again in recent years, driven by not only intellectually challenging research issues related to performance, scalability and uncertainty emerging from many new applications, but also the wide spread adoption of positioning devices, location-based services and high quality digital maps. In this talk, we will present an overview of this research field, followed by discussions of our recent work in motion pattern discovery, pattern-based movement predication (ICDE'08), convey detection (VLDB'08) and path-based nearest neighbor monitoring (SIGMOD'09). The aim of this talk is to share with the researchers in this area our new results, and also to provide an introduction for those who are new to this area. 4. Information Access Evaluation: Some Recent Topics Dr. Tetsuya Sakai (Microsoft Research Asia, China) Abstract: This talk will briefly touch upon various aspects of information access evaluation, including: - New information retrieval metrics; - New problems in information access evaluation, e.g. incompleteness of relevance assessments; - How to evaluate evaluation metrics and test collections; - New information access tasks, e.g., IR4QA at NTCIR, exploratory search etc.; - The gap between laboratory experiments and the real world; - The gap between academia and industry.