Access the full text.
Sign up today, get DeepDyve free for 14 days.
Shu-Yao Chien, Zografoula Vagena, Donghui Zhang, V. Tsotras, C. Zaniolo (2002)
Efficient Structural Joins on Indexed XML Documents
H. Jiang, Hongjun Lu, Wei Wang, B. Ooi (2003)
XR-tree: indexing XML data for efficient structural joinsProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
Gunjan Samtani (2002)
Extensible Markup Language (XML)
P. Rao, Bongki Moon (2004)
PRIX: indexing and querying XML using prufer sequencesProceedings. 20th International Conference on Data Engineering
(2005)
XML path language (XPath) 2.0
Paul Dietz (1982)
Maintaining order in a linked list
B. Catania, Wen Wang, B. Ooi, Xiaoling Wang (2005)
Lazy XML updates: laziness as a virtue, of update and structural join efficiency
(2004)
Conf. on Data Engi-neering (ICDE'04)
Enhua Jiao, T. Ling, C. Chan (2005)
PathStack : A Holistic Path Join Algorithm for Path Query with Not-Predicates on XML Data
M. Fernández, Dan Suciu (1998)
Optimizing regular path expressions using graph schemasProceedings 14th International Conference on Data Engineering
Ting Chen, Jiaheng Lu, T. Ling (2005)
On boosting holism in XML twig pattern matching using structural indexing techniques
I. Tatarinov, Stratis Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, Chun Zhang (2002)
Storing and querying ordered XML using a relational database system
Guangming Xing, Bill Tseng (2004)
Extendible range-based numbering scheme for XML documentInternational Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., 2
W. Li (1996)
Number theory with applications
Dao Kha, Masatoshi Yoshikawa, Shunsuke Uemura (2001)
An XML indexing structure with relative region coordinateProceedings 17th International Conference on Data Engineering
Xiaodong Wu, M. Lee, W. Hsu (2004)
A prime number labeling scheme for dynamic ordered XML treesProceedings. 20th International Conference on Data Engineering
Haixun Wang, Sanghyun Park, W. Fan, Philip Yu (2003)
ViST: a dynamic index method for querying XML data by tree structures
S. Abiteboul, Haim Kaplan, T. Milo (2001)
Compact labeling schemes for ancestor queries
P. O'Neil, E. O'Neil, S. Pal, Istvan Cseri, G. Schaller, Nigel Westbury (2004)
ORDPATHs: insert-friendly XML node labels
Jiaheng Lu, Ting Chen, T. Ling (2004)
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
N. Santoro, Ramez Khatib (1985)
Labelling and Implicit Routing in NetworksComput. J., 28
Nicolas Bruno, Nick Koudas, D. Srivastava (2002)
Holistic twig joins: optimal XML pattern matching
Quanzhong Li, Bongki Moon (2001)
Indexing and Querying XML Data for Regular Path Expressions
T. Bray, J. Paoli, C. Sperberg-McQueen (1997)
Extensible markup languageWorld Wide Web, 2
S. Abiteboul, V. Vianu (1997)
Regular path queries with constraints
Changqing Li, T. Ling (2005)
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
H. Jagadish, S. Al-Khalifa, Adriane Chapman, L. Lakshmanan, Andrew Nierman, Stelios Paparizos, J. Patel, D. Srivastava, Nuwee Wiwatwattana, Yuqing Wu, Cong Yu (2002)
TIMBER: A native XML databaseThe VLDB Journal, 11
Chun Zhang, J. Naughton, D. DeWitt, Qiong Luo, G. Lohman (2001)
On supporting containment queries in relational database management systems
G. Gottlob, Christoph Koch, R. Pichler (2003)
XPath query evaluation: improving time and space efficiencyProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
K. Yi, Hao He, I. Stanoi, Jun Yang (2004)
Incremental maintenance of XML structural indexes
Changqing Li, T. Ling, Min Hu (2006)
Efficient Processing of Updates in Dynamic XML Data22nd International Conference on Data Engineering (ICDE'06)
Dao Kha, Masatoshi Yoshikawa, Shunsuke Uemura (2002)
A Structural Numbering Scheme for XML Data
T. Milo, Dan Suciu (1999)
Index Structures for Path Expressions
E. Cohen, Haim Kaplan, T. Milo (2002)
Labeling dynamic XML treesSIAM J. Comput., 39
(2001)
Proc. of the ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'01)
(2001)
Conf. on Very Large Data Bases (VLDB'01)
Masatoshi Yoshikawa, T. Amagasa, Takeyuki Shimura, Shunsuke Uemura (2001)
XRel: a path-based approach to storage and retrieval of XML documents using relational databasesACM Trans. Internet Techn., 1
Adam Silberstein, Hao He, K. Yi, Jun Yang (2005)
BOXes: efficient maintenance of order-based labeling for dynamic XML data21st International Conference on Data Engineering (ICDE'05)
I. Tatarinov, Z. Ives, A. Halevy, Daniel Weld (2001)
Updating XML
F. Yergeau (1998)
UTF-8, a transformation format of ISO 10646RFC, 3629
S. Al-Khalifa, H. Jagadish, Nick Koudas, J. Patel, D. Srivastava, Yuqing Wu (2002)
Structural joins: a primitive for efficient XML query pattern matchingProceedings 18th International Conference on Data Engineering
T. Amagasa, Masatoshi Yoshikawa, Shunsuke Uemura (2003)
QRS: a robust numbering scheme for XML documentsProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
Available at
Ning Zhang, V. Kacholia, M. Özsu (2004)
A succinct physical storage scheme for efficient evaluation of path queries in XMLProceedings. 20th International Conference on Data Engineering
S. Boag (2003)
XQuery 1.0 : An XML query language, W3C Working Draft 12 November 2003
A. Halverson, J. Burger, Leonidas Galanis, A. Kini, R. Krishnamurthy, A. Rao, Feng Tian, Stratis Viglas, Y. Wang, J. Naughton, D. DeWitt (2003)
Mixed Mode XML Query Processing
R. Agrawal, Alexander Borgida, H. Jagadish (1989)
Efficient management of transitive relationships in large data and knowledge bases
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more attention. However, all the existing techniques have high update cost, they cannot completely avoid re-labeling in XML updates, and they will increase the label size which will influence the query performance. Thus, in this paper we propose a novel Compact Dynamic Binary String (CDBS) encoding to efficiently process updates. CDBS has two important properties which form the foundations of this paper: (1) CDBS supports that CDBS codes can be inserted between any two consecutive CDBS codes with orders kept and without re-encoding the existing codes; (2) CDBS is orthogonal to specific labeling schemes; thus it can be applied broadly to different labeling schemes or other applications to efficiently process updates. Moreover, because CDBS will encounter the overflow problem, we improve CDBS to Compact Dynamic Quaternary String (CDQS) encoding which can completely avoid re-labeling in XML leaf node updates no matter what the labeling schemes are. Meanwhile, we also discuss how to efficiently process internal node updates. We report the experimental results to show that our CDBS and CDQS are superior to previous approaches to process both leaf node and internal node updates.
The VLDB Journal – Springer Journals
Published: May 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.