A database for storage and fast retrieval of structure data: A demonstration

被引：1

作者：

Kumar, S ^{[1
]}

Srinivasa, S ^{[1
]}

机构：

[1] CL Infotech Pvt Ltd, Bangalore 560095, Karnataka, India

来源：

19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 2003年

关键词：

D O I：

10.1109/ICDE.2003.1260869

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This demonstration presents a database system called GRACE for storage and retrieval of graph structures. Structural queries are supported which retrieve graphs based on approximate subgraph isomorphism. Since subgraph isomorphism is NP-complete, GRACE performs retrieval based on inexact graph matching. The underlying model is of a concept called "Vectorization of Structure" that represents structural features of member graphs as vectors in one or more hypothetical spaces. Queries are mapped onto regions in these spaces. Query results is a ranked union of the set of all points lying in the query regions. The implementation displays a GRACE model implemented for storage and retrieval of molecular structures of organic chemicals.

引用

页码：789 / 791

页数：3