2004
DOI: 10.1023/b:jiis.0000012467.66268.9e
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Recursive Information Gathering Plans in EMERAC

Abstract: Abstract. In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information gathering plan by removing redundant and overlapping information sources without loss of completeness. We then discuss a set of heuristics that guide the greedy minimization algorithm so as to remove costlier information sources first. In contrast to previous work, our approach can handle recursive query plans that aris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2004
2004
2011
2011

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(16 citation statements)
references
References 27 publications
0
16
0
Order By: Relevance
“…The lack of forward propagation rules involving base predicates (and not just sources) makes the discovery of potential interactions between base predicates (and thus the full use of domain knowledge) impossible. Other related mediator-based Web integration systems are EMERAC [13] and Ariadne [15]. This paper extends our research related to the SILK intelligent information environment [3] to deal with the specificities of the Semantic Web.…”
Section: Discussionmentioning
confidence: 57%
“…The lack of forward propagation rules involving base predicates (and not just sources) makes the discovery of potential interactions between base predicates (and thus the full use of domain knowledge) impossible. Other related mediator-based Web integration systems are EMERAC [13] and Ariadne [15]. This paper extends our research related to the SILK intelligent information environment [3] to deal with the specificities of the Semantic Web.…”
Section: Discussionmentioning
confidence: 57%
“…Kambhampati et al [13] describe an optimization technique that checks the constraints in the source descriptions and the constraint in the user query to remove all sources that have constraints that conflict with the constraints in the user query. For example consider a data source that provides road vector data for the bounding box ' [[25,-74],[27,-76]]'.…”
Section: Previous Work: View Integrationmentioning
confidence: 99%
“…Utilize the optimization techniques described in [13] to remove rules containing unnecessary source requests.…”
Section: Qgm's Extensions To Exploit Qualitymentioning
confidence: 99%
“…Obviously this requires resolving the schematic and semantic heterogeneity among the sources. The task of providing a common interface over sources has been the focus of research done in the context of data mediation (integration) systems [9,3,15,11,12]. Data integration systems combine multiple data sources such that they appear as a single (virtually) integrated source projecting a single global schema.…”
Section: Motivationmentioning
confidence: 99%