Sciweavers

74 search results - page 8 / 15
» Data correspondence, exchange and repair
Sort
View
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
EHCI
2001
13 years 9 months ago
Information Sharing with Handheld Appliances
Handheld appliances such as PDAs, organisers or electronic pens are currently very popular. Handhelds are used to enter and retrieve useful information, e.g., dates, to do lists, m...
Jörg Roth
MOBIHOC
2004
ACM
14 years 7 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
OTM
2007
Springer
14 years 1 months ago
Query Expansion and Interpretation to Go Beyond Semantic P2P Interoperability
Abstract. In P2P data management systems, semantic interoperability between any two peers that do not share the same ontology relyes on ontology matching. The established correspon...
Anthony Ventresque, Sylvie Cazalens, Philippe Lama...
CIKM
2005
Springer
14 years 1 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia