1,293 Hits in 2.2 sec

Semantic query processing in object-oriented databases using deductive approach

S. C. Yoon, I. Y. Song, E. K. Park
1995 Proceedings of the fourth international conference on Information and knowledge management - CIKM '95  
During the semantic reformulation step, we receive a user's query, select the set of relevant semantic knowledge in a query context, and transform the query with associated semantic knowledge into another  ...  To our knowledge, there is no significant research that has been done about semantic query optimization in object-oriented databases using deductive approach.  ...  In a deductive database, there Our approach consists of three steps: rule generation, semantic knowledge compilation, and semantic reformulation.  ... 
doi:10.1145/221270.221365 dblp:conf/cikm/YoonSP95 fatcat:f5qeo36g5jgbhfblumggqbiycy


1993 International Journal of Cooperative Information Systems  
This work is implemented in a system called SIMS and has been tested in a transportation planning domain using nine Oracle databases and a Loom knowledge base.  ...  Work in multidatabase systems has begun to address this problem, but it has primarily focused on methods for communicating between databases and requires signi cant e ort for each new database added to  ...  Thanks also to the LIM project for providing us with the databases and the database models used for our work, as well many sample queries.  ... 
doi:10.1142/s0218215793000071 fatcat:xo4svaeaqjgarjsn76xgx5w3d4


1996 International Journal of Cooperative Information Systems  
Query reformulation is made difficult by the variety of semantic knowledge that is used to describe the MDBMS.  ...  It is general enough to re-use the results of previously computed queries in the MDBMS.  ...  The control of this algorithm is similar to semi-naive evaluation, in deductive databases [Ullman88] .  ... 
doi:10.1142/s0218843096000166 fatcat:gyh7todizrcghcyehlxaahvh5y

Towards Top-k Query Answering in Deductive Databases

