HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but al...
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 | 255 |
|---|---|
| container_issue | |
| container_start_page | 237 |
| container_title | |
| container_volume | 2992 |
| creator | Schenkel, Ralf Theobald, Anja Weikum, Gerhard |
| description | In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space– and time–efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2–hop cover by developing scalable methods for index creation on very large XML data collections with long paths and extensive cross–linkage. Our experiments show substantial savings in the query performance of the HOPI index over previously proposed index structures in combination with low space requirements. |
| doi_str_mv | 10.1007/978-3-540-24741-8_15 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15672055</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088220_21_254</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-7c0b241f3ecc7efa768fcbde8a7c6769db4f87f19dd7ac58c6ecd0a50440b34d3</originalsourceid><addsrcrecordid>eNotkMlOwzAQhs0qQukbcMiFo2G8JHa4VaXQSkXlABI3y3FsCKRJiFMJ3h6n6Vw8-peR_CF0TeCWAIi7TEjMcMIBUy44wVKR5AhNg8yCuNfkMYpISghmjGcn6HJvEAoApygCBhRngrNzFGXBl5AyeoGm3n_BMJlkGY_Qcrl5Wd3HszpeOFea0tZ9PG_q2pq-bOp4VRf2N3ZNF8RtW4X9_XkdPzRmtx2TVTUm_RU6c7rydnp4J-jtcfE6X-L15mk1n61xSwXtsTCQU04cs8YI67RIpTN5YaUWJhVpVuTcSeFIVhRCm0Sa1JoCdAKcQ854wSboZrzbam905Tpdm9Krtiu3uvsLkFJBIUlCjo45H6z6w3Yqb5pvrwioga8KIBVTgZjas1QD31Bih-Nd87Ozvld2aJnw105X5lO3ve28YiAlpaFJFE04-we3fHgb</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3088220_21_254</pqid></control><display><type>book_chapter</type><title>HOPI: An Efficient Connection Index for Complex XML Document Collections</title><source>Springer Books</source><creator>Schenkel, Ralf ; Theobald, Anja ; Weikum, Gerhard</creator><contributor>Bertino, Elisa ; Plexousakis, Dimitris ; Christodoulakis, Stavros ; Koubarakis, Manolis ; Ferrari, Elena ; Böhm, Klemens ; Vassilis, Christophides ; Bertino, Elisa ; Christodoulakis, Stavros ; Ferrari, Elena ; Böhm, Klemens ; Christophides, Vassilis ; Koubarakis, Manolis ; Plexousakis, Dimitris</contributor><creatorcontrib>Schenkel, Ralf ; Theobald, Anja ; Weikum, Gerhard ; Bertino, Elisa ; Plexousakis, Dimitris ; Christodoulakis, Stavros ; Koubarakis, Manolis ; Ferrari, Elena ; Böhm, Klemens ; Vassilis, Christophides ; Bertino, Elisa ; Christodoulakis, Stavros ; Ferrari, Elena ; Böhm, Klemens ; Christophides, Vassilis ; Koubarakis, Manolis ; Plexousakis, Dimitris</creatorcontrib><description>In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space– and time–efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2–hop cover by developing scalable methods for index creation on very large XML data collections with long paths and extensive cross–linkage. Our experiments show substantial savings in the query performance of the HOPI index over previously proposed index structures in combination with low space requirements.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540212000</identifier><identifier>ISBN: 9783540212003</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540247418</identifier><identifier>EISBN: 3540247416</identifier><identifier>DOI: 10.1007/978-3-540-24741-8_15</identifier><identifier>OCLC: 934980632</identifier><identifier>LCCallNum: QA76.9.D35</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Directed Graph ; Exact sciences and technology ; Path Expression ; Path Query ; Query Performance ; Software ; Transitive Closure</subject><ispartof>Advances in Database Technology - EDBT 2004, 2004, Vol.2992, p.237-255</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 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/3088220-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-24741-8_15$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-24741-8_15$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4049,4050,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15672055$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Bertino, Elisa</contributor><contributor>Plexousakis, Dimitris</contributor><contributor>Christodoulakis, Stavros</contributor><contributor>Koubarakis, Manolis</contributor><contributor>Ferrari, Elena</contributor><contributor>Böhm, Klemens</contributor><contributor>Vassilis, Christophides</contributor><contributor>Bertino, Elisa</contributor><contributor>Christodoulakis, Stavros</contributor><contributor>Ferrari, Elena</contributor><contributor>Böhm, Klemens</contributor><contributor>Christophides, Vassilis</contributor><contributor>Koubarakis, Manolis</contributor><contributor>Plexousakis, Dimitris</contributor><creatorcontrib>Schenkel, Ralf</creatorcontrib><creatorcontrib>Theobald, Anja</creatorcontrib><creatorcontrib>Weikum, Gerhard</creatorcontrib><title>HOPI: An Efficient Connection Index for Complex XML Document Collections</title><title>Advances in Database Technology - EDBT 2004</title><description>In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space– and time–efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2–hop cover by developing scalable methods for index creation on very large XML data collections with long paths and extensive cross–linkage. Our experiments show substantial savings in the query performance of the HOPI index over previously proposed index structures in combination with low space requirements.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Directed Graph</subject><subject>Exact sciences and technology</subject><subject>Path Expression</subject><subject>Path Query</subject><subject>Query Performance</subject><subject>Software</subject><subject>Transitive Closure</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540212000</isbn><isbn>9783540212003</isbn><isbn>9783540247418</isbn><isbn>3540247416</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkMlOwzAQhs0qQukbcMiFo2G8JHa4VaXQSkXlABI3y3FsCKRJiFMJ3h6n6Vw8-peR_CF0TeCWAIi7TEjMcMIBUy44wVKR5AhNg8yCuNfkMYpISghmjGcn6HJvEAoApygCBhRngrNzFGXBl5AyeoGm3n_BMJlkGY_Qcrl5Wd3HszpeOFea0tZ9PG_q2pq-bOp4VRf2N3ZNF8RtW4X9_XkdPzRmtx2TVTUm_RU6c7rydnp4J-jtcfE6X-L15mk1n61xSwXtsTCQU04cs8YI67RIpTN5YaUWJhVpVuTcSeFIVhRCm0Sa1JoCdAKcQ854wSboZrzbam905Tpdm9Krtiu3uvsLkFJBIUlCjo45H6z6w3Yqb5pvrwioga8KIBVTgZjas1QD31Bih-Nd87Ozvld2aJnw105X5lO3ve28YiAlpaFJFE04-we3fHgb</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Schenkel, Ralf</creator><creator>Theobald, Anja</creator><creator>Weikum, Gerhard</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>HOPI: An Efficient Connection Index for Complex XML Document Collections</title><author>Schenkel, Ralf ; Theobald, Anja ; Weikum, Gerhard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-7c0b241f3ecc7efa768fcbde8a7c6769db4f87f19dd7ac58c6ecd0a50440b34d3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Directed Graph</topic><topic>Exact sciences and technology</topic><topic>Path Expression</topic><topic>Path Query</topic><topic>Query Performance</topic><topic>Software</topic><topic>Transitive Closure</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Schenkel, Ralf</creatorcontrib><creatorcontrib>Theobald, Anja</creatorcontrib><creatorcontrib>Weikum, Gerhard</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>Schenkel, Ralf</au><au>Theobald, Anja</au><au>Weikum, Gerhard</au><au>Bertino, Elisa</au><au>Plexousakis, Dimitris</au><au>Christodoulakis, Stavros</au><au>Koubarakis, Manolis</au><au>Ferrari, Elena</au><au>Böhm, Klemens</au><au>Vassilis, Christophides</au><au>Bertino, Elisa</au><au>Christodoulakis, Stavros</au><au>Ferrari, Elena</au><au>Böhm, Klemens</au><au>Christophides, Vassilis</au><au>Koubarakis, Manolis</au><au>Plexousakis, Dimitris</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>HOPI: An Efficient Connection Index for Complex XML Document Collections</atitle><btitle>Advances in Database Technology - EDBT 2004</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>2992</volume><spage>237</spage><epage>255</epage><pages>237-255</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540212000</isbn><isbn>9783540212003</isbn><eisbn>9783540247418</eisbn><eisbn>3540247416</eisbn><abstract>In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space– and time–efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2–hop cover by developing scalable methods for index creation on very large XML data collections with long paths and extensive cross–linkage. Our experiments show substantial savings in the query performance of the HOPI index over previously proposed index structures in combination with low space requirements.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-24741-8_15</doi><oclcid>934980632</oclcid><tpages>19</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Database Technology - EDBT 2004, 2004, Vol.2992, p.237-255 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15672055 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Directed Graph Exact sciences and technology Path Expression Path Query Query Performance Software Transitive Closure |
| title | HOPI: An Efficient Connection Index for Complex XML Document Collections |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T18%3A27%3A19IST&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=HOPI:%20An%20Efficient%20Connection%20Index%20for%20Complex%20XML%20Document%20Collections&rft.btitle=Advances%20in%20Database%20Technology%20-%20EDBT%202004&rft.au=Schenkel,%20Ralf&rft.date=2004&rft.volume=2992&rft.spage=237&rft.epage=255&rft.pages=237-255&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540212000&rft.isbn_list=9783540212003&rft_id=info:doi/10.1007/978-3-540-24741-8_15&rft_dat=%3Cproquest_pasca%3EEBC3088220_21_254%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540247418&rft.eisbn_list=3540247416&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088220_21_254&rft_id=info:pmid/&rfr_iscdi=true |