Querying Semistructured Data Based on Schema Matching
Traditional database management requires design and ensures declarativity. In the context of semistructured data a more flexible approach is appropriate due to missing schema information. In this paper we present a query language based on schema matching. Intuitively, a query is a pair consisting of...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 183 |
|---|---|
| container_issue | |
| container_start_page | 168 |
| container_title | |
| container_volume | |
| creator | Bergholz, André Freytag, Johann Christoph |
| description | Traditional database management requires design and ensures declarativity. In the context of semistructured data a more flexible approach is appropriate due to missing schema information. In this paper we present a query language based on schema matching. Intuitively, a query is a pair consisting of what we want and how we want it. We propose that the former can be achieved by matching a (partial) schema and the latter by specifying additional operations. We describe in some detail our notion of schema covering various concepts typically found in query languages, such as predicates, variables and paths. We outline the optimization potential that this modular approach offers and discuss how we use constraints for query processing. |
| doi_str_mv | 10.1007/3-540-44543-9_11 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_784158</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>784158</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1791-4c160fc5e5f67aa9f2ee00fc0cae94852eb6fcd6708a917c3736c1b4703f5dbc3</originalsourceid><addsrcrecordid>eNotkMtPAjEQh-srEZG7x008Fzvb1_ao4CvBGIOem9nSwiospF0O_PeWx1xm8v1-mcNHyB2wITCmHziVglEhpODUWIAzcsMzOQBzTnqgACjnwlycAhAVmEvSY5yV1GjBr8kgpV-Wh5eqVKZH5NfWx13TzoupXzWpi1vXbaOfFWPssHjClM91W0zdwq-w-MDOLXL5llwFXCY_OO0--Xl5_h690cnn6_vocUI3oA1Q4UCx4KSXQWlEE0rvWQbMoTeikqWvVXAzpVmFBrTjmisHtdCMBzmrHe-T--PfDSaHyxCxdU2ym9isMO6srgTIKreGx1bKQTv30dbr9V-ywOzem-U2y7AHTXbvjf8DYbNasw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Querying Semistructured Data Based on Schema Matching</title><source>Springer Books</source><creator>Bergholz, André ; Freytag, Johann Christoph</creator><contributor>Mendelzon, Alberto ; Connor, Richard</contributor><creatorcontrib>Bergholz, André ; Freytag, Johann Christoph ; Mendelzon, Alberto ; Connor, Richard</creatorcontrib><description>Traditional database management requires design and ensures declarativity. In the context of semistructured data a more flexible approach is appropriate due to missing schema information. In this paper we present a query language based on schema matching. Intuitively, a query is a pair consisting of what we want and how we want it. We propose that the former can be achieved by matching a (partial) schema and the latter by specifying additional operations. We describe in some detail our notion of schema covering various concepts typically found in query languages, such as predicates, variables and paths. We outline the optimization potential that this modular approach offers and discuss how we use constraints for query processing.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540414819</identifier><identifier>ISBN: 9783540414810</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540445439</identifier><identifier>EISBN: 9783540445432</identifier><identifier>DOI: 10.1007/3-540-44543-9_11</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Constraint Satisfaction ; Constraint Satisfaction Problem ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Query Language ; Query Processing ; Schema Match ; Software</subject><ispartof>Lecture notes in computer science, 2000, p.168-183</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-44543-9_11$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-44543-9_11$$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=784158$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Mendelzon, Alberto</contributor><contributor>Connor, Richard</contributor><creatorcontrib>Bergholz, André</creatorcontrib><creatorcontrib>Freytag, Johann Christoph</creatorcontrib><title>Querying Semistructured Data Based on Schema Matching</title><title>Lecture notes in computer science</title><description>Traditional database management requires design and ensures declarativity. In the context of semistructured data a more flexible approach is appropriate due to missing schema information. In this paper we present a query language based on schema matching. Intuitively, a query is a pair consisting of what we want and how we want it. We propose that the former can be achieved by matching a (partial) schema and the latter by specifying additional operations. We describe in some detail our notion of schema covering various concepts typically found in query languages, such as predicates, variables and paths. We outline the optimization potential that this modular approach offers and discuss how we use constraints for query processing.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Constraint Satisfaction</subject><subject>Constraint Satisfaction Problem</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Query Language</subject><subject>Query Processing</subject><subject>Schema Match</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540414819</isbn><isbn>9783540414810</isbn><isbn>3540445439</isbn><isbn>9783540445432</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkMtPAjEQh-srEZG7x008Fzvb1_ao4CvBGIOem9nSwiospF0O_PeWx1xm8v1-mcNHyB2wITCmHziVglEhpODUWIAzcsMzOQBzTnqgACjnwlycAhAVmEvSY5yV1GjBr8kgpV-Wh5eqVKZH5NfWx13TzoupXzWpi1vXbaOfFWPssHjClM91W0zdwq-w-MDOLXL5llwFXCY_OO0--Xl5_h690cnn6_vocUI3oA1Q4UCx4KSXQWlEE0rvWQbMoTeikqWvVXAzpVmFBrTjmisHtdCMBzmrHe-T--PfDSaHyxCxdU2ym9isMO6srgTIKreGx1bKQTv30dbr9V-ywOzem-U2y7AHTXbvjf8DYbNasw</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Bergholz, André</creator><creator>Freytag, Johann Christoph</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Querying Semistructured Data Based on Schema Matching</title><author>Bergholz, André ; Freytag, Johann Christoph</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1791-4c160fc5e5f67aa9f2ee00fc0cae94852eb6fcd6708a917c3736c1b4703f5dbc3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Constraint Satisfaction</topic><topic>Constraint Satisfaction Problem</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Query Language</topic><topic>Query Processing</topic><topic>Schema Match</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bergholz, André</creatorcontrib><creatorcontrib>Freytag, Johann Christoph</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bergholz, André</au><au>Freytag, Johann Christoph</au><au>Mendelzon, Alberto</au><au>Connor, Richard</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Querying Semistructured Data Based on Schema Matching</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><spage>168</spage><epage>183</epage><pages>168-183</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540414819</isbn><isbn>9783540414810</isbn><eisbn>3540445439</eisbn><eisbn>9783540445432</eisbn><abstract>Traditional database management requires design and ensures declarativity. In the context of semistructured data a more flexible approach is appropriate due to missing schema information. In this paper we present a query language based on schema matching. Intuitively, a query is a pair consisting of what we want and how we want it. We propose that the former can be achieved by matching a (partial) schema and the latter by specifying additional operations. We describe in some detail our notion of schema covering various concepts typically found in query languages, such as predicates, variables and paths. We outline the optimization potential that this modular approach offers and discuss how we use constraints for query processing.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/3-540-44543-9_11</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2000, p.168-183 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_784158 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Constraint Satisfaction Constraint Satisfaction Problem Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Query Language Query Processing Schema Match Software |
| title | Querying Semistructured Data Based on Schema Matching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T01%3A21%3A43IST&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=bookitem&rft.atitle=Querying%20Semistructured%20Data%20Based%20on%20Schema%20Matching&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Bergholz,%20Andr%C3%A9&rft.date=2000&rft.spage=168&rft.epage=183&rft.pages=168-183&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540414819&rft.isbn_list=9783540414810&rft_id=info:doi/10.1007/3-540-44543-9_11&rft_dat=%3Cpascalfrancis_sprin%3E784158%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540445439&rft.eisbn_list=9783540445432&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |