A Comparison of Two Database Partitioning Approaches that Support Taxonomy-Based Query Answering
Abstract
References
Index Terms
- A Comparison of Two Database Partitioning Approaches that Support Taxonomy-Based Query Answering
Recommendations
Query processing over object views of relational data
This paper presents an approach to object view management for relational databases. Such a view mechanism makes it possible for users to transparently work with data in a relational database as if it was stored in an object-oriented (OO) database. A ...
Query Interoperation Among Object-Oriented and Relational Databases
ICDE '95: Proceedings of the Eleventh International Conference on Data EngineeringWe develop an efficient algorithm for the query interoperation among existing heterogeneous object-oriented and relational databases. Our algorithm utilizes a canonical deductive database as a uniform representation of object-oriented schema and data. ...
Using a Relational Database to Support Explanation in a Knowledge-Based System
In knowledge-based system (KBS) applications where the number of facts in the knowledge base is very large, the amount of information that is needed for effective explanation support can become too voluminous to be stored in main memory. The authors ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
In-Cooperation
- Johannes Kepler University, Linz, Austria
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 53Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in