次世代パーソナル情報管理システムにおけるデータモデル・検索に関する研究

下一代个人信息管理系统中的数据模型和搜索研究

• 批准号: 20500107
• 负责人: PRADHAN SujeetR
• 金额: $ 2.83万
• 依托单位: Kurashiki University of Science and the Arts
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2008
• 资助国家: 日本
• 起止时间: 2008 至 2010
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-20500107/
• 关键词: パーソナル情報データベース; 検索結果単位; 代数的な検索モデル; 問い合わせ処理最適化; ランキング演算; 同期化メディア; 2次元データモデル; デスクトップサーチ; 検索モデル; 代数的なモデル; 質問最適化; 検索単位

In recent years, there has been growing interest in keyword search over traditional relational databases. Usually a relational database is represented as a graph structure; an appropriate subgraph is computed as an answer to a keyword query. In these studies, the units of query results is based on the concept of 'minimality', that is, each answer subgraph is the smallest subgraph containing each query keyword. However, the concept ofminimality' cannot be applied to keyword search over a graph representing heterogeneous information in a personal information management system. It is because an appropriate answer is not necessarily a subgraph comprising the nodes having at least one occurrence of each query. As a result, further expansion of the concept of 'minimality' needs to be need to be considered. In this research, we proposed the concept of "beyond minimality" for computing answer units in keyword search over a graph representing heterogeneous information. We also explored algebrai … More c operations to generate such answer units.In a traditional information retrieval system, it is common to rank search result in a descending order of relevance. In other words, search result, rather than just a collection of elements, is a ranked list type. Thus, as query result in a traditional database system is a simple collection of tuple elements, query optimization is achieved through various strategies---one of them being the manipulation of algebraic operations. However, it is obvious that the similar kind of optimization cannot be guaranteed in keyword search over a personal information management system.Electronic textbooks and PowerPoint slides which refer to those textbooks have specific characteristics in a personal information management system. Such data can be categorized as a special kind of synchronized media streams can contain additional temporal information. In order to efficiently and effectively find information in a large collection of synchronized media streams, we have proposed a data model that represents information in a two-dimensional space. This space can be manipulated by our query processor. Less

近年来，人们对关键词搜索的兴趣超过了传统的关系数据库。通常关系数据库被表示为图结构；计算适当的子图作为关键字查询的答案。在这些研究中，查询结果的单位基于“最小性”的概念，即每个答案子图是包含每个查询关键词的最小子图。然而，“极小性”的概念不能应用于在个人信息管理系统中表示异构信息的图上的关键字搜索。这是因为适当的答案不一定是包含每个查询至少出现一次的节点的子图。因此，需要考虑进一步扩展“最小化”概念。在这项研究中，我们提出了“超越极简”的概念，用于在表示异构信息的图上计算关键字搜索中的答案单元。我们还探索了代数运算来生成这样的答案单元。 在传统的信息检索系统中，通常按相关性降序对搜索结果进行排名。换句话说，搜索结果不仅仅是元素的集合，而是排名列表类型。因此，由于传统数据库系统中的查询结果是元组元素的简单集合，因此查询优化是通过各种策略来实现的——其中之一就是代数运算的操作。然而，显然在个人信息管理系统上的关键字搜索中不能保证类似的优化。电子教科书和引用这些教科书的PowerPoint幻灯片在个人信息管理系统中具有特定的特征。此类数据可以归类为特殊类型的同步媒体流，可以包含附加的时间信息。为了高效且有效地在大量同步媒体流集合中查找信息，我们提出了一种在二维空间中表示信息的数据模型。这个空间可以由我们的查询处理器来操纵。较少的

项目成果

Two-Dimensional Retrieval in Synchronized Media Streams

同步媒体流中的二维检索

• 发表时间: 2009
• 期刊: Proceedings of Database Systems for Advanced Applications(Springer)
• 作者: Sujeet Pradhan;Nimit Pattanasri
• 通讯作者: Nimit Pattanasri

Towards an integrated framework for querying collection of heterogeneous data

构建用于查询异构数据集合的集成框架

• 发表时间: 2009
• 期刊: ACM Publication on Ubiquitous Information Management and Communication (CD-ROM)
• 作者: 小宮山哲;藤野猛士;小山嘉紀;劉渤江;横田一正;Sujeet Pradhan
• 通讯作者: Sujeet Pradhan

ホームページ等。

主页等

A General Query Model for Keyword Queries : Hopes and Challenges

关键字查询的通用查询模型：希望与挑战

• 发表时间: 2008
• 作者: M.Ito;K.Nakayama;T.Hara;S.Nishio;Sujeet Pradhan;SUJEET PRADHAN
• 通讯作者: SUJEET PRADHAN