hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2004.03.05

Structural Join Algorithm for Sequential Regular Path Expressions

Kevin Lu

Puni tekst: engleski, pdf (906 KB) str. 237-250 preuzimanja: 265* citiraj
APA 6th Edition
Lu, K. (2004). Structural Join Algorithm for Sequential Regular Path Expressions. Journal of computing and information technology, 12 (3), 237-250. https://doi.org/10.2498/cit.2004.03.05
MLA 8th Edition
Lu, Kevin. "Structural Join Algorithm for Sequential Regular Path Expressions." Journal of computing and information technology, vol. 12, br. 3, 2004, str. 237-250. https://doi.org/10.2498/cit.2004.03.05. Citirano 22.07.2019.
Chicago 17th Edition
Lu, Kevin. "Structural Join Algorithm for Sequential Regular Path Expressions." Journal of computing and information technology 12, br. 3 (2004): 237-250. https://doi.org/10.2498/cit.2004.03.05
Harvard
Lu, K. (2004). 'Structural Join Algorithm for Sequential Regular Path Expressions', Journal of computing and information technology, 12(3), str. 237-250. https://doi.org/10.2498/cit.2004.03.05
Vancouver
Lu K. Structural Join Algorithm for Sequential Regular Path Expressions. Journal of computing and information technology [Internet]. 2004 [pristupljeno 22.07.2019.];12(3):237-250. https://doi.org/10.2498/cit.2004.03.05
IEEE
K. Lu, "Structural Join Algorithm for Sequential Regular Path Expressions", Journal of computing and information technology, vol.12, br. 3, str. 237-250, 2004. [Online]. https://doi.org/10.2498/cit.2004.03.05

Sažetak
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. It implies generation of superfluous intermediate data. In this paper, we propose a new structural join algorithm, called sequence join algorithm, for sequential regular path expressions. It exploits information about position of the elements in the document to skip generation of the redundant intermediate lists. The algorithm performs merge of several input lists of nodes in one pass. Experimental results prove the structural join algorithm is better than multiple binary join algorithm for queries of both small and large cardinality.

Hrčak ID: 44714

URI
https://hrcak.srce.hr/44714

Posjeta: 366 *