Filters








12,808 Hits in 3.1 sec

Supporting Semantic Search on Heterogeneous Semi-structured Documents [chapter]

Yassine Mrabet, Nacéra Bennacer, Nathalie Pernelle, Mouhamadou Thiam
2010 Lecture Notes in Computer Science  
Experiments on two real datasets show that these reformulations greatly increase the recall and that returned answers are effectively ranked according to their precision.  ...  This paper presents SHIRI-Querying 3 , an approach for semantic search on semi-structured documents.  ...  However, each data source has a different and specific structuring and the DREQ reformulations were able to integrate answers from all sources.  ... 
doi:10.1007/978-3-642-13094-6_18 fatcat:4iirnbsbfvdktfmrngwmsomh54

RETRIEVING AND INTEGRATING DATA FROM MULTIPLE INFORMATION SOURCES

YIGAL ARENS, CHIN Y. CHEE, CHUN-NAN HSU, CRAIG A. KNOBLOCK
1993 International Journal of Cooperative Information Systems  
This paper describes a more general approach that exploits a semantic model of a problem domain to integrate the information from various information sources.  ...  With the current explosion of data, retrieving and integrating information from various sources is a critical problem.  ...  In contrast with syntactic query optimization, w h i c h h a s been widely studied in the database community, QUIST uses the rules of semantic integrity constraint of the database as background knowledge  ... 
doi:10.1142/s0218215793000071 fatcat:xo4svaeaqjgarjsn76xgx5w3d4

A METHODOLOGY FOR QUERY REFORMULATION IN CIS USING SEMANTIC KNOWLEDGE

DANIELA FLORESCU, LOUIQA RASCHID, PATRICK VALDURIEZ
1996 International Journal of Cooperative Information Systems  
We present a reformulation algorithm which exploits semantic knowledge, represented as integrity assertions and mapping rules, for semantic rewriting based on pattern-matching.  ...  The MDBMS interface could be different from the union of the local interfaces, and may include views of particular local databases, integrity constraints, and knowledge about data replication in local  ...  However, we support more general integrity constraints on object types. These integrity constraints play an important role in query reformulation.  ... 
doi:10.1142/s0218843096000166 fatcat:gyh7todizrcghcyehlxaahvh5y

Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation

Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura
2016 Synthesis Lectures on Data Management  
Many practical problems in data management can be seen as instances of the reformulation problem.  ...  We will review the theory of interpolation, and explain its close connection with query reformulation.  ...  For each type of reformulation we will isolate a semantic property that any input query Q must have with respect to the target language and integrity constraints in order for the desired reformulation  ... 
doi:10.2200/s00703ed1v01y201602dtm043 fatcat:pjmzooijszezfaedsqgrpidt6m

Facilitating Multimedia Database Exploration through Visual Interfaces and Perpetual Query Reformulations

Wen-Syan Li, K. Selçuk Candan, Kyoji Hirata, Yoshinori Hara
1997 Very Large Data Bases Conference  
Since multimedia retrieval is based on similarity calculations of semantics and media-based search, exact matches are not expected.  ...  The contribution of this work is the integration of database methodology, user interface design, IR concepts, and image matching techniques for facilitating multimedia database exploration.  ...  This task includes computing overall similarity values and eliminating images baaed on specified filtering constraints. 2.2 Query Language CSQL (Cognition and Semantics Query Language) is the underlying  ... 
dblp:conf/vldb/LiCHH97 fatcat:syy5rv5uyrco5krmw36loirjqm

From bioinformatic web portals to semantically integrated Data Grid networks

Adriana Budura, Philippe Cudré-Mauroux, Karl Aberer
2007 Future generations computer systems  
We propose a semi-automated method for redeploying bioinformatic databases indexed in a Web portal as a decentralized, semantically integrated and service-oriented Data Grid.  ...  Finally, we propose data models for redeploying all instances, schemas and schema mappings in the Data Grid, relying on standard Semantic Web technologies.  ...  Semantic interoperability emerges gradually as peers use local semantic agreements to reformulate and propagate queries through the network.  ... 
doi:10.1016/j.future.2006.03.002 fatcat:wurmyanqnzhwtemxk3alqne4w4

Query Reformulation for Dynamic Information Integration [chapter]

Yigal Arens, Craig A. Knoblock, Wei-Min Shen
1996 Intelligent Integration of Information  
We p r o vide precise de nitions of the reformulation operators and explain the rationale behind choosing the speci c ones SIMS uses.  ...  The problem is that schema integration is usually di cult, and as soon as any of the information sources change or a new source is added, the process may h a ve to be repeated.  ...  All of the reformulation operators are semantics preserving, so the nal query and every intermediate query will have the same semantics as the original query.  ... 
doi:10.1007/978-1-4613-0467-8_2 fatcat:eszwk4j5k5furmzwcmkkvh3zru

Query reformulation for dynamic information integration

