XML Encoding Scheme of Supporting Updating Data Completely

Author

Liu Xian-feng ; Zhou, Zhou ; Liu Ping

Author_Institution

Coll. of Math. & Comput. Sci., Hunan Normal Univ., Changsha, China

Volume

2

fYear

2011

fDate

24-25 Sept. 2011

Firstpage

103

Lastpage

107

Abstract

In order to update and query XML data effectively, a new XML encoding scheme is provided in this paper, i.e. fraction and prefix encoding scheme(FPES). FPES makes good use of the fraction characteristics of insertion, unlimited fractions can be inserted between any two fractions to support the infinite update of node data. Experiment show that FPES improves the query efficiency compared with prefix encoding(LSDX), FPES spends less time in encoding and inserting nodes compared with fraction encoding. FPES avoids re-encoding completely. At the same time, FPES also supports the representation of ancestor-descendant relationship, parent-children relationship and sibling relationship between any two nodes.

Keywords

XML; encoding; graph theory; query processing; FPES; XML data query; XML encoding scheme; ancestor-descendant relationship; data updating; fraction and prefix encoding scheme; parent-children relationship; sibling relationship; Benchmark testing; Computers; Database languages; Database systems; Encoding; Internet; XML; FPES; encoding scheme; fraction prefix encoding scheme; updating XML data;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology, Computer Engineering and Management Sciences (ICM), 2011 International Conference on

Conference_Location

Nanjing, Jiangsu

Print_ISBN

978-1-4577-1419-1

Type

conf

DOI

10.1109/ICM.2011.193

Filename

6113479