• Article
  • | |
  • Metrics
  • |
  • Reference [16]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    This paper proposes an adaptive structural index: AS-Index (adaptive structural index), which can avoid the problem of the existing indexes. AS-Index is based on F&B-Index. It consists of F&B-Index, Query-Table and Part-Table. Frequent queries are kept in Query-Table avoiding redundant operations in query processing. Based on Query-Table an efficient bottom-up query processing is also proposed for answering infrequent queries using the frequent queries in Query-Table. Part-Table is used for optimizing the queries with descendant edges. The existing adaptive structural indexes need to traverse the whole document for adaptation, and their adaptation granularity is XML element node. For AS-Index, the adaptation granularity is F&B-Index node which includes a set of XML element nodes, and its adaptation is an efficient and incremental process that supports branch queries. The experimental results demonstrate that this index significantly outperforms the previous structural indexes in terms of query processing and adaptation efficiencies. For large XML documents, compared with the existing adaptive structural indexes, AS-Index is more scalable

    Reference
    [1] Goldman R, Widom J. DataGuides: Enabling query formulation and optimization in semistructured databases. In: Proc. of theVLDB. 1997. 436?445.
    [2] Milo T, Suciu D. Index structures for path expressions. In: Proc. of the ICDT. 1999. 277?295.
    [3] Cooper BF, Sample N, Franklin MJ, Hjaltason GR, Shadmon M. A fast index for semistructured data. In: Proc. of the VLDB. 2001.341?350.
    [4] Kaushik R, Shenoy P, Bohannon P, Gudes E. Exploiting local similarity for indexing paths in graph-structured data. In: Proc. of theICDE. 2002. 129?140.
    [5] Wu HW, Wang Q, Yu JX, Zhou AY, Zhou SG. UD(k,l)-Index: An efficient approximate index for XML data. In: Proc. of the 4thInt’l Conf. on Web Age Information Management (WAIM 2003). LNCS, Chengdu: Spring-Verlag, 2003.
    [6] Kaushik R, Bohannon P, Naughton JF, Korth HF. Covering indexes for branching path queries. In: Proc. of the SIGMOD. 2002.133?144.
    [7] Wang W, Wang HZ, Lu HJ, Jiang HF, Lin XM, Li JZ. Efficient processing of XML path queries using the disk-based F&B index.In: Proc. of the VLDB. 2005. 145?156.
    [8] Chung CW, Min JK, Shim K. APEX: An adaptive path index for XML data. In: Proc. of the SIGMOD. 2002. 121?132.
    [9] Chen Q, Lim A, Ong KW. D(k)-Index: An adaptive structural summary for graph-structured data. In: Proc. of the SIGMOD. 2003.134?144.
    [10] He H, Yang J. Multiresolution indexing of XML for frequent queries. In: Proc. of the ICDE. 2004. 683?694.
    [11] Berglund A, Boag S, Chamberlin D, Fernandez MF, Kay M, Robie J, Simeon J. XML path language (XPath) 2.0. In: Proc. of the W3C Proposed Recommendation. 2006. http://www.w3.org/TR/xpath20
    [12] Miklau G, Suciu D. Containment and equivalence for an XPath fragment. In: Proc. of the PODS. 2002. 65?76.
    [13] Zhang C, Naughton JF, DeWitt DJ, Luo Q, Lohman GM. On supporting containment queries in relational database management systems. In: Proc. of the SIGMOD. 2001. 425?436.
    [14] Al-Khalifa S, Jagadish HV, Patel JM, Wu Y, Koudas N, Srivastava D. Structural joins: A primitive for efficient XML query pattern matching. In: Proc. of the ICDE. 2002. 141?154.
    [15] XMark. http://monetdb.cwi.nl/xml
    [16] YFilter 1.0 release. http://yfilter.cs.berkeley.edu/code_release.htm
    Related
    Cited by
Get Citation

张 博,耿志华,周傲英.一种支持高效XML 路径查询的自适应结构索引.软件学报,2009,20(7):1812-1824

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 15,2007
  • Revised:March 14,2008
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