.png){kind=icon}
Return
ADVANCED QUERY FORMULATION IN DEDUCTIVE DATABASES
.png){kind=icon}
PRE
AI
DOI：10.1016/0306-4573(92)90045-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A novel operation-oriented framework for deductive databases is introduced. Several types of end-user queries to deductive databases are classified, and sample queries are used to demonstrate how they can be expressed in our framework. The sample queries and their sample evaluations show essentially reduced user effort and essentially increased user capability in the expression of advanced queries in deductive databases. These are also necessary features in modern information retrieval from fact databases. We also establish criteria for advanced query formulation in deductive databases from the end-user viewpoint and analyze failures of conventional and present deductive DBMSs in meeting them.
Keywords:
KNOWLEDGE-BASED RETRIEVAL
DEDUCTIVE DATABASES
RELATIONAL DATABASES
KNOWLEDGE REPRESENTATION
INTEGRATION OF RECURSIVE AND NON-RECURSIVE PROCESSING
ENTITY TYPES AND INSTANCES
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSave no more
no more