Query model using a tree structure of metadata subsets for metadata-based databases
スポンサーリンク
概要
- 論文の詳細を見る
In metadata-based databases, stored information is identified by associated metadata. The more such data that is associated, the better the content can be uniquely described. However, a large number of types of metadata prevent users from specifying appropriate queries. In this paper, we present models for representing the metadata of a system to users that easier facilitates information retrieval, based on taking under consideration specific subsets of metadata and then arranging them in a tree structure with constraints. We implement the interface for a metadata-based database system using proposed models.
- 社団法人電子情報通信学会の論文
- 2006-07-07
著者
-
Karlsson Matthias
Department Of Computer Science Graduate School Of Information Science And Engineering Tokyo Institut
-
KOBAYASHI TAKASHI
Global Scientific Information and Computing Center, Tokyo Institute of Technology
-
YOKOTA HARUO
Global Scientific Information and Computing Center, Tokyo Institute of Technology
-
Yokota Haruo
Global Scientific Information And Computing Center Tokyo Institute Of Technology:department Of Compu
-
Yokota Haruo
Global Scientific Information And Computing Center Tokyo Institute Of Technology
-
Kobayashi Takashi
Global Scientific Information And Computing Center Tokyo Institute Of Technology
関連論文
- Query model using a tree structure of metadata subsets for metadata-based databases (夏のデータベースワークショップDBWS 2006)
- Query model using a tree structure of metadata subsets for metadata-based databases
- Supporting Application Framework Selection Based on Labeled Transition Systems(Knowledge-Based Software Engineering)
- Concurrency Control and Performance Evaluation of Parallel B-tree Structures(Regular Section)
- UPRISE : Unified Presentation Slide Retrieval by Impression Search Engine(Information Processing Technology for Web Utilization)