Results 1 - 10 of 93

Semantic Query Optimization Techniques in Deductive Databases

by Instructor Professor, Anthony J. Kusalik, Mohammad Ashrafuzzaman , 1996
"... Integrity constraints play important role in checking database update validity. Although not needed for answering queries, integrity constraints can be exploited to optimize the query processing in a database system. The process of using semantic knowledge of a database, expressed in the form of int ..."
Abstract - Add to MetaCart
of integrity constraints, to transform a query into a semantically equivalent but possibly more efficient and less expensive one, is called semantic query optimization. In this paper we survey the techniques proposed to semantically optimize queries in deductive databases. The survey covers most

On Semantic Query Optimization In Deductive Databases

by Laks Lakshmanan, R. Missaoui - In Proc. IEEE International Conference on Data Engineering , 1992
"... The focus of this paper is semantic query optimization in the presence of integrity constraints (ICs) such as inclusion dependencies (INDs) and context dependencies (CDs). INDs are well known to arise naturally in many applications. CDs, introduced earlier in a different context, can capture natural ..."
Abstract - Cited by 16 (1 self) - Add to MetaCart
efficient algorithms for semantic query optimization using them. The contributions of this paper are sufficient conditions and algorithms for the detection of redundant atoms and rules in a class of linear recursive programs, arising in deductive databases. We take a program transformation approach

An Approach On Semantic Query Optimization For Deductive Databases

by Adrian Onet , 2003
"... In this article we present a learning method to obtain rules for the semantic query optimization in deductive databases. Semantic query optimization can dramatically speed up deductive database query answering by knowledge intensive reformulation. We will present a learning method for rules that wil ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
In this article we present a learning method to obtain rules for the semantic query optimization in deductive databases. Semantic query optimization can dramatically speed up deductive database query answering by knowledge intensive reformulation. We will present a learning method for rules

Query Optimization in Deductive Object Bases

by Manfred Jeusfeld, Martin Staudt , 1993
"... 1 . Deductive object bases are extended database systems which amalgamate structural object-orientation with logical specification. Queries in such a system are regarded both as classes and as deduction rules. Besides a general architecture for query processing in deductive object bases, two sp ..."
Abstract - Cited by 18 (6 self) - Add to MetaCart
1 . Deductive object bases are extended database systems which amalgamate structural object-orientation with logical specification. Queries in such a system are regarded both as classes and as deduction rules. Besides a general architecture for query processing in deductive object bases, two

Semantic Query Optimization in Deductive Object-Oriented Databases

by Jong P. Yoon Y, Larry Kerschberg Z
"... Abstract. This paper addresses the problem of semantic query reformulation in the context of object-oriented deductive databases. It extends the declarative object-oriented speci cations of F-logic proposed by Kifer and Lausen using the semantic query optimization technique developed by Chakravarthy ..."
Abstract - Add to MetaCart
Abstract. This paper addresses the problem of semantic query reformulation in the context of object-oriented deductive databases. It extends the declarative object-oriented speci cations of F-logic proposed by Kifer and Lausen using the semantic query optimization technique developed

Semantics, Consistency and Query Processing of Empirical Deductive Databases

by Raymond T. Ng - IEEE Trans. Knowl. Data Eng , 1997
"... In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far are either non-probabilistic in nature or based on subjective probabilities. In this paper, we address the problem of incorporati ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
develop consistency-preserving ways to optimize the algorithm for practical usage. Finally, we show how query answering for empirical deductive databases can be carried out. Keywords: deductive databases, empirical probabilities, model semantics, constraint satisfaction, optimizations, query answering

Semantic Improvement of Deductive Databases

by Beat Wüthrich, Such That Q , 1991
"... We assume that there is a deductive database hD; Ci, where D is a set of stratified rules and facts and C a set of constraints. Querying a database means returning all ground instances of the query which are true in the well defined standard model MD induced by D. Given a query Q it is transformed i ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We assume that there is a deductive database hD; Ci, where D is a set of stratified rules and facts and C a set of constraints. Querying a database means returning all ground instances of the query which are true in the well defined standard model MD induced by D. Given a query Q it is transformed

Query evaluation and optimization in the semantic web

by Edna Ruckhaus, Eduardo Ruiz, María-esther Vidal - In ALPSWS2006 Workshop , 2006
"... Abstract. We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology’s inference axioms and facts, and we present a cost-based query optimization technique for DOB. A hybrid cost ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Abstract. We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology’s inference axioms and facts, and we present a cost-based query optimization technique for DOB. A hybrid

Structural Query Optimization --- A Uniform Framework For Semantic Query Optimization In Deductive Databases

by Laks Lakshmanan, H'ector J. Hern , 1991
"... this paper we propose the factoring technique as a general technique which can detect opportunities for making the recursion less "intensive". For example, this technique can detect that certain subgoals need only be examined a bounded number of times in certain subtrees of the proof trees ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
trees of the query predicate. More precisely, given a program and a query predicate (the recursive predicate), the factoring technique can determine when it is possible to limit the number of occurrences of a subgoal in selected subtrees of the proof trees of the query predicate. We call this property

Knowledge Discovery in Databases: An Attribute-Oriented Approach

by Jiawei Han , Yandong Cai, Nick Cercone , 1992
"... Knowledge discovery in databases, or data mining, is an important issue in the development of data- and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a machine learning paradigm, especially learning-from- ..."
Abstract - Cited by 176 (15 self) - Add to MetaCart
relational and deductive databases. Learning can also be performed with databases containing noisy data and exceptional cases using database statistics. Furthermore, the rules discovered can be used to query database knowledge, answer cooperative queries and facilitate semantic query optimization. Based upon
Results 1 - 10 of 93