Search: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, a, Rahm, E, 2002, uni-leipzig.de, 1000s

user warning: Data too long for column 'link' at row 1 query: INSERT INTO watchdog (uid, type, message, variables, severity, link, location, referer, hostname, timestamp) VALUES (0, 'faceted_search', '%text.', 'a:1:{s:5:\"%text\";s:133:\"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 a field_author:\"Rahm, E\" field_year:2002 taxonomy:434.446 field_citations_range:\"1000s\"\";}', 5, '<a href=\"/se/pubs/results/0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%20a%20field_author%3A%22Rahm%2C%20E%22%20field_year%3A2002%20taxonomy%3A434.446%20field_citations_range%3A%221000s%22\" class=\"active\">results</a>', 'http://pubs.dbs.uni-leipzig.de/se/pubs/results/0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%20a%20field_author:%22Rahm,%20E%22%20field_year:2002%20taxonomy:434.446%20field_citations_range:%221000s%22', '', '172.17.0.129', 1730071795) in /home/pubs/htdocs_pubs/modules/dblog/dblog.module on line 146.
1 result

Results

Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching

... elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across ...

Publication - admin - 04/16/2013 - 20:16 - 0 comments - 1 attachment