An extended preorder index for optimising XPath expressions

被引:0
|
作者
O'Connor, MF [1 ]
Bellahsène, Z
Roantree, M
机构
[1] Dublin City Univ, Interoperable Syst Grp, Dublin 9, Ireland
[2] Univ Montpellier 2, CNRS, UMR 5506, LIRMM, F-34095 Montpellier, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended index structure based on the preorder traversal rank and the level (or depth) rank of each node in a document tree. The extended index fully supports the navigation of all XPath axes while efficiently supporting data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique is presented where properties of the level ranking may be exploited to provide efficient and optimised level-based XPath evaluations.
引用
收藏
页码:114 / 128
页数:15
相关论文
共 50 条
  • [1] Refined extended preorder index with path information
    Xing, GM
    Zhang, DL
    ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 1, PROCEEDINGS, 2004, : 304 - 308
  • [2] Satisfiability of XPath expressions
    Hidders, J
    DATABASE PROGRAMMING LANGUAGES, 2004, 2921 : 21 - 36
  • [3] On the intersection of XPath expressions
    Hammerschmidt, BC
    Kempa, M
    Linnemann, V
    9TH INTERNATIONAL DATABASE ENGINEERING & APPLICATION SYMPOSIUM, PROCEEDINGS, 2005, : 49 - 57
  • [4] Processing XPath expressions in relational databases
    Pankowski, T
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 265 - 276
  • [5] XViz: A tool for visualizing XPath expressions
    Handy, B
    Suciu, D
    DATABASE AND XML TECHNOLOGIES, 2003, 2824 : 134 - 148
  • [6] Transforming XPath Expressions into Relational Algebra Expressions With Kleene Closure
    Chen, Yangjun
    DBKDA 2011: THE THIRD INTERNATIONAL CONFERENCE ON ADVANCES IN DATABASES, KNOWLEDGE, AND DATA APPLICATIONS, 2011, : 114 - 121
  • [7] An Agreement Index with Respect to a Consensus Preorder
    Jabeur, Khaled
    Martel, Jean-Marc
    GROUP DECISION AND NEGOTIATION, 2010, 19 (06) : 571 - 590
  • [8] Query-based learning of XPath expressions
    Carme, Julien
    Ceresna, Michal
    Goebel, Max
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 342 - 343
  • [9] Rewriting XPath Expressions Depending on Path Summary
    Xu, Xiaoshuang
    Feng, Yucai
    Wang, Feng
    Zhou, Yingbiao
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2009, 5678 : 736 - +
  • [10] Filtering contents by efficient evaluation of XPath expressions
    Yuriyama, M
    Nakamura, H
    2003 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, 2003, : 148 - 155