BBTC: a new update-supporting coding scheme for XML documents

Authors:
Jianhua Feng;Guoliang Li;Lizhu Zhou;Na Ta;Qian Qian;Yuguo Liao
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 6
Cited 2

Type extensions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A query language for XML

WWW '99 Proceedings of the eighth international conference on World Wide Web
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Maintaining order in a linked list

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Exploit sequencing to accelerate XML twig query answering

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An efficient parallel pathstack algorithm for processing XML twig queries on multi-core systems

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.