Umberto Straccia
2006 2006 IEEE International Conference on Systems, Man and Cybernetics  
In this paper we address a novel issue for deductive databases with huge data repositories, namely the problem of evaluating ranked top-k queries.  ...  The problem occurs whenever we allow queries such as "find cheap hotels close to the conference location" in which fuzzy predicates like cheap and close occur.  ...  A query associates to each input database over a given schema (vocabulary) a result consisting of one or more output relations. Queries are formulated in query languages. Deductive databases (cf.  ... 
doi:10.1109/icsmc.2006.385077 dblp:conf/smc/Straccia06 fatcat:esh75xln5vefdnz36hut33teru

Experimenting Data Integration with DIS@DIS [chapter]

Andrea Calì, Domenico Lembo, Riccardo Rosati, Marco Ruzzi
2004 Lecture Notes in Computer Science  
In this paper we present DIS@DIS, a data integration system that adopts innovative techniques for query answering in a complex integration environment.  ...  DIS@DIS incorporates novel optimization techniques for query processing, which speed up query answering time even in the presence of complex global schemata and large amounts of data.  ...  The reformulated query is then evaluated over the RGDB by means of the deductive database system DLV [9] . team(X, Y ) ← s 2 (X, Y ) Consider a source database D with (s 1 ) D = { figo, realMadrid, 31  ... 
doi:10.1007/978-3-540-25975-6_6 fatcat:cttvqylnmvb35i4phpkoumkwiy


Thomas Eiter, Domenico Lembo
2005 Journal of Applied Logic  
The talks of the workshop have addressed several crucial aspects in information integration, such as integration of semistructured data, logic-based query reformulation, consistent query answering, and  ...  For example, such methods are helpful in giving formal semantics to data integration, in comparing the expressiveness of approaches, as well as in computation and establishing properties of data integration  ...  Basically, proposed solutions amount to reformulating the constraints and the query into a logic program using negation and disjunction which is run under the cautious stable model semantics.  ... 
doi:10.1016/j.jal.2004.07.019 fatcat:szwziitwobhzxbyyz263mh436e

Semantic Update Optimization in Active Databases [chapter]

Jong P. Yoon, Larry Kerschberg
1997 IFIP Advances in Information and Communication Technology  
In an active database, an update may be constrained by integrity constraints, and may also trigger rules that, in turn, may a ect the database state.  ...  Thus, a user-speci ed update" is transformed, through semantic reformulation techniques, into a sequence of updates which together ensure semantic integrity of the original update as well as its propagated  ...  Therefore, the semantic update reformulation framework can 23 be used to optimize queries semantically LHQ91 .  ... 
doi:10.1007/978-0-387-34913-8_12 fatcat:qrqroqirnnewjicpwdi7mss2h4

Using domain knowledge in knowledge discovery

Suk-Chung Yoon, Lawrence J. Henschen, E. K. Park, Sam Makki
1999 Proceedings of the eighth international conference on Information and knowledge management - CIKM '99  
Previous work on semantic query optimization, which is an approach to take advantage of domain knowledge for query optimization, has demonstrated that significant cost reduction can be achieved by reformulating  ...  With the explosive growth of the size of databases, many knowledge discovery applications deal with large quantities of data.  ...  There have been some interesting studies on semantic query optimization in relational and deductive databases. King [ll] describes an algorithm which uses a set of transformation heuristics.  ... 
doi:10.1145/319950.320008 dblp:conf/cikm/YoonHPM99 fatcat:zxuqgonkfnfprhhbj7h7qfa7lu

ConceptBase ? A deductive object base for meta data management

Matthias Jarke, Rainer Gallersd�rfer, Manfred A. Jeusfeld, Martin Staudt, Stefan Eherer
1995 Journal of Intelligent Information Systems  
General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications  ...  purpose of private study or research -You may not further distribute the material or use it for any profit-making activity or commercial gain -You may freely distribute the URL identifying the publication in  ...  The deductive capabilities of ConceptBase are used to classify the created objects on their voting. The following query de nes ideas which h a ve both pro and counter votes.  ... 
doi:10.1007/bf00961873 fatcat:gnfo4kqimncyjovojhlyyzv3dm

Query classes [chapter]

Martin Staudt, Matthias Jarke, Manfred A. Jeusfeld, Hans W. Nissen
1993 Lecture Notes in Computer Science  
The interpretation is based on a deductive database view of queries. Generic query classes are introduced with a simple parameter substitution construct.  ...  Deductive object-oriented databases advocate the advantage of combining object-oriented and deductive paradigms into a single data model.  ...  The deduction rule form of queries not only provides a clean semantics but also a whole array of algorithms for evaluation and optimization known from the deductive database area 10].  ... 
doi:10.1007/3-540-57530-8_18 fatcat:jq63ztqn5va7verouef7jxh4e4

Feature-based reformulation of entities in triple pattern queries [article]

Amar Viswanathan, Geeth de Mel, James A.Hendler
2018 arXiv   pre-print
Typically, the semantics of such queries are often crisp thereby resulting in crisp answers.  ...  Once the features are identified, the entity in concern is reformulated as a set of features.  ...  Instead of using the term rewriting of queries, they proposed the term relaxation for deductive databases and logic programming queries.  ... 
arXiv:1807.01801v1 fatcat:wdtjiluig5cp7j4737ju4yajhu

Information Integration and Computational Logic [article]

Yannis Dimopoulos, Antonis Kakas
2001 arXiv   pre-print
Information from disparate heterogeneous sources often with no a-priori common schema needs to be synthesized in a flexible, transparent and intelligent way in order to respond to the demands of a query  ...  It stands at the crossroad of Databases and Artificial Intelligence requiring novel techniques that bring together different methods from these fields.  ...  Mimmo Sacca, the coordinator of Compulog-Net for the area Logic-based Databases, has helped in collecting material and in forming the structure of this survey.  ... 
arXiv:cs/0106025v1 fatcat:u275rpw5i5c3xg7jjn636y53um

Teaching an RDBMS about ontological constraints

Damian Bursztyn, François Goasdoué, Ioana Manolescu
2016 Proceedings of the VLDB Endowment  
In the presence of an ontology, query answers must reflect not only data explicitly present in the database, but also implicit data, which holds due to the ontology, even though it is not present in the  ...  Our framework is based on searching within a set of alternative equivalent FOL queries, i.e., FOL reformulations, one with minimal evaluation cost when evaluated through a relational database system.  ...  We thank Guy Lohman for his insights on cost-based optimization in DB2, and Mario Briggs and Priya Ranjan Sahoo for help with DB2's RDF store [9] .  ... 
doi:10.14778/2994509.2994532 fatcat:4juqitidrfappbz2uu37nxjeqq

Page 557 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
approach for schema evolution and versioning in object-oriented databases (1048-1062); Stefan Brass, SLDMagic—the real magic (with ap- plications to web queries) (1063-1077).  ...  Marcelo Arenas, Leopoldo Bertossi and Michael Kifer, Ap- plications of annotated predicate calculus to querying inconsis- tent databases (926-941); Alexander Celle and Leopoldo Bertossi, Querying inconsistent  ... 

Page 9238 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
, Dino (I-PISA-IF; Pisa); Zaniolo, Carlo (1-UCLA-C; Los Angeles, CA) Semantics and expressive power of nondeterministic constructs in deductive databases.  ...  reformulation of first-order logic).  ... 
« Previous Showing results 1 — 15 out of 1,293 results