ACM Home Page
Please provide us with feedback. Feedback
Querying database knowledge
Full text PdfPdf (1.28 MB)
Source International Conference on Management of Data archive
Proceedings of the 1990 ACM SIGMOD international conference on Management of data table of contents
Atlantic City, New Jersey, United States
Pages: 173 - 183  
Year of Publication: 1990
ISBN:0-89791-365-5
Also published in ...
Authors
Amihai Motro  Computer Science Department, University of Southern California, Los Angeles, CA
Qiuhui Yuan  Computer Science Department, University of Southern California, Los Angeles, CA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 28,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/93597.98727
What is a DOI?

ABSTRACT

The role of database knowledge is usually limited to the evaluation of data queries. In this paper we argue that when this knowledge is of substantial volume and complexity, there is genuine need to query this repository of information. Moreover, since users of the database may not be able to distinguish between information that is data and information that is knowledge, access to knowledge and data should be provided with a single, coherent instrument. We provide an informal review of various kinds of knowledge queries, with possible syntax and semantics. We then formalize a framework of knowledge-rich databases, and a simple query language consisting of a pair of retrieve and describe statements. The retrieve statement is for querying the data (it corresponds to the basic retrieval statement of various knowledge-rich database systems). The describe statement is for querying the knowledge. Essentially, it inquires about the meaning of a concept under specified circumstances. We provide algorithms for evaluating sound and finite knowledge answers to describe queries, and we demonstrate them with examples.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D Chlmentl, T O'Hare, RKnshnamurthy, S N aqvl, S Tsur, C West, and C Zamolo An overvmw of the LDL system Database Engzneerzng, 10(4) 52-62, Dec 1987
 
2
L Cholvy and R Demolombe Querymg a rule base In Proc 1st Int Conf" on Exper~ Database Systems (Charleston, SC, Apt 1-4), pp 365-371, 1986
 
3
 
4
 
5
J Mmker and J-M Nicolas On recurslve axioms in deductive databases Informa~zon Systems, 8(1) 1- 13, 1983
 
6
K Morns, J F Naughton, Y Saralya, J D Ullman, and A Van Gelder YAWNI (yet anothel window on NAILv) Database Engmeemng, 10(4) 28-43, Dec 1987
 
7
 
8
 
9
K Ramamohanarao, J Shepherd, I Balbln, G Port, L Nalsh, J Thom, and P Dart The NU- Prolog deductive database system Database Engineering, 10(4) 10-19, Dec 1987
 
10
R Ramnarayan and H Lu A data/knowledge base management system Database Engmeemng, 10(4) 44-51, Dec 1987
 
11
D Sacca, M Dlspmzen, A Mecchm, C Plzzutl, C Del Gracco, and P Naggar The advanced database environment of the KIWI system Database Eng~neemng, 10(4) 20-27, Dec 1987
 
12
C D Shum and R Muntz Imphctt replesentatmn for extensmnal answers In Proc 2rid Int Con/ on Expert Dalabase Systems (Tysons Cornel, VA, Apl 25-27), pp 257-273, 1988
 
13
 
14


Collaborative Colleagues:
Amihai Motro: colleagues
Qiuhui Yuan: colleagues