ARTÍCULO
TITULO

Securing XML Query Processing Storage

Charles Shoniregun    
Oleksandr Logvynovskiy    
Kevin Lu    

Resumen

The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new structural join algorithm called sequence join algorithm, for sequential regular path expressions in securing XML query processing storage. It exploits information about position of the elements in a product to skip generation of the redundant intermediate lists. This paper further discusses the algorithm that performs the merge of several input lists of nodes in one pass. We carried out comparative experiments, and the results prove that the algorithm is better than multiple binary joins algorithm for queries of both small and large cardinality.

Palabras claves

 Artículos similares

       
 
Liang Chen, Yuyi Yang, Zhenheng Wang, Jian Zhang, Shaowu Zhou and Lianghong Wu    
Underwater robot perception is a critical task. Due to the complex underwater environment and low quality of optical images, it is difficult to obtain accurate and stable target position information using traditional methods, making it unable to meet pra... ver más

 
Laura Plaza, Lourdes Araujo, Fernando López-Ostenero and Juan Martínez-Romo    
Online learning is quickly becoming a popular choice instead of traditional education. One of its key advantages lies in the flexibility it offers, allowing individuals to tailor their learning experiences to their unique schedules and commitments. Moreo... ver más

 
Dan Liu, Ting Liu, Hai Bi, Yunpeng Zhao and Yuan Cheng    
In the marine ecological environment, marine microalgae is an important photosynthetic autotrophic organism, which can carry out photosynthesis and absorb carbon dioxide. With the increasingly serious eutrophication of the water body, under certain envir... ver más
Revista: Water

 
Ding Li, Wenzhong Li, Guoqiang Zhang, Yizhou Chen, Xu Zhong, Mingkai Lin and Sanglu Lu    
In many applications, data streams are indispensable to describe the relationships between nodes in networks, such as social networks, computer networks, and hyperlink networks. Fundamentally, a graph stream is a dynamic representation of a graph, which ... ver más
Revista: Applied Sciences

 
Hyung-Ju Cho    
Given a set of facilities F and a query point q, a k-farthest neighbor (kFN) query returns the k farthest facilities f1,f1,⋯,fk" role="presentation">??1,??1,?,????f1,f1,?,fk f 1 , f 1 , ? , f k from q. This study considers the moving k-farthe... ver más
Revista: Algorithms