全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Search Algorithms for Conceptual Graph Databases

Keywords: Conceptual Graph , Graph Homomorphism , Partial Order , Lattice , Search , Database

Full-Text   Cite this paper   Add to My Lib

Abstract:

We consider a database composed of a set of conceptual graphs. Using conceptual graphs and graphhomomorphism it is possible to build a basic query-answering mechanism based on semantic search.Graph homomorphism defines a partial order over conceptual graphs. Since graph homomorphismchecking is an NP-Complete problem, the main requirement for database organizing and managingalgorithms is to reduce the number of homomorphism checks. Searching is a basic operation for databasemanipulating problems. We consider the problem of searching for an element in a partially ordered set.The goal is to minimize the number of queries required to find a target element in the worst case. First weanalyse conceptual graph database operations. Then we propose a new algorithm for a subclass of lattices.Finally, we suggest a parallel search algorithm for a general poset.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133