29 search results - page 5 / 6 » Effectiveness Bounds for Non-Exhaustive Schema Matching Syst... |
SEMWEB
2009
Springer
13 years 11 months ago
2009
Springer
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
HPDC
2003
IEEE
13 years 10 months ago
2003
IEEE
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
The Web has been rapidly “deepened” by myriad searchable databases online, where data are hidden behind query forms. Helping users query alternative “deep Web” sources in ...
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...