Advances in web-age information management (6th international conference, WAIM 2005, Hangzhou, China, October 11-13, 2005)Lecture notes in computer science. :32-44
Copyright 2005 INIST-CNRS CC BY 4.0 Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17265554
Database:
PASCAL Archive
Weitere Informationen
The identification of parent-child or ancestor-descendant relationship between XML elements plays a crucial role in efficient XML query processing. One popular method is to code each node in the XML document tree. However, its main problem is that either lacks the ability to support XML documents update or need huge storage space. This paper proposes a new update-supporting coding scheme based on binary-tree to identify the ancestor-descendant relationship or the parent-child relationship in constant time bound, which also effectively supports XML documents update. To reduce the coding space, we then propose a new storage approach, Blocked Binary-Tree Coding scheme (BBTC), whose average code length reduces to O(log(n)). Our extensive experiments show that BBTC significantly outperforms previous ones.
