Mining Positive and Negative Association Rules from XML Query Patterns for Caching
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temp...
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 | 747 |
|---|---|
| container_issue | |
| container_start_page | 736 |
| container_title | |
| container_volume | |
| creator | Chen, Ling Bhowmick, Sourav S. Chia, Liang-Tien |
| description | Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inquires some information from the XML document, she/he will probably inquire some other information subsequently. We cluster XML queries according to their semantics first and then mine association rules between the clusters. Moreover, not only positive but also negative association rules are discovered to design the appropriate cache replacement strategy. The experimental results showed that our approach considerably improved the caching performance by significantly reducing the query response time. |
| doi_str_mv | 10.1007/11408079_67 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16923371</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16923371</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-f9d54fd36a79e7237094ac273c1b350864d7a97c38d505bbd942cee0258d67a63</originalsourceid><addsrcrecordid>eNpNUMtOwzAQNC-JtnDiB3zhwCGw9jp2fEQVL6mFUoHELXIcpwTauLJTpP49hnLgNDM7o5F2CDljcMkA1BVjAgpQupRqjwwxF4AcINf7ZMAkYxmi0Ac7g-dJ4CEZAALPtBJ4TIYxfgAAV5oPyHzadm23oDMf2779ctR0NX10C_MrrmP0tk3cd3S-WbpIm-BX9G06oc8bF7Z0ZvrehS7dfaBjY99T1wk5aswyutM_HJHX25uX8X02ebp7GF9PsjVnus8aXeeiqVEapZ3iqEALY7lCyyrMoZCiVkYri0WdQ15VtRbcOpdeKmqpjMQROd_1rk20ZtkE09k2luvQrkzYlkxqjqhYyl3scjFZ3cKFsvL-M5YMyp85y39z4jcNqGGk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Mining Positive and Negative Association Rules from XML Query Patterns for Caching</title><source>Springer Books</source><creator>Chen, Ling ; Bhowmick, Sourav S. ; Chia, Liang-Tien</creator><contributor>Zhou, Lizhu ; Meng, Xiaofeng ; Ooi, Beng Chin</contributor><creatorcontrib>Chen, Ling ; Bhowmick, Sourav S. ; Chia, Liang-Tien ; Zhou, Lizhu ; Meng, Xiaofeng ; Ooi, Beng Chin</creatorcontrib><description>Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inquires some information from the XML document, she/he will probably inquire some other information subsequently. We cluster XML queries according to their semantics first and then mine association rules between the clusters. Moreover, not only positive but also negative association rules are discovered to design the appropriate cache replacement strategy. The experimental results showed that our approach considerably improved the caching performance by significantly reducing the query response time.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540253343</identifier><identifier>ISBN: 9783540253341</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320059</identifier><identifier>EISBN: 9783540320050</identifier><identifier>DOI: 10.1007/11408079_67</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Software</subject><ispartof>Database Systems for Advanced Applications, 2005, p.736-747</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 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/11408079_67$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11408079_67$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16923371$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Zhou, Lizhu</contributor><contributor>Meng, Xiaofeng</contributor><contributor>Ooi, Beng Chin</contributor><creatorcontrib>Chen, Ling</creatorcontrib><creatorcontrib>Bhowmick, Sourav S.</creatorcontrib><creatorcontrib>Chia, Liang-Tien</creatorcontrib><title>Mining Positive and Negative Association Rules from XML Query Patterns for Caching</title><title>Database Systems for Advanced Applications</title><description>Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inquires some information from the XML document, she/he will probably inquire some other information subsequently. We cluster XML queries according to their semantics first and then mine association rules between the clusters. Moreover, not only positive but also negative association rules are discovered to design the appropriate cache replacement strategy. The experimental results showed that our approach considerably improved the caching performance by significantly reducing the query response time.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540253343</isbn><isbn>9783540253341</isbn><isbn>3540320059</isbn><isbn>9783540320050</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUMtOwzAQNC-JtnDiB3zhwCGw9jp2fEQVL6mFUoHELXIcpwTauLJTpP49hnLgNDM7o5F2CDljcMkA1BVjAgpQupRqjwwxF4AcINf7ZMAkYxmi0Ac7g-dJ4CEZAALPtBJ4TIYxfgAAV5oPyHzadm23oDMf2779ctR0NX10C_MrrmP0tk3cd3S-WbpIm-BX9G06oc8bF7Z0ZvrehS7dfaBjY99T1wk5aswyutM_HJHX25uX8X02ebp7GF9PsjVnus8aXeeiqVEapZ3iqEALY7lCyyrMoZCiVkYri0WdQ15VtRbcOpdeKmqpjMQROd_1rk20ZtkE09k2luvQrkzYlkxqjqhYyl3scjFZ3cKFsvL-M5YMyp85y39z4jcNqGGk</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Chen, Ling</creator><creator>Bhowmick, Sourav S.</creator><creator>Chia, Liang-Tien</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Mining Positive and Negative Association Rules from XML Query Patterns for Caching</title><author>Chen, Ling ; Bhowmick, Sourav S. ; Chia, Liang-Tien</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-f9d54fd36a79e7237094ac273c1b350864d7a97c38d505bbd942cee0258d67a63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Ling</creatorcontrib><creatorcontrib>Bhowmick, Sourav S.</creatorcontrib><creatorcontrib>Chia, Liang-Tien</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Ling</au><au>Bhowmick, Sourav S.</au><au>Chia, Liang-Tien</au><au>Zhou, Lizhu</au><au>Meng, Xiaofeng</au><au>Ooi, Beng Chin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Mining Positive and Negative Association Rules from XML Query Patterns for Caching</atitle><btitle>Database Systems for Advanced Applications</btitle><date>2005</date><risdate>2005</risdate><spage>736</spage><epage>747</epage><pages>736-747</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540253343</isbn><isbn>9783540253341</isbn><eisbn>3540320059</eisbn><eisbn>9783540320050</eisbn><abstract>Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inquires some information from the XML document, she/he will probably inquire some other information subsequently. We cluster XML queries according to their semantics first and then mine association rules between the clusters. Moreover, not only positive but also negative association rules are discovered to design the appropriate cache replacement strategy. The experimental results showed that our approach considerably improved the caching performance by significantly reducing the query response time.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11408079_67</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database Systems for Advanced Applications, 2005, p.736-747 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16923371 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Software |
| title | Mining Positive and Negative Association Rules from XML Query Patterns for Caching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T09%3A31%3A45IST&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=Mining%20Positive%20and%20Negative%20Association%20Rules%20from%20XML%20Query%20Patterns%20for%20Caching&rft.btitle=Database%20Systems%20for%20Advanced%20Applications&rft.au=Chen,%20Ling&rft.date=2005&rft.spage=736&rft.epage=747&rft.pages=736-747&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540253343&rft.isbn_list=9783540253341&rft_id=info:doi/10.1007/11408079_67&rft_dat=%3Cpascalfrancis_sprin%3E16923371%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320059&rft.eisbn_list=9783540320050&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |