Holistic Schema Matching for Web Query Interfaces
One significant part of today’s Web is Web databases, which can dynamically provide information in response to user queries. To help users submit queries to different Web databases, the query interface matching problem needs to be addressed. To solve this problem, we propose a new complex schema mat...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 94 |
|---|---|
| container_issue | |
| container_start_page | 77 |
| container_title | |
| container_volume | |
| creator | Su, Weifeng Wang, Jiying Lochovsky, Frederick |
| description | One significant part of today’s Web is Web databases, which can dynamically provide information in response to user queries. To help users submit queries to different Web databases, the query interface matching problem needs to be addressed. To solve this problem, we propose a new complex schema matching approach, Holistic Schema Matching (HSM). By examining the query interfaces of real Web databases, we observe that attribute matchings can be discovered from attribute-occurrence patterns. For example, First Name often appears together with Last Name while it is rarely co-present with Author in the Books domain. Thus, we design a count-based greedy algorithm to identify which attributes are more likely to be matched in the query interfaces. In particular, HSM can identify both simple matching i.e., 1:1 matching, and complex matching, i.e., 1:n or m:n matching, between attributes. Our experiments show that HSM can discover both simple and complex matchings accurately and efficiently on real data sets. |
| doi_str_mv | 10.1007/11687238_8 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19152134</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19152134</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-ad56f4aa0c7178ec7e84aa9b93e0a15e4ebf3b53e338c9cb3a5ecc3562ac3bba3</originalsourceid><addsrcrecordid>eNpFkM1OwzAQhM2fRCm98AS5IHEJeLNxbB9RBRSpCCFAHK212bSBNqnscOjbE1QQcxmNvtEcRogzkJcgpb4CqIwu0DizJyZWG1SlxMJWYPfFCCqAHLG0B-LkD0h7KEYSZZFbXeKxmKT0IQchKKvMSMCsWzWpb0L2HJa8puyB-rBs2kVWdzF7Y589fXHcZvdtz7GmwOlUHNW0Sjz59bF4vb15mc7y-ePd_fR6nm8KMH1O76qqSyIZNGjDQbMZkvUWWRIoLtnX6BUyogk2eCTFIaCqCgroPeFYnO92N5QCrepIbWiS28RmTXHrwIIqAMuhd7HrpQG1C47Od91nciDdz2Xu_zL8BuRmWCo</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Holistic Schema Matching for Web Query Interfaces</title><source>Springer Books</source><creator>Su, Weifeng ; Wang, Jiying ; Lochovsky, Frederick</creator><contributor>Scholl, Marc H. ; Matthes, Florian ; Boehm, Klemens ; Schmidt, Joachim W. ; Boehm, Christian ; Ioannidis, Yannis ; Hatzopoulos, Mike ; Grust, Torsten ; Kemper, Alfons</contributor><creatorcontrib>Su, Weifeng ; Wang, Jiying ; Lochovsky, Frederick ; Scholl, Marc H. ; Matthes, Florian ; Boehm, Klemens ; Schmidt, Joachim W. ; Boehm, Christian ; Ioannidis, Yannis ; Hatzopoulos, Mike ; Grust, Torsten ; Kemper, Alfons</creatorcontrib><description>One significant part of today’s Web is Web databases, which can dynamically provide information in response to user queries. To help users submit queries to different Web databases, the query interface matching problem needs to be addressed. To solve this problem, we propose a new complex schema matching approach, Holistic Schema Matching (HSM). By examining the query interfaces of real Web databases, we observe that attribute matchings can be discovered from attribute-occurrence patterns. For example, First Name often appears together with Last Name while it is rarely co-present with Author in the Books domain. Thus, we design a count-based greedy algorithm to identify which attributes are more likely to be matched in the query interfaces. In particular, HSM can identify both simple matching i.e., 1:1 matching, and complex matching, i.e., 1:n or m:n matching, between attributes. Our experiments show that HSM can discover both simple and complex matchings accurately and efficiently on real data sets.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540329609</identifier><identifier>ISBN: 9783540329602</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540329619</identifier><identifier>EISBN: 3540329617</identifier><identifier>DOI: 10.1007/11687238_8</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Holistic Schema ; Information systems. Data bases ; Input Schema ; Memory organisation. Data processing ; Parallel Schema ; Query Interface ; Schema Match ; Software</subject><ispartof>Advances in Database Technology - EDBT 2006, 2006, p.77-94</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11687238_8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11687238_8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19152134$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Scholl, Marc H.</contributor><contributor>Matthes, Florian</contributor><contributor>Boehm, Klemens</contributor><contributor>Schmidt, Joachim W.</contributor><contributor>Boehm, Christian</contributor><contributor>Ioannidis, Yannis</contributor><contributor>Hatzopoulos, Mike</contributor><contributor>Grust, Torsten</contributor><contributor>Kemper, Alfons</contributor><creatorcontrib>Su, Weifeng</creatorcontrib><creatorcontrib>Wang, Jiying</creatorcontrib><creatorcontrib>Lochovsky, Frederick</creatorcontrib><title>Holistic Schema Matching for Web Query Interfaces</title><title>Advances in Database Technology - EDBT 2006</title><description>One significant part of today’s Web is Web databases, which can dynamically provide information in response to user queries. To help users submit queries to different Web databases, the query interface matching problem needs to be addressed. To solve this problem, we propose a new complex schema matching approach, Holistic Schema Matching (HSM). By examining the query interfaces of real Web databases, we observe that attribute matchings can be discovered from attribute-occurrence patterns. For example, First Name often appears together with Last Name while it is rarely co-present with Author in the Books domain. Thus, we design a count-based greedy algorithm to identify which attributes are more likely to be matched in the query interfaces. In particular, HSM can identify both simple matching i.e., 1:1 matching, and complex matching, i.e., 1:n or m:n matching, between attributes. Our experiments show that HSM can discover both simple and complex matchings accurately and efficiently on real data sets.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Holistic Schema</subject><subject>Information systems. Data bases</subject><subject>Input Schema</subject><subject>Memory organisation. Data processing</subject><subject>Parallel Schema</subject><subject>Query Interface</subject><subject>Schema Match</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540329609</isbn><isbn>9783540329602</isbn><isbn>9783540329619</isbn><isbn>3540329617</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkM1OwzAQhM2fRCm98AS5IHEJeLNxbB9RBRSpCCFAHK212bSBNqnscOjbE1QQcxmNvtEcRogzkJcgpb4CqIwu0DizJyZWG1SlxMJWYPfFCCqAHLG0B-LkD0h7KEYSZZFbXeKxmKT0IQchKKvMSMCsWzWpb0L2HJa8puyB-rBs2kVWdzF7Y589fXHcZvdtz7GmwOlUHNW0Sjz59bF4vb15mc7y-ePd_fR6nm8KMH1O76qqSyIZNGjDQbMZkvUWWRIoLtnX6BUyogk2eCTFIaCqCgroPeFYnO92N5QCrepIbWiS28RmTXHrwIIqAMuhd7HrpQG1C47Od91nciDdz2Xu_zL8BuRmWCo</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Su, Weifeng</creator><creator>Wang, Jiying</creator><creator>Lochovsky, Frederick</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Holistic Schema Matching for Web Query Interfaces</title><author>Su, Weifeng ; Wang, Jiying ; Lochovsky, Frederick</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-ad56f4aa0c7178ec7e84aa9b93e0a15e4ebf3b53e338c9cb3a5ecc3562ac3bba3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Holistic Schema</topic><topic>Information systems. Data bases</topic><topic>Input Schema</topic><topic>Memory organisation. Data processing</topic><topic>Parallel Schema</topic><topic>Query Interface</topic><topic>Schema Match</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Su, Weifeng</creatorcontrib><creatorcontrib>Wang, Jiying</creatorcontrib><creatorcontrib>Lochovsky, Frederick</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Su, Weifeng</au><au>Wang, Jiying</au><au>Lochovsky, Frederick</au><au>Scholl, Marc H.</au><au>Matthes, Florian</au><au>Boehm, Klemens</au><au>Schmidt, Joachim W.</au><au>Boehm, Christian</au><au>Ioannidis, Yannis</au><au>Hatzopoulos, Mike</au><au>Grust, Torsten</au><au>Kemper, Alfons</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Holistic Schema Matching for Web Query Interfaces</atitle><btitle>Advances in Database Technology - EDBT 2006</btitle><date>2006</date><risdate>2006</risdate><spage>77</spage><epage>94</epage><pages>77-94</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540329609</isbn><isbn>9783540329602</isbn><eisbn>9783540329619</eisbn><eisbn>3540329617</eisbn><abstract>One significant part of today’s Web is Web databases, which can dynamically provide information in response to user queries. To help users submit queries to different Web databases, the query interface matching problem needs to be addressed. To solve this problem, we propose a new complex schema matching approach, Holistic Schema Matching (HSM). By examining the query interfaces of real Web databases, we observe that attribute matchings can be discovered from attribute-occurrence patterns. For example, First Name often appears together with Last Name while it is rarely co-present with Author in the Books domain. Thus, we design a count-based greedy algorithm to identify which attributes are more likely to be matched in the query interfaces. In particular, HSM can identify both simple matching i.e., 1:1 matching, and complex matching, i.e., 1:n or m:n matching, between attributes. Our experiments show that HSM can discover both simple and complex matchings accurately and efficiently on real data sets.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11687238_8</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Database Technology - EDBT 2006, 2006, p.77-94 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19152134 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Holistic Schema Information systems. Data bases Input Schema Memory organisation. Data processing Parallel Schema Query Interface Schema Match Software |
| title | Holistic Schema Matching for Web Query Interfaces |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T13%3A53%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Holistic%20Schema%20Matching%20for%20Web%20Query%20Interfaces&rft.btitle=Advances%20in%20Database%20Technology%20-%20EDBT%202006&rft.au=Su,%20Weifeng&rft.date=2006&rft.spage=77&rft.epage=94&rft.pages=77-94&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540329609&rft.isbn_list=9783540329602&rft_id=info:doi/10.1007/11687238_8&rft_dat=%3Cpascalfrancis_sprin%3E19152134%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540329619&rft.eisbn_list=3540329617&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |