|
A Concept-Based Query Language Not Using Proper Relation Names |
|
Vladimir Ovchinnikov
|
|
maandag, 13 juni 2005 |
The paper is focused on a concept-based query language that permits querying by using only application domain concepts. The query language has features making it simple and transparent for end-users: each query operation is completely defined by its result signature and nested operation’s signatures; a query’s signature represents an unordered set of application domain concepts; join predicates are not to be specified in an explicit form. In addition, the paper introduces constructions of closures and contexts as applied to the language. The constructions permit querying some indirectly associated concepts as if they are associated directly and adopting queries to users’ needs without rewriting.
[PDF]
[BibteX]
Alleen geregistreerde gebruikers kunnen reacties geven. Log in of registreer. |