Sciweavers

213 search results - page 7 / 43
» Querying Partially Sound and Complete Data Sources
Sort
View
IDEAS
1999
IEEE
101views Database» more  IDEAS 1999»
13 years 11 months ago
Integration of Semistructured Data with Partial and Inconsistent Information
Data integration of several sources has gained considerable attentions with the recent popularity of the Web. In the real world, some information may be missing i.e., partial and ...
Mengchi Liu, Tok Wang Ling, Tao Guan
SEMWEB
2010
Springer
13 years 5 months ago
Linked Data Query Processing Strategies
Abstract. Recently, processing of queries on linked data has gained attention. We identify and systematically discuss three main strategies: a bottom-up strategy that discovers new...
Günter Ladwig, Thanh Tran
AIMSA
2010
Springer
13 years 9 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
CIKM
2010
Springer
13 years 5 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 9 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...