View in EDS PDF Full Text

A New Structure for Accelerating XPath Location Steps.

Saved in:
Bibliographic Details
Title: A New Structure for Accelerating XPath Location Steps.
Authors: Yaokai Feng1 fengyk@ait.kyushu-u.ac.jp, Makinouchi, Akifumi2 akifumi@cc.kurume-it.ac.jp
Source: IAENG International Journal of Computer Science. Jun2011, Vol. 38 Issue 2, p113-121. 9p.
Subjects: XPath (Computer program language), Indexing, Technology, XML (Extensible Markup Language), Databases, Indexes, Information storage & retrieval systems
Abstract: Indexing technology is one of the kernel technologies in database management systems, especially for large datasets. XML (eXtensible Markup Language) has been successfully adopted as a universal data exchange format, particularly in the WWW environment. It is an important and basic task to efficiently implement XPath axes on XML documents. Using R*-tree, T. Grust proposed an interesting method to support all XPath axes. In this method, all of the nodes of an XML document are mapped to a point set in a five-dimensional space. T. Grust clarified the fact that each of the XPath axes can be implemented by a range query in the abovementioned five-dimensional space. Thus, R*-tree (one of the popular multidimensional indices) was used to improve the query performance for XPath axes. However, according to our investigations, most of the range queries for the XPath axes are partially-dimensional range queries. If the existing multidimensional indices are used for such range queries, a great deal of information that is irrelevant to the queries must also be read from disk. Based on this observation, a new multidimensional index structure, called Adaptive R*-tree (AR*-tree), is proposed herein to support the XPath axes more efficiently. [ABSTRACT FROM AUTHOR]
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 65482951
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A New Structure for Accelerating XPath Location Steps.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yaokai+Feng%22">Yaokai Feng</searchLink><relatesTo>1</relatesTo><i> fengyk@ait.kyushu-u.ac.jp</i><br /><searchLink fieldCode="AR" term="%22Makinouchi%2C+Akifumi%22">Makinouchi, Akifumi</searchLink><relatesTo>2</relatesTo><i> akifumi@cc.kurume-it.ac.jp</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. Jun2011, Vol. 38 Issue 2, p113-121. 9p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22XPath+%28Computer+program+language%29%22">XPath (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Indexing%22">Indexing</searchLink><br /><searchLink fieldCode="DE" term="%22Technology%22">Technology</searchLink><br /><searchLink fieldCode="DE" term="%22XML+%28Extensible+Markup+Language%29%22">XML (Extensible Markup Language)</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Indexes%22">Indexes</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Indexing technology is one of the kernel technologies in database management systems, especially for large datasets. XML (eXtensible Markup Language) has been successfully adopted as a universal data exchange format, particularly in the WWW environment. It is an important and basic task to efficiently implement XPath axes on XML documents. Using R*-tree, T. Grust proposed an interesting method to support all XPath axes. In this method, all of the nodes of an XML document are mapped to a point set in a five-dimensional space. T. Grust clarified the fact that each of the XPath axes can be implemented by a range query in the abovementioned five-dimensional space. Thus, R*-tree (one of the popular multidimensional indices) was used to improve the query performance for XPath axes. However, according to our investigations, most of the range queries for the XPath axes are partially-dimensional range queries. If the existing multidimensional indices are used for such range queries, a great deal of information that is irrelevant to the queries must also be read from disk. Based on this observation, a new multidimensional index structure, called Adaptive R*-tree (AR*-tree), is proposed herein to support the XPath axes more efficiently. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=65482951
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 113
    Subjects:
      – SubjectFull: XPath (Computer program language)
        Type: general
      – SubjectFull: Indexing
        Type: general
      – SubjectFull: Technology
        Type: general
      – SubjectFull: XML (Extensible Markup Language)
        Type: general
      – SubjectFull: Databases
        Type: general
      – SubjectFull: Indexes
        Type: general
      – SubjectFull: Information storage & retrieval systems
        Type: general
    Titles:
      – TitleFull: A New Structure for Accelerating XPath Location Steps.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yaokai Feng
      – PersonEntity:
          Name:
            NameFull: Makinouchi, Akifumi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 38
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1