Discovering Frequent Tree Patterns from XML Queries
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    With XML being the standard for data encoding and exchange over Internet,how to manage XML data efficiently becomes a critical issue.An effective approach to improve the performance of XML management systems is to discover frequent XML query paRems and cache their results.Since each XML query call be modeled as a tree structore.the problem of discovering frequent query patterns can be reduced to frequent structure mining.However,mining frequem query patterns is much more complex than simple stroctnre mining since we have to consider the semantics of query patterns.In this paper,we present an approach to discover frequent XML query patterns efficiently.Compared with previous works,onr approach is strictly based on the semantics of XML queries,its mining results arc more precise,and Call be more effectively utilized by caching systerm.

    Reference
    Related
    Cited by
Get Citation

陈义,王裕国,杨电怀. XML查询模式发掘.软件学报,2004,15(zk):114-123

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063