Yigal Arens, Craig A. Knoblock, Wei-Min Shen
1996 Journal of Intelligent Information Systems  
We p r o vide precise de nitions of the reformulation operators and explain the rationale behind choosing the speci c ones SIMS uses.  ...  The problem is that schema integration is usually di cult, and as soon as any of the information sources change or a new source is added, the process may h a ve to be repeated.  ...  All of the reformulation operators are semantics preserving, so the nal query and every intermediate query will have the same semantics as the original query.  ... 
doi:10.1007/bf00122124 fatcat:aouslqkzxrbf7jjmebaftinzla

Queries, the Missing Link in Automatic Data Integration

Aibo Tian, Juan F. Sequeda, Daniel P. Miranker
2012 International Semantic Web Conference  
This approach simplifies query reformulation. The system achieves favorable results when compared to the algorithms developed for Clio, the best automated relational data integration system.  ...  This paper introduces the ontology mapping approach of a system that automatically integrates data sources into an ontology-based data integration system (OBDI).  ...  These constraints limit the search problem to a manageable size. Consider the specific SPARQL query in Fig. 2(c ).  ... 
dblp:conf/semweb/TianSM12 fatcat:funa67ltivgi5fdjltz44mt5py

Learning symbolic formulations in design: Syntax, semantics, and knowledge reification

Somwrita Sarkar, Andy Dong, John S. Gero
2010 Artificial intelligence for engineering design, analysis and manufacturing  
Problem reformulation in design is concerned with the metamorphosis of design semantics into a formal mathematical model.  ...  To address these limitations, we present a singular value decomposition (SVD) and unsupervised clustering based method that performs design reformulation by acquiring semantic knowledge from the syntax  ...  The method correctly identifies semantic groupings of variables and constraints within design cases.  ... 
doi:10.1017/s0890060409990175 fatcat:jyqqnq2r7fekxleknlhnpv2osm

Transforming Mathematical Models Using Declarative Reformulation Rules [chapter]

Antonio Frangioni, Luis Perez Sanchez
2011 Lecture Notes in Computer Science  
These rules are not problem-specific, and could be used to reformulate many other problems, thus showing that a general-purpose reformulation system based on the ideas developed in [15] could be feasible  ...  Reformulation is one of the most useful and widespread activities in mathematical modeling, in that finding a "good" formulation is a fundamental step in being able so solve a given problem.  ...  We could define a similar reformulation to integrate several d LP C into a single d LP C.  ... 
doi:10.1007/978-3-642-25566-3_30 fatcat:3jebvp3qfzchnoudslq3eiy5jq

Design of Query Reformulation Engine in Data Access and Integration System

Xiyin Liu, Lijun Cao, Zhongping Zhang
2016 International Journal of Database Theory and Application  
This paper introduces three core modules of query reformulation engine, mapping document, query reformulation module, and statement conversion module.  ...  The query reformulation module reformulates the query statements submitted by users to local data resource to query statements to all data sources that have mapping relationship with local data resource  ...  XML Schema of Schema Mapping Document radix constraints.  ... 
doi:10.14257/ijdta.2016.9.4.26 fatcat:4gqpxios5fcdxbz727yhia7gwm

Anatomy of the Unified Enterprise Modelling Ontology [chapter]

Andreas L. Opdahl
2011 Lecture Notes in Business Information Processing  
A central part of this hub is an extendible ontology into which modelling languages and their constructs can be mapped, so that precise semantic relations between the languages and constructs can be established  ...  The paper presents and discusses ongoing work on reformulating the UEML ontology as an OWL2 DL ontology, the Unified Enterprise Modelling Ontology (UEMO).  ...  Whereas the idea of using an ontology to describe and integrate modelling languages is not new in itself, UEML describes and integrates the semantics of modelling constructs in a novel way that combines  ... 
doi:10.1007/978-3-642-19680-5_14 fatcat:5pnet54tfjgdrgwt3lwowqd7di

Complete yet practical search for minimal query reformulations under constraints

Ioana Ileana, Bogdan Cautis, Alin Deutsch, Yannis Katsis
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
We revisit the Chase&Backchase (C&B) algorithm for query reformulation under constraints, which provides a uniform solution to such particular-case problems as view-based rewriting under constraints, semantic  ...  For an important class of queries and constraints, C&B has been shown to be complete, i.e. guaranteed to find all (join-)minimal reformulations under constraints.  ...  Examples including integrity constraints are given in Section 5. Reformulation. We write D |= C if a database instance D satisfies all the constraints in a set C.  ... 
doi:10.1145/2588555.2593683 dblp:conf/sigmod/IleanaCDK14 fatcat:hwh4ticpbjca7j6nxz6r4fh4pu

Context-aware search personalization with concept preference

Di Jiang, Kenneth Wai-Ting Leung, Wilfred Ng
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
The search context consists of both the user's clickthroughs and query reformulations that satisfy some specific information need, which is able to provide more information than each individual query in  ...  Although these two queries are semantically related, reformulation types in Single Reformulation are too strict to capture them.  ...  Preference Derivation by Query Reformulation Query reformulation reflects the semantic relation between two consecutive queries.  ... 
doi:10.1145/2063576.2063661 dblp:conf/cikm/JiangLN11 fatcat:preizain5zfd5mqj75kapdrj24
« Previous Showing results 1 — 15 out of 12,808 results