A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Liang, Wenxin; Takahashi, Akihiro; Yokota, Haruo

doi:10.1007/978-3-642-03573-9_2

Cited by 9 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there is an odd number of consecutive 1s appearing before 0, the last two bits 10 represent .1.Otherwise, if there is an even number of consecutive 1s before 0, all of 1s are decoded into 1, and the final "0" is decoded into 0. We can see that in compressing and decompressing DO-VLEI code is easier than ORDPATH, it doesn't require any prefix schema, and it has already been proved in [7] that C-DO-VLEI code outperforms C-ORDPATH in the storage consumption and query performance.…”

Section: C-do-vlei Codementioning

confidence: 81%

“…The same as ORDPATH, in order to save storage space, in the actual storing, we need to compress DO-VLEI code, and the encoding scheme called C-DO-VLEI code [7]. A DO-VLEI code is composed of three elements: ".1", "0" and "1", at most 2 bits can represents three different types of elements.…”

Section: C-do-vlei Codementioning

confidence: 99%

“…It uses the VLEI code [4] for expressing the sibling order by a unique magnitude relationship, which enables the unlimited insertion of new nodes with no relabeling of other nodes being required. Experiments in [7] indicates that the DO-VLEI code outperforms the ORDPATH in both structural information extraction and storage consumption.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Two-Dimension XML Encoding Method based on Variable Length Binary Code

Chen¹,

Liang²,

Yokota³

2011

JSW

Self Cite

View full text Add to dashboard Cite

Recently, the researchers have proposed a number of labeling schemes. In these labeling schemes, the approach which can extract structural information between nodes and process query efficiently is more outstanding. However, most of these labeling schemes do not well support update operations. To achieve update-friendly operations, some of the methods keep intervals between labeling numbers, but it requires whole relabeling when the intervals are used up. Several labeling schemes support dynamic XML documents, but most of these labeling schemes allow only leaf node insertions. OrdPathX supports both leaf node insertions and internal node insertions. Inspired by the method of inserting internal nodes of OrdPathX and extending the C-DO-VLEI code, in this paper we propose two dimensions VLEI code. We discuss how this labeling scheme labels nodes and how we can get the structural information of nodes from their labels. We design experiments to evaluate the efficiency of producing labels, the storage consumption and the querying
performance of two dimensions VLEI code we proposed, and compare those with the OrdPathX

show abstract

Section: C-do-vlei Codementioning

confidence: 81%

Section: C-do-vlei Codementioning

confidence: 99%

See 1 more Smart Citation

A Two-Dimension XML Encoding Method based on Variable Length Binary Code

Chen¹,

Liang²,

Yokota³

2011

JSW

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many useful algorithms that can evaluate a view with tree labeling scheme have been proposed, but the problem is the high cost of creating and maintaining a view. It also develops a scalability problem when the number of users increases [12,14].…”

Section: Related Workmentioning

confidence: 99%

Lightweight Access Control for Resource Limited Clients

Park

2010

2010 4th International Conference on Multimedia and Ubiquitous Engineering

View full text Add to dashboard Cite

As demands for treating an access control on the client side, which is conventionally controlled by a server, increase, there is a need to treat query processing effectively and securely in an environment with limited resources. Access control that has been previously performed only focused on safety, and thus not much effort has been done to consider access control in terms of efficiency. This paper proposes a method for an efficient and secure query processing of XML data streams, such as a personal digital assistant and a portable terminal, at the client side with limited resources. Specifically, this work proposes an access control processing that possesses a small overhead for attaining a secure result in a limited memory and a method to enhance the performance, finding the parts capable of optimizing each processing step for offsetting the overhead caused by the addition of access control processing. The superiority of the new method is analyzed through an experiment.

show abstract

Section: Related Workmentioning

confidence: 99%

Access Control for Energy-Efficient Query Processing

An¹,

Park²

2012

IJCTE

View full text Add to dashboard Cite

Abstract-An access control method has been previously performed only focused on safety, and thus not much effort has been done to consider access control in terms of energy efficiency. In this paper, we proposed a method for an energy-efficient query processing of XML data streams, such as a personal digital assistant and a portable terminal, at the client side with limited resources. Specifically, we proposed an access control processing that possesses a small overhead for attaining a secure result in a limited memory and a method to enhance the performance, finding the parts capable of optimizing each processing step for offsetting the overhead caused by the addition of access control processing. Our new method is analyzed through an experiments.

show abstract

A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Cited by 9 publications

References 14 publications

A Two-Dimension XML Encoding Method based on Variable Length Binary Code

A Two-Dimension XML Encoding Method based on Variable Length Binary Code

Lightweight Access Control for Resource Limited Clients

Access Control for Energy-Efficient Query Processing

Contact Info

Product

Resources

About