The Geometric Framework for Exact and Similarity Querying XML Data
Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate thr...
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 | 46 |
|---|---|
| container_issue | |
| container_start_page | 35 |
| container_title | |
| container_volume | 2510 |
| creator | Krátký, Michal Pokorný, Jaroslav Skopal, Tomáš Snášel, Václav |
| description | Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. If we considered a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries. |
| doi_str_mv | 10.1007/3-540-36087-5_5 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14478263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072129_10_57</sourcerecordid><originalsourceid>FETCH-LOGICAL-p266t-91de3002da33f44d36e82a12ce9bfea11cc6429ce2addf9601589a59d85b45453</originalsourceid><addsrcrecordid>eNotkM1PwzAMxcOnGGNnrrlwDCRx0jZHPsZAGkKIIXGLvDTdyrZ2JJ1g_z3tmC-W_X5-sh4hl4JfC87TG2BacQYJz1KmrT4g59AudrM-JD2RCMEAlDkiA5NmndaWzPgx6XHgkplUwSnpGdDScJPCGRnE-NVBIKXJdI_cTeaejny98k0oHX0MuPI_dVjQog50-IuuoVjl9L1clUsMZbOlbxsftmU1o58vY_qADV6QkwKX0Q_2vU8-HoeT-yc2fh0939-O2VomScOMyD203-UIUCiVQ-IziUI6b6aFRyGcS5Q0zkvM88IkXOjMoDZ5pqdKKw19cvXvu8bocFkErFwZ7TqUKwxbK5RKM5lAy7F_LrZSNfPBTut6Ea3gtgvVgm1zsrsQbRtqy8u9b6i_Nz421ncHzldNwKWb47rxIVrgqRTSdDY6hT8BRHLG</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072129_10_57</pqid></control><display><type>book_chapter</type><title>The Geometric Framework for Exact and Similarity Querying XML Data</title><source>Springer Books</source><creator>Krátký, Michal ; Pokorný, Jaroslav ; Skopal, Tomáš ; Snášel, Václav</creator><contributor>Shafazand, M. Hassan ; Tjoa, A. Min ; Shafazand, Hassan ; Tjoa, A. Min</contributor><creatorcontrib>Krátký, Michal ; Pokorný, Jaroslav ; Skopal, Tomáš ; Snášel, Václav ; Shafazand, M. Hassan ; Tjoa, A. Min ; Shafazand, Hassan ; Tjoa, A. Min</creatorcontrib><description>Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. If we considered a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540000280</identifier><identifier>ISBN: 3540000283</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540360875</identifier><identifier>EISBN: 9783540360872</identifier><identifier>DOI: 10.1007/3-540-36087-5_5</identifier><identifier>OCLC: 935290973</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact Match Query ; Exact sciences and technology ; Geometric Framework ; Ground Object ; Information systems. Data bases ; Memory organisation. Data processing ; Query Object ; Range Query ; Software</subject><ispartof>EurAsia-ICT 2002: Information and Communication Technology, 2002, Vol.2510, p.35-46</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072129-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-36087-5_5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-36087-5_5$$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=14478263$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Shafazand, M. Hassan</contributor><contributor>Tjoa, A. Min</contributor><contributor>Shafazand, Hassan</contributor><contributor>Tjoa, A. Min</contributor><creatorcontrib>Krátký, Michal</creatorcontrib><creatorcontrib>Pokorný, Jaroslav</creatorcontrib><creatorcontrib>Skopal, Tomáš</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><title>The Geometric Framework for Exact and Similarity Querying XML Data</title><title>EurAsia-ICT 2002: Information and Communication Technology</title><description>Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. If we considered a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact Match Query</subject><subject>Exact sciences and technology</subject><subject>Geometric Framework</subject><subject>Ground Object</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Query Object</subject><subject>Range Query</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540000280</isbn><isbn>3540000283</isbn><isbn>3540360875</isbn><isbn>9783540360872</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkM1PwzAMxcOnGGNnrrlwDCRx0jZHPsZAGkKIIXGLvDTdyrZ2JJ1g_z3tmC-W_X5-sh4hl4JfC87TG2BacQYJz1KmrT4g59AudrM-JD2RCMEAlDkiA5NmndaWzPgx6XHgkplUwSnpGdDScJPCGRnE-NVBIKXJdI_cTeaejny98k0oHX0MuPI_dVjQog50-IuuoVjl9L1clUsMZbOlbxsftmU1o58vY_qADV6QkwKX0Q_2vU8-HoeT-yc2fh0939-O2VomScOMyD203-UIUCiVQ-IziUI6b6aFRyGcS5Q0zkvM88IkXOjMoDZ5pqdKKw19cvXvu8bocFkErFwZ7TqUKwxbK5RKM5lAy7F_LrZSNfPBTut6Ea3gtgvVgm1zsrsQbRtqy8u9b6i_Nz421ncHzldNwKWb47rxIVrgqRTSdDY6hT8BRHLG</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Krátký, Michal</creator><creator>Pokorný, Jaroslav</creator><creator>Skopal, Tomáš</creator><creator>Snášel, Václav</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>The Geometric Framework for Exact and Similarity Querying XML Data</title><author>Krátký, Michal ; Pokorný, Jaroslav ; Skopal, Tomáš ; Snášel, Václav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p266t-91de3002da33f44d36e82a12ce9bfea11cc6429ce2addf9601589a59d85b45453</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact Match Query</topic><topic>Exact sciences and technology</topic><topic>Geometric Framework</topic><topic>Ground Object</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Query Object</topic><topic>Range Query</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Krátký, Michal</creatorcontrib><creatorcontrib>Pokorný, Jaroslav</creatorcontrib><creatorcontrib>Skopal, Tomáš</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Krátký, Michal</au><au>Pokorný, Jaroslav</au><au>Skopal, Tomáš</au><au>Snášel, Václav</au><au>Shafazand, M. Hassan</au><au>Tjoa, A. Min</au><au>Shafazand, Hassan</au><au>Tjoa, A. Min</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>The Geometric Framework for Exact and Similarity Querying XML Data</atitle><btitle>EurAsia-ICT 2002: Information and Communication Technology</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002</date><risdate>2002</risdate><volume>2510</volume><spage>35</spage><epage>46</epage><pages>35-46</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540000280</isbn><isbn>3540000283</isbn><eisbn>3540360875</eisbn><eisbn>9783540360872</eisbn><abstract>Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. If we considered a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-36087-5_5</doi><oclcid>935290973</oclcid><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | EurAsia-ICT 2002: Information and Communication Technology, 2002, Vol.2510, p.35-46 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_14478263 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact Match Query Exact sciences and technology Geometric Framework Ground Object Information systems. Data bases Memory organisation. Data processing Query Object Range Query Software |
| title | The Geometric Framework for Exact and Similarity Querying XML Data |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T12%3A37%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=The%20Geometric%20Framework%20for%20Exact%20and%20Similarity%20Querying%20XML%20Data&rft.btitle=EurAsia-ICT%202002:%20Information%20and%20Communication%20Technology&rft.au=Kr%C3%A1tk%C3%BD,%20Michal&rft.date=2002&rft.volume=2510&rft.spage=35&rft.epage=46&rft.pages=35-46&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540000280&rft.isbn_list=3540000283&rft_id=info:doi/10.1007/3-540-36087-5_5&rft_dat=%3Cproquest_pasca%3EEBC3072129_10_57%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540360875&rft.eisbn_list=9783540360872&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072129_10_57&rft_id=info:pmid/&rfr_iscdi=true |